Since version 2.0, IBM ILOG CP Optimizer provides a new scheduling language supported by a robust and efficient automatic search. This paper illustrates both the expressivity of the modelling language and the robustness of the automatic search on three problems recently studied in the scheduling literature. We show that all three problems can easily be modelled with CP Optimizer in only a few dozen lines (the complete models are provided) and that on average the automatic search outperforms existing problem specific approaches. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Laborie, P. (2009). IBM ILOG CP Optimizer for detailed scheduling illustrated on three problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5547 LNCS, pp. 148–162). https://doi.org/10.1007/978-3-642-01929-6_12
Mendeley helps you to discover research relevant for your work.