The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm.
Can AkkanSelçuk KarabatiPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- branch and bound algorithm
- flowshop
- lower bound
- strongly np hard
- scheduling problem
- np hard
- upper bound
- job processing times
- branch and bound
- lower bounding
- sequence dependent setup times
- single machine scheduling problem
- minimizing total tardiness
- minimizing makespan
- precedence constraints
- processing times
- release dates
- special case
- flowshop scheduling
- bicriteria
- optimal solution
- setup times
- completion times
- maximum lateness
- randomly generated problems
- objective function
- tabu search
- lagrangian relaxation
- upper bounding
- single machine
- parallel machines
- worst case
- max sat
- combinatorial optimization
- cutting plane
- approximation algorithms
- preventive maintenance
- linear programming
- flowshop scheduling problems
- cost function
- search algorithm
- neural network