Citation
Temporal Linear Relaxation in IBM ILOG CP Optimizer. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 379-391, 2013.
Paper
Abstract
IBM ILOG CP Optimizer is a constraint solver that implements a modeland-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.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2013-379-391-P, author = {P. Laborie and J. Rogerie},
title = {Temporal Linear Relaxation in IBM ILOG CP Optimizer},
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {379--391},
note = {Paper},
abstract = { IBM ILOG CP Optimizer is a constraint solver that implements a modeland-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.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-379-391-P.pdf} }