Lot scheduling on a single machine
From MaRDI portal
Publication:402382
DOI10.1016/J.IPL.2014.06.016zbMATH Open1371.90055OpenAlexW2000709104MaRDI QIDQ402382FDOQ402382
Authors: Yung-Tsung Hou, Dar-Li Yang, Wen-Hung Kuo 
Publication date: 28 August 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.06.016
Recommendations
- Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
- Single machine lot scheduling with non-uniform lot capacities and processing times
- A note on a single-machine lot scheduling problem with indivisible orders
- Lot-size scheduling of a single product on unrelated parallel machines
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
Cites Work
- Scheduling with batching: A review
- A survey of scheduling problems with setup times or costs
- Batching in single operation manufacturing systems
- Batching to Minimize Flow Times on Parallel Heterogeneous Machines
- Minimizing flow-time on a single machine with integer batch sizes
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine
- Batch scheduling of identical jobs on parallel identical machines
- One-pass batching algorithms for the one-machine problem
- A polynomial algorithm for a one machine batching problem
Cited In (12)
- Single-machine lot scheduling with variable lot processing times
- A note on lot scheduling on a single machine to minimize maximum weighted tardiness
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- A note on a single-machine lot scheduling problem with indivisible orders
- Single machine lot scheduling with optional job-rejection
- Single machine lot scheduling with non-uniform lot capacities and processing times
- Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
- A note on the single machine CON and CONW problems with lot scheduling
- Lot-size scheduling of a single product on unrelated parallel machines
- Single machine batch scheduling with two non-disjoint agents and splitable jobs
- Multi-level, single-machine lot sizing and scheduling (with initial inventory)
- Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine
This page was built for publication: Lot scheduling on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402382)
