Optimal K-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times
DOI10.1007/S10951-015-0448-7zbMATH Open1341.90050OpenAlexW2196404734MaRDI QIDQ282247FDOQ282247
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
Recommendations
- scientific article; zbMATH DE number 6796346
- Improved genetic algorithm for cluster tool scheduling problem
- A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups
- A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times
- The scheduling and performance analysis of cluster tools with buffers based on branch searching
mixed integer linear programming\(K\)-unit cyclesgeneral robot moving timesmulti-cluster toolsresidency constraints
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mixed integer programming (90C11) Production models (90B30)
Cites Work
- 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
- 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
Cited In (3)
This page was built for publication: Optimal \(K\)-unit cycle scheduling of two-cluster tools with residency constraints and general robot moving times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q282247)