A branch and bound algorithm for one supplier and multiple heterogeneous customers to solve a coordinated scheduling problem.
Zakaria HammoudanOlivier GrunderToufik BoudouhAbdellah El MoudniPublished in: CoDIT (2014)
Keyphrases
- branch and bound algorithm
- scheduling problem
- np hard
- precedence constraints
- strongly np hard
- mixed integer linear programming
- lower bound
- branch and bound
- finding an optimal solution
- optimal solution
- single machine scheduling problem
- upper bound
- combinatorial optimization
- single machine
- release dates
- dominance rules
- lower bounding
- supply chain
- flowshop
- lagrangian relaxation
- integer variables
- processing times
- upper bounding
- randomly generated problems
- weighted max sat
- approximation algorithms
- setup times
- sequence dependent setup times
- metaheuristic
- branch and bound method
- genetic algorithm
- maximum lateness
- search algorithm
- computational complexity
- search space
- multi objective
- tabu search