Job-shop scheduling with limited capacity buffers
From MaRDI portal
Publication:850665
DOI10.1007/s00291-005-0008-1zbMath1101.90029OpenAlexW2052934732MaRDI QIDQ850665
Silvia Heitmann, Tim Nieberg, Peter Brucker, Johann L. Hurink
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
Related Items (9)
Scheduling of a job-shop problem with limited output buffers ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ Large-scale periodic scheduling in time-sensitive networks ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem ⋮ The flexible blocking job shop with transfer and set-up times ⋮ Complexity of single machine scheduling subject to nonnegative inventory constraints ⋮ The blocking job shop with rail-bound transportation ⋮ Online scheduling FIFO policies with admission and push-out
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
This page was built for publication: Job-shop scheduling with limited capacity buffers
