A note on lot scheduling on a single machine to minimize maximum weighted tardiness

DOI10.1007/S10878-023-01040-7OpenAlexW4381616416MaRDI QIDQ6166192

Gur Mosheiov, Assaf Sarig

Publication date: 2 August 2023

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

Full work available at URL: https://doi.org/10.1007/s10878-023-01040-7

zbMATH Keywords

single machinelot schedulingmaximum weighted tardinesspolynomial-time solution

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Lot scheduling on a single machine
• 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
• 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
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Single-machine lot scheduling with variable lot processing times

This page was built for publication: A note on lot scheduling on a single machine to minimize maximum weighted tardiness