Optimal \(K\)-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times
DOI10.1007/s10951-015-0448-7zbMath1341.90050OpenAlexW2196404734MaRDI QIDQ282247
Publication date: 12 May 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0448-7
mixed integer linear programming\(K\)-unit cyclesgeneral robot moving timesmulti-cluster toolsresidency constraints
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times
- Parametric algorithms for 2-cyclic robot scheduling with interval processing times
- Exact methods for the robotic cell problem
- A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints
- Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
- Sequencing and scheduling in robotic cells: recent developments
- An optimization-based heuristic for the robotic cell problem
- A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
- Cyclic scheduling in a robotic production line
- A solution for cyclic scheduling of multi-hoists without overlapping
- Throughput optimization in robotic cells
- Cyclic Scheduling of Identical Parts in a Robotic Cell
- Scheduling in Robotic Cells: Heuristics and Cell Design
- Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach
This page was built for publication: Optimal \(K\)-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times
