Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times.
Talel LadhariMohamed Kais MsakniAli AllahverdiPublished in: J. Oper. Res. Soc. (2012)
Keyphrases
- flowshop
- setup times
- completion times
- scheduling problem
- processing times
- sequence dependent setup times
- job processing times
- bicriteria
- special case
- single machine
- tabu search
- unrelated parallel machines
- minimizing makespan
- total tardiness
- manufacturing cell
- makespan minimization
- strongly np hard
- parallel machines
- precedence constraints
- np hard
- resource allocation
- ant colony optimization
- metaheuristic