Scheduling no-wait robotic cells with two and three machines
From MaRDI portal
Publication:1569933
DOI10.1016/S0377-2217(99)00258-1zbMath0967.90042OpenAlexW2011960863MaRDI QIDQ1569933
Publication date: 4 September 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00258-1
Related Items (22)
An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem ⋮ A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots ⋮ Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization ⋮ 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 ⋮ 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 ⋮ A survey of scheduling problems with no-wait in process ⋮ Identical part production in cyclic robotic cells: Concepts, overview and open questions ⋮ Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm ⋮ On the existence of dominating 6-cyclic schedules in four-machine robotic cells ⋮ Part sequencing in three-machine no-wait robotic cells ⋮ Robotic cell scheduling with operational flexibility ⋮ Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells ⋮ Throughput optimization in robotic cells with input and output machine buffers: a comparative study of two key models ⋮ 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 ⋮ 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 ⋮ On scheduling cycle shops: Classification, complexity and approximation ⋮ Scheduling dual gripper robotic cell: one-unit cycles
Cites Work
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- Scheduling of parts and robot activities in a two machine robotic cell
- A Linear Programming Approach to the Cutting-Stock Problem
- The Three-Machine No-Wait Flow Shop is NP-Complete
- Sequencing of robot activities and parts in two-machine robotic cells
- Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
- Cyclic Scheduling of Identical Parts in a Robotic Cell
- On A Conjecture About Robotic Cells: New Simplified Proof For The Three-Machine Case
This page was built for publication: Scheduling no-wait robotic cells with two and three machines
