A branch and bound algorithm for the cyclic job-shop problem with transportation

DOI10.1016/J.COR.2012.04.008MaRDI QIDQ339670zbMATH OpenOpenAlexFDO

Authors Peter Brucker, Sven Groenemeyer, Edmund K. 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

zbMATH Keywords

transportbranch and boundblockingcyclic job-shopminimal cycle time

Mathematics Subject Classification ID

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

Recommendations

• A mixed integer programming model for the cyclic job-shop problem with transportation
• Optimization of multistage cyclic service of a production line by a transmanipulator
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• A general model for cyclic machine scheduling problems
• Cyclic job shop scheduling problems with blocking

Cites work

• A branch and bound algorithm for the cyclic job-shop problem with transportation
• A general model for cyclic machine scheduling problems
• An improved algorithm for cyclic flowshop scheduling in a robotic cell
• Cyclic Scheduling of Identical Parts in a Robotic Cell
• Cyclic job shop scheduling problems with blocking
• Cyclic multiple-robot scheduling with time-window constraints using a critical path approach
• Cyclic scheduling problems.
• Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints
• Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots
• Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm
• Performance Measures and Schedules in Periodic Job Shops
• Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
• Scheduling large robotic cells without buffers
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• The complexity of cyclic shop scheduling problems
• Using duplication for scheduling unitary tasks on m processors with unit communication delays

Cited in

(6)

• A hybrid metaheuristic algorithm to optimise a real-world robotic cell
• The blocking job shop with rail-bound transportation
• A mixed integer programming model for the cyclic job-shop problem with transportation
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
• A branch and bound algorithm for the cyclic job-shop problem with transportation
• Optimization of multistage cyclic service of a production line by a transmanipulator

This page was built for publication: A branch and bound algorithm for the cyclic job-shop problem with transportation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339670)