Makespan minimization for parallel machines scheduling with multiple availability constraints.
Navid HashemianClaver DialloBéla VizváriPublished in: Ann. Oper. Res. (2014)
Keyphrases
- parallel machines
- makespan minimization
- scheduling problem
- precedence constraints
- unrelated parallel machines
- minimize total
- release dates
- sequence dependent setup times
- total weighted tardiness
- shared memory
- parallel computing
- flowshop
- setup times
- single machine
- special case
- single server
- processing times
- np hard
- lot sizing
- constraint programming
- worst case