Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools

Timetabling problems have been much studied over the last decade. Due to the complexity and the variety of such problems, most work concerns static problems in which activities to schedule and resources are known in advance, and constraints are fixed. However, every timetabling problem is subject to unexpected events (for example, for university timetabling problems, a missing teacher, or a slide projector breakdown). In such a situation, one has to quickly build a new solution which takes these events into account and which is preferably not too different from the current one. We introduce in this paper constraint-programming-based tools for solving dynamic timetabling problems modelled as Resource-Constrained Project Scheduling Problems. This approach uses explanation-based constraint programming and operational research techniques.

[1]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[2]  Jirí Sgall,et al.  On-line Scheduling , 1996, Online Algorithms.

[3]  Gyuri Lajos.  Complete University Modular Timetabling Using Constraint Logic Programming , 1995, PATAT.

[4]  A. Hertz.  Tabu search for large scale timetabling problems , 1991 .

[5]  Narendra Jussien,et al.  Local search with constraint propagation and conflict-based heuristics , 2000, Artif. Intell..

[6]  Jiri Sgall,et al.  On-line scheduling --- a survey , 1997 .

[7]  Narendra Jussien,et al.  Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems , 1998, Eur. J. Oper. Res..

[8]  Peter Brucker,et al.  A branch and bound algorithm for the resource-constrained project scheduling problem , 1998, Eur. J. Oper. Res..

[9]  Narendra Jussien,et al.  User-friendly explanations for constraint programming , 2001, WLPE.

[10]  V. Maniezzo,et al.  An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation , 1998 .

[11]  Christian Artigues,et al.  A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes , 2000, Eur. J. Oper. Res..

[12]  Edmund K. Burke,et al.  A University Timetabling System Based on Graph Colouring and Constraint Manipulation , 1994 .

[13]  R. Kolisch,et al.  Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .

[14]  Peter Brucker,et al.  Resource-Constrained Project Scheduling and Timetabling , 2000, PATAT.

[15]  Gérard Ferrand,et al.  Correctness of Constraint Retraction Algorithms , 2003, FLAIRS.

[16]  Peter Ross,et al.  Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation , 1994, PPSN.

[17]  Armin Scholl,et al.  Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling , 1999, Eur. J. Oper. Res..

[18]  George M. White,et al.  A logic approach to the resolution of constraints in timetabling , 1992 .

[19]  Patrice Boizumault,et al.  Building University Timetables Using Constraint Logic Programming , 1995, PATAT.

[20]  Patrice Boizumault,et al.  Maintaining Arc-Consistency within Dynamic Backtracking , 2000, CP.

[21]  Christian Bessiere,et al.  Arc-Consistency in Dynamic Constraint Satisfaction Problems , 1991, AAAI.

[22]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[23]  Laurent Péridy,et al.  Constraint Logic Programming for Examination Timetabling , 1996, J. Log. Program..

[24]  François Laburthe,et al.  Cumulative Scheduling with Task Intervals , 1996, JICSLP.

[25]  A. Tripathy.  School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[26]  E. W. Davis,et al.  Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .

[27]  Frank Dignum,et al.  Solving a time tabling problem by constraint satisfaction , 1995 .