Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints.
Clifford BeatonClaver DialloEldon A. GunnPublished in: INFOR Inf. Syst. Oper. Res. (2016)
Keyphrases
- preventive maintenance
- makespan minimization
- flowshop
- single machine
- processing times
- scheduling problem
- setup times
- total weighted tardiness
- precedence constraints
- sequence dependent setup times
- release dates
- parallel machines
- special case
- polynomially solvable
- tabu search
- job processing times
- single machine scheduling problem
- dynamic programming
- job shop scheduling problem
- job shop
- response time
- np hard