A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows

DOI10.1080/00207540903225205zbMath1197.90340OpenAlexW2048928932WikidataQ57185703 ScholiaQ57185703MaRDI QIDQ3163144

Chengbin Chu, Pengyu Yan, Naiding Yang, Ada Che

Publication date: 25 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540903225205

zbMATH Keywords

branch and bound algorithmcyclic schedulingrobotic cellmethod of prohibited intervalsprocessing time windows

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

Algorithms for single-machine scheduling problem with deterioration depending on a novel model ⋮ Robust optimization for the cyclic hoist scheduling problem ⋮ A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times ⋮ A dynamic scheduling approach for optimizing the material handling operations in a robotic cell ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Bi-objective speed-scaling robotic cell scheduling with peak power consumption constraint ⋮ Cyclic flowshop scheduling with operators and robots: Vyacheslav Tanaev's vision and lasting contributions ⋮ Multi-machine scheduling with interval constrained position-dependent processing times ⋮ Joint production and transportation scheduling in flexible manufacturing systems ⋮ Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants

Cites Work

• Approximation algorithms for \(k\)-unit cyclic solutions in robotic cells
• Sequencing and scheduling in robotic cells: recent developments
• A faster polynomial algorithm for 2-cyclic robotic scheduling
• A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• A bounding scheme for deriving the minimal cycle time of a single- transporter \(N\)-stage process with time-window constraints
• Scheduling large robotic cells without buffers
• Cyclic scheduling in robotic flowshops
• Cyclic hoist scheduling in large real-life electroplating lines
• Scheduling in robotic cells: process flexibility and cell layout
• Scheduling in Robotic Cells: Heuristics and Cell Design
• Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approach
• Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming 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