Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
From MaRDI portal
Publication:337029
DOI10.1016/j.cor.2014.02.004zbMath1348.90243OpenAlexW2018438060MaRDI QIDQ337029
Hamid Allaoui, Saïd Hanafi, Abdelhakim Artiba, Rachid Benmansour
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.02.004
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (5)
Scheduling preventive railway maintenance activities with resource constraints ⋮ Variable neighborhood search for the single machine scheduling problem to minimize the total early work ⋮ General variable neighborhood search for the parallel machine scheduling problem with two common servers ⋮ Single-machine common due date total earliness/tardiness scheduling with machine unavailability ⋮ Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance
Cites Work
- Unnamed Item
- Unnamed Item
- Single-machine scheduling with periodic maintenance to minimize makespan
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- A single-machine scheduling problem with maintenance activities to minimize makespan
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
- Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
- Periodic-replacement models with threshold levels
- Sequencing with Earliness and Tardiness Penalties: A Review
- Scheduling
- Single machine weighted earliness-tardiness penalty problem with a common due date
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
This page was built for publication: Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance