Open AccessProceedings Article
Reasoning with Conditional Time-intervals
Philippe Laborie
- 01 Jan 2008
pp 555-560
TL;DR: This paper takes a different perspective by introducing a new type of variable (namely a time-interval variable) that intrinsically embeds the notion of conditionality in the modelling process while ensuring a strong constraint propagation and an efficient search in the engine.
read more
Abstract: Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications In Constraint-Based Scheduling, those problems are usually handled by defining new global constraints over classical integer variables The approach described in this paper takes a different perspective by introducing a new type of variable (namely a time-interval variable) that intrinsically embeds the notion of conditionality This dual perspective facilitates the modelling process while ensuring a strong constraint propagation and an efficient search in the engine The approach forms the foundations of the new generation of scheduling model and algorithms provided in ILOG CP Optimizer
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
IBM ILOG CP optimizer for scheduling
TL;DR: A detailed overview of CP Optimizer for scheduling is given: typical applications, modeling concepts, examples, automatic search, tools and performance.
278
IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
Philippe Laborie
- 17 May 2009
TL;DR: It is shown that all three problems recently studied in the scheduling literature can easily be modelled with CP Optimizer in only a few dozen lines and that on average the automatic search outperforms existing problem specific approaches.
Failure-Directed Search for Constraint-Based Scheduling
Petr Vilím,Philippe Laborie,Paul Shaw +2 more
- 18 May 2015
TL;DR: This paper presents a new constraint programming search algorithm that is designed for a broad class of scheduling problems and forms the basis of the automatic search for scheduling problems in CP Optimizer, part of IBM ILOG CPLEX Optimization Studio.
78
Flexible job shop scheduling problem with parallel batch processing machines
Andy Ham,Eray Cakici +1 more
TL;DR: A flexible job-shop scheduling problem (FJSP) with parallel batch processing machine (PBM) with mixed integer programming (MIP) formulation is studied and a relaxed model to selectively include jobs into the model is proposed.
75
•Proceedings Article
Reasoning with Conditional Time-Intervals. Part II: An Algebraical Model for Resources
Philippe Laborie,Jérôme Rogerie,Paul Shaw,Petr Vilím +3 more
- 17 Mar 2009
TL;DR: This paper formally describes the new modeling language features available to the users of CP Optimizer for resource-based scheduling, and shows that the new language is flexible enough to model problems never before addressed by CP scheduling engines, as well as naturally describing classical scheduling problems found in the literature.
73
References
Shortest paths algorithms: theory and experimental evaluation
Boris V. Cherkassky,Andrew V. Goldberg,Tomasz Radzik +2 more
- 23 Jan 1994
TL;DR: An extensive computational study of shortest paths algorithms, including some very recent algorithms, is conducted, based on several natural problem classes which identify strengths and weaknesses of various algorithms.
914
Shortest paths algorithms: theory and experimental evaluation
TL;DR: In this article, the authors conduct an extensive computational study of shortest path algorithms, including some very recent algorithms, and suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the test data.
750
•Proceedings Article
Branching and pruning: an optimal temporal POCL planner based on constraint programming
Vincent Vidal,Hector Geffner +1 more
- 25 Jul 2004
TL;DR: A domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a POCL branching scheme with powerful and sound pruning rules and is competitive with the best parallel planners in the special case in which actions have all the same duration.
207
Gaining efficiency and flexibility in the simple temporal problem
Amedeo Cesta,Angelo Oddi +1 more
- 19 May 1996
TL;DR: A basic algorithm for incremental propagation of a new time constraint is presented which is a modification of the Bellman-Ford algorithm for the single-source shortest-path problem.
102
•Proceedings Article
Scheduling alternative activities
J. Christopher Beck,Mark S. Fox +1 more
- 18 Jul 1999
TL;DR: Experimental results show that an algorithm using a novel texture-based heuristic commitment technique together with extended edge-finding propagators achieves the best overall performance of the techniques tested.