A note on a single-machine lot scheduling problem with indivisible orders

DOI10.1016/j.cor.2016.10.004zbMath1391.90329OpenAlexW2530743302MaRDI QIDQ1652143

Wen-Hung Kuo, Yung-Tsung Hou, Dar-Li Yang

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.10.004

zbMATH Keywords

integer programmingsingle machinetotal completion timelot schedulingindivisible order

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

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 lot scheduling on a single machine to minimize maximum weighted tardiness, Single machine batch scheduling with two non-disjoint agents and splitable jobs

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
• 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