Single machine lot scheduling to minimize the total weighted (discounted) completion time

DOI10.1016/j.ipl.2018.10.002zbMath1469.90078OpenAlexW2896866264MaRDI QIDQ1628686

Y. Aharonov

Publication date: 5 December 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.10.002

zbMATH Keywords

single machinelot schedulingWSPT rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

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

• Unnamed Item
• Lot scheduling on a single machine
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
• Batching in single operation manufacturing systems
• One-pass batching algorithms for the one-machine problem
• A polynomial algorithm for a one machine batching problem
• A note on a single-machine lot scheduling problem with indivisible orders
• Minimizing flow-time on a single machine with integer batch sizes
• Single batch machine scheduling with deliveries

This page was built for publication: Single machine lot scheduling to minimize the total weighted (discounted) completion time