Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities
From MaRDI portal
Publication:6534463
Recommendations
- A single-machine scheduling problem with maintenance activities to minimize makespan
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Single-machine scheduling with flexible and periodic maintenance
- Single-machine scheduling with fixed periodic preventive maintenance to minimise the total weighted completion times
Cites work
- A simple proof of the inequality \(MFFD(L)\leq {71\over 60}\text{OPT}(L)+1,L\) for the \(MFFD\) bin-packing algorithm
- A single machine scheduling problem with availability constraints and sequence-dependent setup costs
- A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- An improved heuristic for two-machine flowshop scheduling with an availability constraint
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- Improved algorithms for two single machine scheduling problems
- Machine scheduling with an availability constraint
- Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Multi-machine scheduling with deteriorating jobs and scheduled maintenance
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimization problems of replacement first or last in reliability theory
- Over-time and over-level replacement policies with random working cycles
- Planning Machine Maintenance in Two-Machine Shop Scheduling
- Scheduling a maintenance activity to minimize total weighted completion-time
- Scheduling jobs under increasing linear machine maintenance time
- Scheduling linear deteriorating jobs with an availability constraint on a single machine
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Scheduling the maintenance on a single machine
- Single-machine scheduling with flexible and periodic maintenance
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Single-machine scheduling with periodic maintenance to minimize makespan
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- Some efficient heuristic methods for the flow shop sequencing problem
- Time-dependent scheduling
- Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities
- Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time
Cited in
(3)
This page was built for publication: Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6534463)
