-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness.
Ali AllahverdiPublished in: Comput. Oper. Res. (2004)
Keyphrases
- flowshop
- maximum tardiness
- bicriteria
- scheduling problem
- minimizing makespan
- setup times
- minimizing total tardiness
- sequence dependent setup times
- processing times
- special case
- single machine
- tabu search
- np hard
- precedence constraints
- maximum lateness
- strongly np hard
- permutation flowshop
- total flowtime
- parallel machines
- completion times
- unrelated parallel machines
- linear combination
- efficient solutions
- search algorithm