A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots

DOI10.1016/S0305-0548(97)00033-6zbMath0907.90183OpenAlexW2091823578MaRDI QIDQ1265862

Konstantin Kogan, Eugene Levner

Publication date: 27 September 1998

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00033-6

zbMATH Keywords

makespan\(n\)-job, two-machine, multi-robot flowshop scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

Cyclic multiple-robot scheduling with time-window constraints using a critical path approach ⋮ Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance ⋮ Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization ⋮ Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times ⋮ A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell ⋮ The significance of reducing setup times/setup costs ⋮ A survey of scheduling problems with setup times or costs ⋮ Quantitative production scheme model for an automated manufacturing system ⋮ The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies

Cites Work

• An effective solution of the Bellman-Johnson problem on a tree-like network
• Scheduling models and methods in optimal freight transportation planning
• Scheduling a two-machine robotic cell: A solvable case
• Optimal two- and three-stage production schedules with setup times included
• Scheduling Parts in a Combined Production-transportation Work Cell
• TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS
• Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects