Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
From MaRDI portal
Publication:941557
DOI10.1016/j.cor.2006.08.015zbMath1171.90411OpenAlexW2042109944MaRDI QIDQ941557
Dehua Xu, Kai-Biao Sun, Hong-Xing Li
Publication date: 1 September 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.08.015
Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (21)
Human resources scheduling to improve the product quality according to exhaustion limit ⋮ Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects ⋮ Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ Some scheduling problems with general position-dependent and time-dependent learning effects ⋮ Scheduling two parallel machines with machine-dependent availabilities ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures ⋮ The study of group scheduling problems with general dual-position-based job processing 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 ⋮ Scheduling jobs under increasing linear machine maintenance time ⋮ A single-machine scheduling problem with maintenance activities to minimize makespan ⋮ Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs ⋮ Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies ⋮ A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ Scheduling a maintenance activity to minimize total weighted completion-time ⋮ Production, maintenance and resource scheduling: a review ⋮ Competitive strategies for an online generalized assignment problem with a service consecution constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel machines scheduling with nonsimultaneous machine available time
- Single-machine scheduling with periodic maintenance to minimize makespan
- The effect of machine availability on the worst-case performance of LPT
- Parallel machines scheduling with machine shutdowns
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Scheduling with limited machine availability
- Machine scheduling with an availability constraint
- Scheduling on semi-identical processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
