Minsum scheduling with acceptable lead-times and optional job rejection

DOI10.1007/s11590-021-01763-8zbMath1489.90031OpenAlexW3177621706MaRDI QIDQ2119760

Baruch Mor, Dana Shapira

Publication date: 30 March 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01763-8

zbMATH Keywords

single-machine schedulingdynamic programmingdue-date assignmentjob-rejectionminsum

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (2)

A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection

Cites Work

• Unnamed Item
• Unnamed Item
• A note: minmax due-date assignment problem with lead-time cost
• A survey on offline scheduling with rejection
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
• Optimal due date assignment in multi-machine scheduling environments
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• Two due date assignment problems in scheduling a single machine
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• Single-machine scheduling under the job rejection constraint
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Single-machine scheduling and due date assignment with rejection and position-dependent processing times
• A note on ``Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
• Minmax due-date assignment with a time window for acceptable lead-times
• Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
• Minimizing Total Tardiness on One Machine is NP-Hard
• Theory and Applications of Models of Computation
• On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops

This page was built for publication: Minsum scheduling with acceptable lead-times and optional job rejection