The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies.
Anis GharbiTalel LadhariMohamed Kais MsakniMehdi SerairiPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- flowshop
- setup times
- scheduling problem
- lower bounding
- strongly np hard
- branch and bound algorithm
- tabu search
- lower bound
- sequence dependent setup times
- np hard
- processing times
- minimizing total tardiness
- lower and upper bounds
- dynamic time warping
- single machine
- total tardiness
- bicriteria
- special case
- minimizing makespan
- mathematical programming
- makespan minimization
- parallel machines
- unrelated parallel machines
- precedence constraints
- maximum lateness
- upper bound
- permutation flowshop
- total weighted tardiness
- job shop scheduling problem
- completion times
- lagrangian relaxation
- search algorithm
- neural network
- job processing times
- optimal solution