Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks.
Kuo-Ching YingShih-Wei LinPublished in: Expert Syst. Appl. (2018)
Keyphrases
- minimizing makespan
- scheduling problem
- flowshop
- total flowtime
- maximum tardiness
- single machine
- distributed systems
- np hard
- tabu search
- flowshop scheduling
- maximum lateness
- minimizing total tardiness
- permutation flowshop
- sequence dependent setup times
- bicriteria
- precedence constraints
- processing times
- preventive maintenance
- setup times
- makespan minimization
- data transfer
- message passing
- metaheuristic
- flowshop scheduling problems
- computational complexity