Scheduling two parallel machines with machine-dependent availabilities
From MaRDI portal
Publication:342363
DOI10.1016/j.cor.2016.01.021zbMath1349.90352OpenAlexW2263946527MaRDI QIDQ342363
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.021
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- Scheduling jobs under increasing linear machine maintenance time
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Single-machine scheduling with periodic maintenance to minimize makespan
- Scheduling with tool changes to minimize total completion time under controllable machining conditions
- 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
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies
- 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
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
- Scheduling
This page was built for publication: Scheduling two parallel machines with machine-dependent availabilities