Scheduling with finite capacity input buffers

DOI10.1287/OPRE.46.3.S154MaRDI QIDQ2781130zbMATH OpenFDO

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

Publication date 18 March 2002

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/OPRE.46.3.S154

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Preemptive scheduling with finite capacity input buffers
• Scheduling with finite capacity output buffers
• Online scheduling with a buffer on related machines
• Scheduling jobs with release times on a machine with finite storage
• Job-shop scheduling with limited capacity buffers

Cited in

(13)

• Minimum loss scheduling problems
• Preemptive scheduling with finite capacity input buffers
• Asymptotic scheduling
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• Optimally rescheduling jobs with a last-in-first-out buffer
• Scheduling with finite capacity output buffers
• Multi-objective master production scheduling in make-to-order manufacturing
• Scheduling of a job-shop problem with limited output buffers
• Single-machine scheduling to minimize the size of input buffer
• Job-shop scheduling problem with limited input buffers: mathematical models and solution methods
• A cyclic versus flexible approach to materials ordering in make-to-order assembly
• Job-shop scheduling with limited capacity buffers
• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers

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

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