Single-machine scheduling with periodic maintenance to minimize makespan revisited
From MaRDI portal
(Redirected from Publication:398924)
Recommendations
- Single-machine scheduling with periodic maintenance to minimize makespan
- Two parallel machines scheduling with periodic maintenance to minimize makespan
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- A single-machine scheduling problem with maintenance activities to minimize makespan
- Some results of scheduling with multi-phase maintenances on two identical machines
Cites work
- A 71/60 theorem for bin packing
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
- 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
- Bounds for Certain Multiprocessing Anomalies
- Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Single-machine scheduling with periodic maintenance to minimize makespan
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Tighter bounds of the First Fit algorithm for the bin-packing problem
- Two-machine flowshop scheduling with consecutive availability constraints
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(20)- Scheduling with cardinality dependent unavailability periods
- Equivalence of some different maintenance activities in single-machine scheduling
- Scheduling with periodic availability constraints to minimize makespan
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- scientific article; zbMATH DE number 7235437 (Why is no real title available?)
- Single-machine scheduling with preventive periodic maintenance and resumable jobs in a remanufacturing system
- Two-machine flow shop and open shop scheduling problems with a single maintenance window
- Single-machine scheduling with periodic maintenance to minimize makespan
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times
- Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities
- 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
- Multiple common due-dates assignment and optimal maintenance activity scheduling with linear deteriorating jobs
- Single-machine scheduling with fixed periodic preventive maintenance to minimise the total weighted completion times
- Two parallel machines scheduling with periodic maintenance to minimize makespan
- Some results of scheduling with multi-phase maintenances on two identical machines
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times
- The LPT heuristic for minimizing total load on a proportionate openshop
- Heuristic methods for the single-machine scheduling problem with periodical resource constraints
- Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
This page was built for publication: Single-machine scheduling with periodic maintenance to minimize makespan revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398924)
