Abstract
Scheduling problems have been studied a lot over the last decade. Due to the complexity and the variety of such problems, most work consider static problems in which activities are known in advance and constraints are fixed. However, every schedule is subject to unexpected events (consider for example a new activity to schedule or a machine breakdown). In these cases, a new solution taking these events into account is needed in a preferably short time and as close as possible to the current solution.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Caseau, Y., Laburthe, F.: Improving clp scheduling with task intervals. In Hentenryck, P. V., ed.: Proceedings of ICLP’94, MIT Press (1994) 369–383
Caseau, Y., Laburthe, F.: Cumulative scheduling with task-intervals. In: Joint International Conference and Symposium on Logic Programming (JICSLP). (1996)
Klein, R., Scholl, A.: Computing lower bounds by destructive improvement: an application to Resource-Constrained Project Scheduling Problem. European Journal of Operational Research 112 (1999) 322–345
Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: AAAI’88, St Paul, MN (1988) 37–42
Artigues, C., Roubellat, F.: A polynomial activity insertion algorithm in a multiresource schedule with cumulative constraints and multiple modes. European Journal of Operational Research 127 (2000) 297–316
Bessière, C.: Arc consistency in dynamic constraint satisfaction problems. In: Proceedings AAAI’91. (1991)
Jussien, N.: e-constraints: explanation-based constraint programming. In: CP01 Workshop on User-Interaction in Constraint Satisfaction, Paphos, Cyprus (2001)
Debruyne, R., Ferrand, G., Jussien, N., Lesaint, W., Ouis, S., Tessier, A.: Correctness of constraint retraction algorithms. Research Report 2002-09, LIFO Orléans, France (2002) http://www.emn.fr/jussien/publications/debruyne-LIFO2002-09.ps
Jussien, N., Debruyne, R., Boizumault, P.: Maintaining arc-consistency within dynamic backtracking. In: Proceedings CP’00. LNCS 1894, Springer-Verlag (2000) 249–261
Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139 (2002) 21–45
Blazewicz, J., Lenstra, J., Rinnoy Kan, A.: Scheduling projects subject to resource constraints: classification and complexity. Discrete Applied Mathematics 5 (1983) 11–24
Brucker, P., Knust, S., Schoo, A., Thiele, A branch and bound algorithm for the Resource-Constrained Project Scheduling Problem. EJOR 107 (1998) 272–288
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elkhyari, A., Guéret, C., Jussien, N. (2002). Conflict-Based Repair Techniques for Solving Dynamic Scheduling Problems. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_49
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive