Makespan minimization for two parallel machines with an availability constraint.
Ching-Jong LiaoDer-Lin ShyurChien-Hung LinPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- parallel machines
- makespan minimization
- scheduling problem
- total weighted tardiness
- sequence dependent setup times
- precedence constraints
- parallel computing
- release dates
- setup times
- flowshop
- lot sizing
- special case
- shared memory
- processing times
- single machine scheduling problem
- global constraints
- single machine
- single server
- polynomially solvable