Modeling and solving real-time scheduling problems by stochastic integer programming.
Guido SandSebastian EngellPublished in: Comput. Chem. Eng. (2004)
Keyphrases
- integer programming
- real time
- scheduling problem
- np hard
- integer program
- set partitioning
- production planning
- set covering
- column generation
- linear programming
- constraint programming
- ai planning
- facility location
- network flow
- linear relaxation
- cutting plane algorithm
- lagrangian relaxation
- lp relaxation
- single machine
- transportation problem
- inference problems
- set covering problem
- valid inequalities
- integer programming formulations
- dantzig wolfe decomposition
- exact methods
- vehicle routing problem with time windows
- tabu search
- lower bound
- computational complexity