Single machine lot scheduling with non-uniform lot capacities and processing times

DOI10.1007/s10878-020-00654-5zbMath1495.90068OpenAlexW3088888163MaRDI QIDQ2156300

Yanyan Li

Publication date: 18 July 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00654-5

zbMATH Keywords

algorithmssingle machinelot schedulingWSPT rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Lot scheduling on a single machine
• Batch scheduling of identical jobs on parallel identical machines
• Batching in single operation manufacturing systems
• One-pass batching algorithms for the one-machine problem
• A polynomial algorithm for a one machine batching problem
• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• A note on a single-machine lot scheduling problem with indivisible orders
• Minimizing flow-time on a single machine with integer batch sizes
• Optimal Scheduling of Products with Two Subassemblies on a Single Machine
• Batching to Minimize Flow Times on Parallel Heterogeneous Machines
• Single-machine lot scheduling with variable lot processing times

This page was built for publication: Single machine lot scheduling with non-uniform lot capacities and processing times