A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
From MaRDI portal
Publication:1382807
DOI10.1016/S0167-6377(97)00036-9zbMath0892.90101MaRDI QIDQ1382807
Publication date: 18 March 1998
Published in: Operations Research Letters (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Cyclic scheduling in a robotic production line ⋮ 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 ⋮ Cycle time analysis of dual-arm cluster tools for wafer fabrication processes with multiple wafer revisiting times ⋮ Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance ⋮ A faster polynomial algorithm for 2-cyclic robotic scheduling ⋮ A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell ⋮ Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions ⋮ Part sequencing in three-machine no-wait robotic cells ⋮ A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line ⋮ Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants ⋮ A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case ⋮ On scheduling cycle shops: Classification, complexity and approximation ⋮ A polynomial algorithm for 2-degree cyclic robot scheduling
Cites Work
- Unnamed Item
- A network flow algorithm for just-in-time project scheduling
- An exact optimal cyclic scheduling algorithm for multioperator service of a production line
- On a scheduling problem in a robotized analytical system
- Optimization of multistage cyclic service of a production line by a transmanipulator
This page was built for publication: A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling