Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed.
Jeffrey E. SchallerJorge M. S. ValentePublished in: Comput. Oper. Res. (2019)
Keyphrases
- completion times
- branch and bound algorithm
- single machine scheduling problem
- flowshop
- scheduling problem
- strongly np hard
- lower bound
- sequence dependent setup times
- branch and bound
- np hard
- open shop
- precedence constraints
- upper bound
- unrelated parallel machines
- release dates
- search tree
- job processing times
- processing times
- special case
- set covering problem
- optimal solution
- combinatorial optimization
- lagrangian relaxation
- minimizing makespan
- setup times
- haplotype inference
- single machine
- boolean satisfiability
- finding an optimal solution
- flowshop scheduling
- asymptotic optimality
- maximum lateness
- tabu search
- parallel machines
- job shop scheduling problem
- weighted sum
- genetic algorithm
- job shop scheduling
- neural network
- linear programming
- search algorithm