A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand.
Mieke DefraeyeInneke Van NieuwenhuysePublished in: Comput. Oper. Res. (2016)
Keyphrases
- non stationary
- branch and bound algorithm
- precedence constraints
- lower bound
- branch and bound
- fractional brownian motion
- release dates
- single machine scheduling problem
- np hard
- optimal solution
- upper bound
- lower bounding
- scheduling problem
- combinatorial optimization
- mixed integer linear programming
- sequence dependent setup times
- lagrangian relaxation
- adaptive algorithms
- maximum lateness
- random fields
- randomly generated problems
- upper bounding
- approximation algorithms
- finding an optimal solution
- objective function
- search space
- neural network
- inventory management
- resource consumption
- parallel machines
- linear program