Two parallel machines scheduling with periodic maintenance to minimize makespan
From MaRDI portal
Publication:3072003
Recommendations
- Single-machine scheduling with periodic maintenance to minimize makespan
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Parallel machines scheduling with machine maintenance for minsum criteria
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
Cited in
(12)- Single-machine scheduling with periodic maintenance to minimize makespan
- Single-machine scheduling with periodic maintenance to minimize makespan revisited
- Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
- Unknown Input Observers Designed by Eigenstructure Assignment
- Scheduling two machines that require multiple types of maintenance, for a single operation
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Parallel machines scheduling with machine maintenance for minsum criteria
- Scheduling jobs and maintenance activities on parallel machines
- Some results of scheduling with multi-phase maintenances on two identical machines
This page was built for publication: Two parallel machines scheduling with periodic maintenance to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3072003)
