Minimizing makespan for two parallel machines with job limit on each availability interval.
C.-J. LiaoC.-M. ChenC.-H. LinPublished in: J. Oper. Res. Soc. (2007)
Keyphrases
- minimizing makespan
- parallel machines
- flowshop
- scheduling problem
- maximum lateness
- scheduling jobs
- release dates
- identical parallel machines
- processing times
- precedence constraints
- unrelated parallel machines
- total tardiness
- sequence dependent setup times
- minimize total
- single machine
- single machine scheduling problem
- setup times
- bicriteria
- job shop
- single server
- parallel computing
- shared memory
- completion times
- special case
- identical machines
- lot sizing
- tabu search
- strongly np hard
- parallel algorithm