Lot scheduling on a single machine

DOI10.1016/j.ipl.2014.06.016zbMath1371.90055OpenAlexW2000709104MaRDI QIDQ402382

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

zbMATH Keywords

schedulingsingle machineordertotal completion timelot scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Single machine lot scheduling to minimize the total weighted (discounted) completion time ⋮ Single machine lot scheduling with non-uniform lot capacities and processing times ⋮ A note on a single-machine lot scheduling problem with indivisible orders ⋮ A note on lot scheduling on a single machine to minimize maximum weighted tardiness ⋮ 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 ⋮ Single machine batch scheduling with two non-disjoint agents and splitable jobs ⋮ Single machine lot scheduling with optional job-rejection

Cites Work

• 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
• Scheduling with batching: A review
• A survey of scheduling problems with setup times or costs
• 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

This page was built for publication: Lot scheduling on a single machine