ArticlesAn example of integrating constraint programming and mathematical programming
References (0)
Cited by (8)
A decomposition framework for the scheduling of single- and multi-stage processes
2006, Computers and Chemical EngineeringA hybrid MILP/CLP algorithm for multipurpose batch process scheduling
2005, Computers and Chemical EngineeringCitation Excerpt :Trentesaux, Pesin, and Tahon (2001) compared CLP techniques using the CHIP system to alternative AI methods and concluded that, while CLP can be used to solve job-shop scheduling problems it is best used to generate feasible solutions within an area of the search space defined by another, more general method. Heipcke (1999) compared CLP and MILP methods of solving several standard problems, including the change problem and production process scheduling. This work shows that the ability of CLP to handle disjunctive constraints makes it a good choice for scheduling problems, but finding a provably optimal solution is more difficult than in MILP.
Part II. Future perspective on optimization
2004, Computers and Chemical EngineeringDecomposition techniques for hybrid MILP/CP models applied to scheduling and routing problems
2011, Springer Optimization and Its ApplicationsConstraint programming based robust sensor network design
2007, Industrial and Engineering Chemistry ResearchAdvances in Logic-Based Optimization Approaches to Process Integration and Supply Chain Management
2005, Chemical Engineering: Trends and Developments
Copyright © 2000 Published by Elsevier B.V.