Part sequencing in three-machine no-wait robotic cells

DOI10.1016/S0167-6377(00)00046-8zbMath1096.90542MaRDI QIDQ5929148

Dario Pacciarelli, Alessandro Agnetis

Publication date: 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

No-wait flow shopNP-complete problemsPolynomial algorithmsRobotic cells

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times ⋮ A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots ⋮ Sequencing and scheduling in robotic cells: recent developments ⋮ A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell ⋮ Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints ⋮ A survey of scheduling problems with no-wait in process ⋮ Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells ⋮ A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line ⋮ An optimization-based heuristic for the robotic cell problem ⋮ Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots ⋮ A review of TSP based approaches for flowshop scheduling

Cites Work

• Unnamed Item
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
• Scheduling no-wait robotic cells with two and three machines
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• Cyclic Scheduling of Identical Parts in a Robotic Cell
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem