Job-shop scheduling with limited capacity buffers

DOI10.1007/s00291-005-0008-1zbMath1101.90029MaRDI 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

zbMATH Keywords

Job-shop problem; Alternative graph; Buffer; Disjunctive graph

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Scheduling of a job-shop problem with limited output buffers, The blocking job shop with rail-bound transportation, Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem, Online scheduling FIFO policies with admission and push-out, Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements, 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, Large-scale periodic scheduling in time-sensitive networks

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