Optimal cyclic scheduling of a hoist and multi-type parts with fixed processing times
From MaRDI portal
Publication:3163706
DOI10.1080/00207540802552659zbMath1197.90198OpenAlexW1970801960WikidataQ57185734 ScholiaQ57185734MaRDI QIDQ3163706
Pengyu Yan, Chengbin Chu, Naiding Yang, Ada Che
Publication date: 26 October 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540802552659
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Cyclic scheduling of parts and robot moves in \(m\)-machine robotic cells, An efficient new heuristic for the hoist scheduling problem, Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions, Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants
Cites Work
- Sequencing and scheduling in robotic cells: recent developments
- A faster polynomial algorithm for 2-cyclic robotic scheduling
- Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- Scheduling in robotic cells: Complexity and steady state analysis
- Scheduling large robotic cells without buffers
- A polynomial algorithm for 2-degree cyclic robot scheduling
- Cyclic hoist scheduling in large real-life electroplating lines
- Scheduling Multiple Parts in a Robotic Cell Served by a Dual-Gripper Robot
- The relationship between the physical layout of the work stations and the productivity of a saturated single-hoist production line
- Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
- An algorithm for hoist scheduling problems
- Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
- Scheduling a wet station for wafer cleaning with multiple job flows and multiple wafer-handling robots
- Deadlock modeling and control of semiconductor track systems using resource-oriented Petri nets
- Part sequencing in three-machine no-wait robotic cells