A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines.
Chun-Lung ChenChuen-Lung ChenPublished in: Comput. Oper. Res. (2009)
Keyphrases
- unrelated parallel machines
- minimizing makespan
- scheduling problem
- parallel machines
- flowshop
- setup times
- single machine
- tabu search
- job shop scheduling
- processing times
- np hard
- precedence constraints
- job shop scheduling problem
- sequence dependent setup times
- scheduling jobs
- bicriteria
- parallel computing
- evolutionary algorithm
- dynamic programming
- open shop
- single server
- lower bound
- shared memory