Makespan minimization for two parallel machines with unavailability constraints.
Khaoula Ben AbdellafouOuajdi KorbaaPublished in: SMC (2016)
Keyphrases
- parallel machines
- makespan minimization
- precedence constraints
- scheduling problem
- total weighted tardiness
- sequence dependent setup times
- job shop scheduling problem
- special case
- metaheuristic
- parallel computing
- release dates
- shared memory
- setup times
- flowshop
- single server
- processing times
- global constraints
- genetic algorithm
- lot sizing
- single machine
- dynamic programming
- np hard
- lower bound