Minimizing total late work on a single machine with generalized due-dates
From MaRDI portal
Publication:2030324
DOI10.1016/j.ejor.2020.12.061zbMath1487.90309OpenAlexW3119307998MaRDI QIDQ2030324
Dvir Shabtay, Gur Mosheiov, Daniel Oron
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.061
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (14)
Pareto-scheduling of two competing agents with their own equal processing times ⋮ A survey of job shop scheduling problem: the types and models ⋮ Single machine scheduling with rejection and generalized parameters ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ A no-delay single machine scheduling problem to minimize total weighted early and late work ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Single machine scheduling with assignable due dates to minimize maximum and total late work ⋮ Order acceptance and scheduling with delivery under generalized parameters ⋮ Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- A single machine scheduling problem to minimize total early work
- A survey on offline scheduling with rejection
- Scheduling with time-changing effects and rate-modifying activities
- Dominance relations for two-machine flow shop problem with late work criterion
- Single-machine scheduling under the job rejection constraint
- On the complexity of generalized due date scheduling problems
- Minimizing maximum absolute lateness and range of lateness under generalized due dates on a single machine
- A note on the SPT heuristic for solving scheduling problems with generalized due dates
- Single machine scheduling with assignable due dates
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
- The two-machine flow-shop problem with weighted late work criterion and common due date
- On the parameterized tractability of single machine scheduling with rejection
- Rescheduling under disruptions in manufacturing systems. Models and algorithms
- Two-agent single-machine scheduling with assignable due dates
- Regular scheduling measures on proportionate flowshop with job rejection
- Comments on ``Proportionate flowshops with general position dependent processing times and ``Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- Machine scheduling with an availability constraint
- An improved heuristic for parallel machine scheduling with rejection
- Minimizing Total Tardiness on One Machine is NP-Hard
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- Single Machine Scheduling to Minimize Total Late Work
- Single-machine batch scheduling problem with job rejection and resource dependent processing times
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Two-machine flow-shop scheduling to minimize total late work: revisited
- Single‐machine scheduling with deadlines to minimize the total weighted late work
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- A new class of scheduling criteria and their optimization
This page was built for publication: Minimizing total late work on a single machine with generalized due-dates