Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage.
Jaehwan YangPublished in: Comput. Oper. Res. (2015)
Keyphrases
- flowshop
- processing times
- scheduling problem
- single machine
- special case
- setup times
- flowshop scheduling
- asymptotic optimality
- sequence dependent setup times
- tabu search
- total weighted tardiness
- parallel machines
- minimizing makespan
- np hard
- maximum lateness
- open shop
- unrelated parallel machines
- flowshop scheduling problems
- job shop scheduling
- job shop
- precedence constraints
- strongly np hard
- job shop scheduling problem
- permutation flowshop
- manufacturing cell
- ant colony optimization
- metaheuristic
- buffer allocation
- lot streaming