Single-machine scheduling with periodic maintenance to minimize makespan revisited
From MaRDI portal
Publication:398924
DOI10.1007/s10951-013-0350-0zbMath1297.68045OpenAlexW2019692413MaRDI QIDQ398924
George Steiner, Yu-Lin Zhang, Xian-Yu Yu
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0350-0
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs ⋮ Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance ⋮ A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines ⋮ Equivalence of some different maintenance activities in single-machine scheduling ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ Heuristic methods for the single-machine scheduling problem with periodical resource constraints ⋮ Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times ⋮ Two-machine flow shop and open shop scheduling problems with a single maintenance window
Cites Work
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Single-machine scheduling with periodic maintenance to minimize makespan
- Scheduling deteriorating jobs subject to job or machine availability constraints
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- A 71/60 theorem for bin packing
- A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- Two-machine flowshop scheduling with consecutive availability constraints
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Bounds for Certain Multiprocessing Anomalies
This page was built for publication: Single-machine scheduling with periodic maintenance to minimize makespan revisited
