Temporal linear relaxation in IBM ILOG CP Optimizer
| Autor: | Philippe Laborie, Jérôme Rogerie |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Mathematical optimization
021103 operations research Supply chain management Linear programming Modeling language Computer science 0211 other engineering and technologies General Engineering 02 engineering and technology Management Science and Operations Research Scheduling (computing) Artificial Intelligence 0202 electrical engineering electronic engineering information engineering Constraint programming 020201 artificial intelligence & image processing IBM Software Constraint satisfaction problem |
| Zdroj: | Journal of Scheduling. 19:391-400 |
| ISSN: | 1099-1425 1094-6136 |
| DOI: | 10.1007/s10951-014-0408-7 |
| Popis: | IBM ILOG CP Optimizer is a constraint solver that implements a model-and-run paradigm. For scheduling problems, CP Optimizer provides a relatively simple but very expressive modeling language based on the notion of interval variables. This paper presents the temporal linear relaxation (TLR) used to guide the automatic search when solving scheduling problems that involve temporal and resource allocation costs. We give the rationale of the TLR, describe its integration in the automatic search of CP Optimizer, and present the relaxation of most of the constraints and expressions of the model. An experimental study on a set of classical scheduling benchmarks shows that using the TLR is essential for problems with irregular temporal costs and generally helps for problems with resource allocation costs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink