The two- and m-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime.
Ali AllahverdiPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- flowshop
- bicriteria
- flowshop scheduling problems
- flowshop scheduling
- scheduling problem
- total flowtime
- special case
- maximum tardiness
- minimizing makespan
- processing times
- setup times
- sequence dependent setup times
- tabu search
- strongly np hard
- np hard
- single machine
- completion times
- manufacturing cell
- permutation flowshop
- ant colony optimization
- computational complexity