A comprehensive review of Branch-and-Bound algorithms: Guidelines and directions for further research on the flowshop scheduling problem.
Caio Paziani TomazellaMarcelo Seido NaganoPublished in: Expert Syst. Appl. (2020)
Keyphrases
- scheduling problem
- branch and bound algorithm
- flowshop
- np hard
- strongly np hard
- branch and bound
- lower bound
- setup times
- single machine
- flowshop scheduling
- minimizing total tardiness
- precedence constraints
- minimizing makespan
- processing times
- optimal solution
- upper bound
- sequence dependent setup times
- bicriteria
- combinatorial optimization
- permutation flowshop
- special case
- total tardiness
- single machine scheduling problem
- makespan minimization
- parallel machines
- maximum lateness
- np complete
- lagrangian relaxation
- tabu search
- job shop scheduling problem
- boolean satisfiability
- flowshop scheduling problems
- preventive maintenance
- approximation algorithms
- worst case
- total flowtime
- release dates
- objective function
- computational complexity
- total weighted tardiness
- completion times