Minimizing makespan on an m-machine re-entrant flowshop.
Seong-Woo ChoiYeong-Dae KimPublished in: Comput. Oper. Res. (2008)
Keyphrases
- minimizing makespan
- flowshop
- scheduling problem
- total flowtime
- special case
- flowshop scheduling
- minimizing total tardiness
- maximum tardiness
- sequence dependent setup times
- setup times
- processing times
- bicriteria
- tabu search
- maximum lateness
- total tardiness
- single machine
- parallel machines
- flowshop scheduling problems
- strongly np hard
- permutation flowshop
- evolutionary algorithm
- np hard
- ant colony optimization
- preventive maintenance
- computational complexity
- completion times
- job shop scheduling problem