Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Artigues, C., Roubellat, F.: A Polynomial Activity Insertion Algorithm in a Multiresource Schedule with Cumulative Constraints and Multiple Modes. Eur. J. Oper. Res. 127, 179–198 (2000)
Bessière, C.: Arc Consistency in Dynamic Constraint Satisfaction Problems. In: Proc. AAAI 1991 (1991)
Blazewicz, J., Lenstra, J.K., Rinnoy Kan, A.H.G.: Scheduling Projects Subject to Resource Constraints: Classification and Complexity. Discr. Appl. Math. 5, 11–24 (1983)
Boizumault, P., Delon, Y., Péridy, L.: Constraint Logic Programming for Examination Timetabling. J. Logic Programming: Appl. Logic Programming (Special Issue) 26, 217–233 (1996)
Brucker, P., Drexl, A., Möring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models and Methods. Eur. J. Oper. Res. 112, 3–41 (1999)
Brucker, P., Knust, S., Schoo, A., Thiele, O.: A Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem. Eur. J. Oper. Res. 107, 272–288 (1998)
Brucker, P., Knust, S.: Resource-Constrained Project Scheduling and Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 277–293. Springer, Heidelberg (2001)
Burke, E.K., Elliman, D.G., Weare, R.F.: A University Timetabling System Based on Graph Colouring and Constraint Manipulation. J. Res. Comput. in Ed. 27, 1–18 (1994)
Caseau, Y., Laburthe, F.: Cumulative Scheduling with Task-Intervals. In: JICSLP 1996: Joint Int. Conf. Symp. on Logic Programming (1996)
Caseau, Y., Laburthe, F.: Improving CLP Scheduling with Task Intervals. In: Van Hentenryck, P. (ed.) Proc. 11th Int. Conf. Logic Program (ICLP 1994), pp. 369–383. MIT Press, Cambridge (1994)
Debruyne, R., Ferrand, G., Jussien, N., Lesaint, W., Ouis, S., Tessier, A.: Correctness of Constraint Retraction Algorithms. In: FLAIRS 2003: 16th Int. Florida Artif. Intell. Res. Soc. Conf., St Augustine, FL, AAAI Press, Menlo Park (2003)
Demeulemeester, E., Herroelen, W.: A Branch and Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Management Sci. 38, 1803–1818 (1992)
Dignum, F.P.M., Nuijten, W.P.M., Janssen, L.M.A.: Solving a Time Tabling Problem by Constraint Satisfaction. Technical Report, Eindhoven University of Technology (1995)
Goltz, H.J.: Combined Automatic and Interactive Timetabling using Constraint Logic Programming. In: Proc. PATAT 2000, Konstanz, Germany (August 2000)
Guéret, C., Jussien, N., Boizumault, P., Prins, C.: Building University Timetables Using Constraint Logic Programming. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 130–145. Springer, Heidelberg (1996)
Guéret, C., Jussien, N., Prins, C.: Using Intelligent Backtracking to Improve Branch and Bound Methods: an Application to Open-Shop Problems. Eur. J. Oper. Res. 127, 344–354 (2000)
Hertz, A.: Tabu Search for Large Scale Timetabling Problems. Eur. J. Oper. Res. 54, 39–47 (1991)
Jussien, N.: E-constraints: Explanation-Based Constraint Programming. In: Workshop on User-Interaction in Constraint Satisfaction, CP 2001, Paphos, Cyprus (December 2001)
Jussien, N., Boizumault, P.: Dynamic Backtraking with Constraint Propagation – Application to Static and Dynamic CSPs. In: Workshop on The Theory and Practice of Dynamic Constraint Satisfaction, CP 1997, Schloss Hagenberg, Austria (November 1997)
Jussien, N., Debruyne, R., Boizumault, P.: Maintaining Arc-Consistency within Dynamic Backtracking. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 249–261. Springer, Heidelberg (2000)
Jussien, N., Lhomme, O.: Local Search with Constraint Propagation and Conflict- Based Heuristics. Artif. Intell. 139, 21–45 (2002)
Jussien, N., Ouis, S.: User-Friendly Explanations for Constraint Programming. In: ICLP 2001 11thWorkshop on Logic Programming Environments, WLPE 2001, Paphos, Cyprus (December 2001)
Kang, L., White, G.M.: A Logic Approach to the Resolution of Constraint in Timetabling. Eur. J. Oper. Res. 61, 306–317 (1992)
Klein, R., Scholl, A.: Computing Lower Bounds by Destructive Improvement: an Application to Resource-Constrained Project Scheduling Problem. Eur. J. Oper. Res. 112, 322–345 (1999)
Kolisch, R., Hartmann, S.: Heuristic Algorithms for Solving the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. In: Weglarz, J. (ed.) Handbook on Recent Advances in Project Scheduling, pp. 147–178. Kluwer, Dordrecht (1998)
Lajos, G.: Complete University Modular Timetabling Using Constraint Logic Programming. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol. 1153, pp. 148–161. Springer, Heidelberg (1996)
Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An Exact Algorithm for Project Scheduling with Resource Constraints Based on a New Mathematical Formulation. Management Sci. 44, 714–729 (1998)
Ross, P., Corne, D., Fang, H.-L.: Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 565–566. Springer, Heidelberg (1994)
Schiex, T., Verfaillie, G.: Nogood Recording for Static and Dynamic CSP. In: Proc. 5th IEEE Int. Conf. on Tools with Artif. Intell., pp. 48–55. IEEE, Boston (1993)
Sgall, J.: On-line scheduling – a Survey. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol. 1442, pp. 196–231. Springer, Heidelberg (1998)
Stinson, J.P., David, E.W., Khamawala, B.M.: Multiple Resource-Constrained Scheduling using Branch and Bound. IIE Trans. 1, 252–259 (1978)
Tripathy, A.: School Timetabling – a Case in Large Binary Integer Linear Programming. Management Sci. 30, 1473–1489 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elkhyari, A., Guéret, C., Jussien, N. (2003). Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools. In: Burke, E., De Causmaecker, P. (eds) Practice and Theory of Automated Timetabling IV. PATAT 2002. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45157-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-45157-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40699-0
Online ISBN: 978-3-540-45157-0
eBook Packages: Springer Book Archive