Cyclic scheduling in 3-machine robotic flow shops
From MaRDI portal
Publication:1283916
DOI<35::AID-JOS15>3.0.CO;2-J 10.1002/(SICI)1099-1425(199901/02)2:1<35::AID-JOS15>3.0.CO;2-JzbMath0919.90086MaRDI QIDQ1283916
Yves Cramer, Joris van de Klundert
Publication date: 5 September 1999
Published in: Journal of Scheduling (Search for Journal in Brave)
Related Items
Bicriteria robotic cell scheduling, A note on productivity gains in flexible robotic cells, Scheduling in a three-machine robotic flexible manufacturing cell, Sequencing and scheduling in robotic cells: recent developments, A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times, Scheduling in robotic cells: process flexibility and cell layout, Pure cycles in flexible robotic cells, Identical part production in cyclic robotic cells: Concepts, overview and open questions, On the existence of dominating 6-cyclic schedules in four-machine robotic cells, Robotic cell scheduling with operational flexibility, Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells, Cyclic scheduling of a 2-machine robotic cell with tooling constraints, Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times, A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case, Cycles and permutations in robotic cells, Scheduling dual gripper robotic cell: one-unit cycles
Cites Work
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Some complexity results in cyclic scheduling
- Scheduling large robotic cells without buffers
- Flowshop scheduling with limited temporary storage
- 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
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
