Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
DOI10.1016/j.apm.2009.04.014zbMath1185.90084OpenAlexW2026949381MaRDI QIDQ967809
Chou-Jung Hsu, Chwen-Tzeng Su, Chinyao Low, Min Ji
Publication date: 2 May 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2009.04.014
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (22)
Cites Work
- Unnamed Item
- Single machine flow-time scheduling with scheduled maintenance
- Single-machine scheduling with periodic maintenance to minimize makespan
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Machine scheduling with availability constraints
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Scheduling with limited machine availability
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- Single-machine scheduling with flexible and periodic maintenance
- Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
- Single machine scheduling with a restricted rate-modifying activity
This page was built for publication: Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance