A Hybrid MIP-CP Algorithm for a Linked Planning and Scheduling Problem from Chemical Industry.
Christian TimpePublished in: Tech. Sci. Informatiques (2003)
Keyphrases
- np hard
- scheduling problem
- computational complexity
- optimal solution
- dynamic programming
- high accuracy
- detection algorithm
- experimental evaluation
- expectation maximization
- optimization algorithm
- matching algorithm
- computational cost
- significant improvement
- search space
- simulated annealing
- linear programming
- preprocessing
- path planning
- cost function
- ant colony optimization
- planning problems
- recognition algorithm