A branch and bound algorithm for the cyclic job-shop problem with transportation
From MaRDI portal
Publication:339670
DOI10.1016/J.COR.2012.04.008zbMath1349.90321OpenAlexW2005389774MaRDI QIDQ339670
Peter Brucker, Sven Groenemeyer, Edmund Kieran Burke
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.008
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
A hybrid metaheuristic algorithm to optimise a real-world robotic cell ⋮ A branch and bound algorithm for the cyclic job-shop problem with transportation ⋮ The blocking job shop with rail-bound transportation
Cites Work
- Unnamed Item
- A branch and bound algorithm for the cyclic job-shop problem with transportation
- Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
- Cyclic job shop scheduling problems with blocking
- A general model for cyclic machine scheduling problems
- Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
- Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
- An improved algorithm for cyclic flowshop scheduling in a robotic cell
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- Scheduling large robotic cells without buffers
- Using duplication for scheduling unitary tasks on m processors with unit communication delays
- The complexity of cyclic shop scheduling problems
- Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
- Performance Measures and Schedules in Periodic Job Shops
- Cyclic Scheduling of Identical Parts in a Robotic Cell
This page was built for publication: A branch and bound algorithm for the cyclic job-shop problem with transportation