Scheduling with finite capacity output buffers

DOI10.1287/OPRE.46.3.S84MaRDI QIDQ2770137zbMATH OpenOpenAlexFDO

Authors Nicholas G. Hall, Marc E. Posner, Chris N. Potts

Publication date 7 February 2002

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.46.3.s84

zbMATH Keywords

capacityoutput buffersingle machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling with finite capacity input buffers
• Preemptive scheduling with finite capacity input buffers
• Scheduling jobs with release times on a machine with finite storage
• Job-shop scheduling with limited capacity buffers
• Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics

Cited in

(10)

• Preemptive scheduling with finite capacity input buffers
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• Integer programming approach to production scheduling for make-to-order manufacturing
• Scheduling with finite capacity input buffers
• Multi-objective master production scheduling in make-to-order manufacturing
• Scheduling of a job-shop problem with limited output buffers
• Hierarchical approach to production scheduling in make-to-order assembly
• Single-machine scheduling to minimize the size of input buffer
• A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing
• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers

This page was built for publication: Scheduling with finite capacity output buffers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770137)