Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
From MaRDI portal
Publication:6109346
DOI10.1016/j.cor.2022.106133MaRDI QIDQ6109346
Baruch Mor, Gur Mosheiov, Matan Atsmony
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
90Bxx: Operations research and management science
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling with time-changing effects and rate-modifying activities
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- Single machine flow-time scheduling with scheduled maintenance
- 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
- Robust single machine scheduling with a flexible maintenance activity
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
- Minimizing total late work on a single machine with generalized due-dates
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance
- Single machine scheduling with non-availability interval and optional job rejection
- Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
- Single-machine scheduling with operator non-availability to minimize total weighted completion time
- Two-agent single-machine scheduling with assignable due dates
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
- Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- Machine scheduling with an availability constraint
- Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling a maintenance activity on parallel identical machines
- Single Machine Scheduling to Minimize Total Late Work
- Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals
- Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs