Job-shop scheduling with limited capacity buffers
From MaRDI portal
Publication:850665
DOI10.1007/s00291-005-0008-1zbMath1101.90029MaRDI QIDQ850665
Peter Brucker, Johann L. Hurink, Silvia Heitmann, Tim Nieberg
Publication date: 3 November 2006
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-005-0008-1
90B35: Deterministic scheduling theory in operations research
Related Items
The blocking job shop with rail-bound transportation, Online scheduling FIFO policies with admission and push-out, Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots, The flexible blocking job shop with transfer and set-up times, Complexity of single machine scheduling subject to nonnegative inventory constraints
Cites Work
- Unnamed Item
- A two-machine permutation flow shop scheduling problem with buffers
- Flow-shop problems with intermediate buffers
- The permutation flow shop with buffers: A tabu search approach
- Job-shop scheduling with blocking and no-wait constraints
- Flowshop sequencing problems with limited buffer storage
- Flowshop scheduling with limited temporary storage