The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation.
Boris DetienneRuslan SadykovShunji TanakaPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- flowshop
- branch and bound algorithm
- scheduling problem
- job processing times
- strongly np hard
- release dates
- np hard
- single machine scheduling problem
- precedence constraints
- lower bound
- completion times
- branch and bound
- single machine
- sequence dependent setup times
- minimizing total tardiness
- setup times
- upper bound
- bicriteria
- optimal solution
- network flow formulation
- processing times
- minimizing makespan
- special case
- network flow
- flowshop scheduling
- tabu search
- maximum lateness
- parallel machines
- combinatorial optimization
- haplotype inference
- minimum cost
- search algorithm
- preventive maintenance
- lagrangian relaxation
- flowshop scheduling problems
- worst case
- computational complexity
- knapsack problem
- search strategies
- ant colony optimization
- np complete