A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization.
Walid HfaiedhCherif SadfiImed KacemAtidel Hadj-AlouanePublished in: Appl. Math. Comput. (2015)
Keyphrases
- single machine scheduling problem
- branch and bound method
- branch and bound algorithm
- branch and bound
- lower bound
- precedence constraints
- lagrangian relaxation
- optimal solution
- combinatorial optimization
- feasible solution
- upper bound
- objective function
- np hard
- mixed integer programming
- search algorithm
- processing times
- reduce the search space
- single machine
- search space
- optimal configuration
- supply chain
- optimization problems
- column generation
- cost function