A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times.
Ali AllahverdiFawaz S. Al-AnziPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- flowshop
- setup times
- minimize total
- scheduling problem
- branch and bound algorithm
- single machine
- np hard
- parallel machines
- release dates
- precedence constraints
- single machine scheduling problem
- strongly np hard
- sequence dependent setup times
- processing times
- lower bound
- total tardiness
- maximum lateness
- unrelated parallel machines
- branch and bound
- tabu search
- upper bound
- optimal solution
- worst case
- combinatorial optimization
- special case
- integer programming
- job shop scheduling problem
- approximation algorithms
- linear programming
- total cost
- lagrangian relaxation
- lower and upper bounds
- single server
- constraint satisfaction problems