IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems

Authors:
Philippe Laborie
Affiliations:
ILOG an IBM company, Gentilly Cedex, France 94253
Venue:
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2009

Citing 1
Cited 4

Understanding performance tradeoffs in algorithms for solving oversubscribed scheduling

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2

Parallel machine scheduling with precedence constraints and setup times

Computers and Operations Research
A constraint-based approach to scheduling an individual's activities

ACM Transactions on Intelligent Systems and Technology (TIST)
Optimal methods for resource allocation and scheduling: a cross-disciplinary survey

Constraints
MAK₠: a system for modelling, optimising, and analyzing production in small and medium enterprises

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.