Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
From MaRDI portal
Publication:1789450
DOI10.1016/j.apm.2013.03.001zbMath1426.90145OpenAlexW2043070684MaRDI QIDQ1789450
Publication date: 10 October 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2013.03.001
Related Items (7)
Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints ⋮ Scheduling two parallel machines with machine-dependent availabilities ⋮ Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness ⋮ Two parallel-machine scheduling problems with function constraint ⋮ Short‐term crude oil scheduling with preventive maintenance operations: a fuzzy stochastic programming approach ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval ⋮ Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance
Cites Work
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Scheduling jobs under increasing linear machine maintenance time
- Stochastic optimization for the calculation of the time dependency of the physiological demand during exercise and recovery
- Single-machine scheduling with periodic maintenance to minimize makespan
- A note on worst-case performance of heuristics for maintenance scheduling problems
- Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan
- Scheduling the maintenance on a single machine
- Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
- Single-machine scheduling with flexible and periodic maintenance
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
This page was built for publication: Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
