A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
From MaRDI portal
Publication:1015007
DOI10.1016/j.ejor.2008.07.021zbMath1159.68359OpenAlexW2032494347MaRDI QIDQ1015007
Yunqiang Yin, Dehua Xu, Hong-Xing Li
Publication date: 30 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.07.021
Related Items
Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures, Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities, Some scheduling problems with general position-dependent and time-dependent learning effects, Minimizing total completion time on a single machine with a flexible maintenance activity, Single-machine scheduling with periodic maintenance to minimize makespan revisited, The study of group scheduling problems with general dual-position-based job processing times, Robust single machine scheduling with a flexible maintenance activity, Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times, Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance, Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects, A single-machine scheduling problem with maintenance activities to minimize makespan, Two-machine flow shop and open shop scheduling problems with a single maintenance window, Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
Cites Work
- Scheduling jobs under increasing linear machine maintenance time
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
- Single-machine scheduling with periodic maintenance to minimize makespan
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Two-machine flowshop scheduling with consecutive availability constraints
- Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
- Makespan minimization for two parallel machines with an availability constraint
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Parallel machine scheduling with machine availability and eligibility constraints
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Machine scheduling with an availability constraint
- Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
- Machine scheduling with an availability constraint and job delivery coordination
