Makespan minimization for two parallel machines scheduling with a periodic availability constraint.
Dehua XuZhenmin ChengYunqiang YinHongxing LiPublished in: Comput. Oper. Res. (2009)
Keyphrases
- parallel machines
- makespan minimization
- scheduling problem
- unrelated parallel machines
- minimize total
- sequence dependent setup times
- precedence constraints
- release dates
- total weighted tardiness
- parallel computing
- shared memory
- lot sizing
- single server
- setup times
- job shop scheduling problem
- tabu search
- processing times
- flowshop
- single machine