One-machine batching and sequencing of multiple-type items
From MaRDI portal
Publication:1332828
DOI10.1016/0305-0548(94)90001-9zbMath0805.90059OpenAlexW1983855037MaRDI QIDQ1332828
Cheng, T. C. Edwin, Zhi-Long Chen, Oguz, Ceyda
Publication date: 5 September 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(94)90001-9
Related Items
A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs, Generalized order acceptance and scheduling problem with batch delivery: models and metaheuristics, Single-machine batch scheduling minimizing weighted flow times and delivery costs, MILP models to minimise makespan in additive manufacturing machine scheduling problems, Scheduling results applicable to decision-theoretic troubleshooting, Scheduling with batching: A review, A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups, Family scheduling with batch availability in flow shops to minimize makespan, A survey of scheduling problems with setup times or costs, Minimizing maximum tardiness and delivery costs with batch delivery and job release times
Cites Work
- Batch sizing and job sequencing on a single machine
- Single facility multi-class job scheduling
- Batching in single operation manufacturing systems
- One-pass batching algorithms for the one-machine problem
- Batching to Minimize Flow Times on One Machine
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- On the Complexity of Scheduling with Batch Setup Times
- Single-Server, Two-Machine Sequencing with Switching Time