Routing Two-Machine Flowshop Problems on Networks with Special Structure

DOI10.1287/TRSC.30.4.303MaRDI QIDQ4346443zbMATH OpenOpenAlexFDO

Authors Igor Averbakh, Oded Berman

Publication date 9 September 1997

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.30.4.303

zbMATH Keywords

cactusesmakespanrouting-schedulingtransportation networktreestwo-machine flowshop

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
• A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
• Routing open shop and flow shop scheduling problems
• On the routing open shop problem with two machines on a two-vertex network
• The routing open-shop problem on a network: complexity and approximation

Cited in

(17)

• A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Irreducible bin packing and normality in routing open shop
• The routing open-shop problem on a network: complexity and approximation
• A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
• The traveling salesman problem with job-times (\textit{TSPJ})
• Heuristic solution algorithm for routing flow shop with buffers and ready times
• The 2-Machine Routing Open Shop on a Triangular Transportation Network
• Transporting jobs through a two‐machine open shop
• Routing open shop and flow shop scheduling problems
• A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
• Combination of two-machine flow shop scheduling and shortest path problems
• Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass
• On the routing open shop problem with two machines on a two-vertex network
• Scheduling in manufacturing with transportation: classification and solution techniques
• An exact solution with an improved running time for the routing flow shop problem with two machines
• Transportation and delivery in flow-shop scheduling problems: a systematic review

This page was built for publication: Routing Two-Machine Flowshop Problems on Networks with Special Structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346443)