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

DOI10.1016/S0305-0548(97)00033-6MaRDI QIDQ1265862zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
• Flowshop Scheduling of Robotic Cells with Job-dependent Transportation and Set-up Effects
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
• A polynomial algorithm for 2-degree cyclic robot scheduling

Cites work

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

Cited in

(14)

• The two-machine flowshop scheduling problem with sequence-independent setup times: new lower bounding strategies
• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
• Scheduling for multi-robot routing with blocking and enabling constraints
• Algorithms for sequencing robot activities in a robot-centered parallel- processor workcell
• Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization
• Quantitative production scheme model for an automated manufacturing system
• The significance of reducing setup times/setup costs
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
• A survey of scheduling problems with setup times or costs
• Scheduling twin robots on a line
• The robot sequencing problem: polynomial algorithm and complexity
• Algorithms to minimize total completion time in a two-machine flowshop problem with uncertain set-up times
• Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
• A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell

This page was built for publication: A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots

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