IBM ILOG CP optimizer for scheduling
| Autor: | Paul Shaw, Philippe Laborie, Petr Vilím, Jérôme Rogerie |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
0209 industrial biotechnology
Theoretical computer science Computer science 02 engineering and technology Scheduling (computing) 020901 industrial engineering & automation Computational Theory and Mathematics Artificial Intelligence 0202 electrical engineering electronic engineering information engineering Constraint programming Discrete Mathematics and Combinatorics Combinatorial optimization 020201 artificial intelligence & image processing IBM Algebraic number Software |
| Zdroj: | Constraints. 23:210-250 |
| ISSN: | 1572-9354 1383-7133 |
| DOI: | 10.1007/s10601-018-9281-x |
| Popis: | IBM ILOG CP Optimizer is a generic CP-based system to model and solve scheduling problems. It provides an algebraic language with simple mathematical concepts to capture the temporal dimension of scheduling problems in a combinatorial optimization framework. CP Optimizer implements a model-and-run paradigm that vastly reduces the burden on the user to understand CP or scheduling algorithms: modeling is by far the most important. The automatic search provides good performance out of the box and it is continuously improving. This article gives a detailed overview of CP Optimizer for scheduling: typical applications, modeling concepts, examples, automatic search, tools and performance. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink