A mixed integer programming model for the cyclic job-shop problem with transportation

DOI10.1016/j.dam.2012.04.001zbMath1247.90153OpenAlexW1972303305MaRDI QIDQ442206

Peter Brucker, Sven Groenemeyer, Edmund Kieran Burke

Publication date: 10 August 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.04.001

zbMATH Keywords

transportinteger programmingblockingcyclic job-shopminimal cycle time

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

A mixed integer programming model for the cyclic job-shop problem with transportation ⋮ Joint production and transportation scheduling in flexible manufacturing systems

Cites Work

• Unnamed Item
• Unnamed Item
• A mixed integer programming model for the cyclic job-shop problem with transportation
• Tabu search algorithms for cyclic machine scheduling problems
• Cyclic job shop scheduling problems with blocking
• A general model for cyclic machine scheduling problems
• A parametric critical path problem and an application for cyclic scheduling
• The complexity of scheduling jobs in repetitive manufacturing systems
• Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Cyclic Schedules for Job Shops with Identical Jobs
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays

This page was built for publication: A mixed integer programming model for the cyclic job-shop problem with transportation