Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times.
Ali AllahverdiPublished in: Comput. Oper. Res. (2000)
Keyphrases
- flowshop
- setup times
- scheduling problem
- flowshop scheduling
- completion times
- sequence dependent setup times
- processing times
- special case
- minimizing makespan
- total tardiness
- bicriteria
- strongly np hard
- tabu search
- manufacturing cell
- single machine
- makespan minimization
- parallel machines
- unrelated parallel machines
- precedence constraints
- np hard
- permutation flowshop
- ant colony optimization
- multistage
- metaheuristic
- computational complexity