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

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

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

Recommendations

• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness
• Single machine scheduling to minimize total weighted tardiness
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Minimizing the maximum of job with weighted lateness in a single machine problem
• STACS 2004
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs

zbMATH Keywords

single machinelot schedulingmaximum weighted tardinesspolynomial-time solution

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Lot scheduling on a single machine
• Single-machine lot scheduling with variable lot processing times
• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• A note on a single-machine lot scheduling problem with indivisible orders
• 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 lot scheduling with optional job-rejection

Cited In (4)

• Single machine lot scheduling to minimize the total weighted (discounted) completion time
• A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• Polynomial time algorithms to find Pareto optimal schedules of bicriteria lot scheduling problems with splitable jobs on a single parallel-batch machine

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166192)