Cyclic job shop scheduling problems with blocking
From MaRDI portal
Publication:940885
DOI10.1007/s10479-007-0276-zzbMath1151.90397OpenAlexW2006215874MaRDI QIDQ940885
Peter Brucker, Thomas Kampmeyer
Publication date: 3 September 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0276-z
Related Items (14)
Cyclic flow-shop scheduling with no-wait constraints and missing operations ⋮ A branch and bound algorithm for the cyclic job-shop problem with transportation ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ Staff scheduling in blood collection problems ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ A mixed integer programming model for the cyclic job-shop problem with transportation ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources ⋮ Open shop cyclic scheduling ⋮ A general model for cyclic machine scheduling problems ⋮ A new neighborhood and tabu search for the blocking job shop ⋮ The flexible blocking job shop with transfer and set-up times ⋮ A fine-grained parallel algorithm for the cyclic flexible job shop problem ⋮ Multiobjective fuzzy mixed assembly line sequencing optimization model
Cites Work
- Unnamed Item
- Unnamed Item
- Tabu search algorithms for cyclic machine scheduling problems
- A general model for cyclic machine scheduling problems
- Study of a NP-hard cyclic scheduling problem: The recurrent job-shop
- Job-shop scheduling with blocking and no-wait constraints
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Tabu Search—Part I
- Tabu Search—Part II
- Les problèmes d'ordonnancement
This page was built for publication: Cyclic job shop scheduling problems with blocking
