{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T06:21:28Z","timestamp":1774160488488,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540406990","type":"print"},{"value":"9783540451570","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45157-0_3","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T21:38:21Z","timestamp":1294522701000},"page":"39-59","source":"Crossref","is-referenced-by-count":12,"title":["Solving Dynamic Resource Constraint Project Scheduling Problems Using New Constraint Programming Tools"],"prefix":"10.1007","author":[{"given":"Abdallah","family":"Elkhyari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christelle","family":"Gu\u00e9ret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narendra","family":"Jussien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0377-2217(99)00496-8","volume":"127","author":"C. Artigues","year":"2000","unstructured":"Artigues, C., Roubellat, F.: A Polynomial Activity Insertion Algorithm in a Multiresource Schedule with Cumulative Constraints and Multiple Modes. Eur. J. Oper. Res.\u00a0127, 179\u2013198 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR2","unstructured":"Bessi\u00e8re, C.: Arc Consistency in Dynamic Constraint Satisfaction Problems. In: Proc. AAAI 1991 (1991)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J. Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J.K., Rinnoy Kan, A.H.G.: Scheduling Projects Subject to Resource Constraints: Classification and Complexity. Discr. Appl. Math.\u00a05, 11\u201324 (1983)","journal-title":"Discr. Appl. Math."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(95)00100-X","volume":"26","author":"P. Boizumault","year":"1996","unstructured":"Boizumault, P., Delon, Y., P\u00e9ridy, L.: Constraint Logic Programming for Examination Timetabling. J. Logic Programming: Appl. Logic Programming (Special Issue)\u00a026, 217\u2013233 (1996)","journal-title":"J. Logic Programming: Appl. Logic Programming (Special Issue)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P. Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6ring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models and Methods. Eur. J. Oper. Res.\u00a0112, 3\u201341 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","volume":"107","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Knust, S., Schoo, A., Thiele, O.: A Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem. Eur. J. Oper. Res.\u00a0107, 272\u2013288 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-44629-X_17","volume-title":"Practice and Theory of Automated Timetabling III","author":"P. Brucker","year":"2001","unstructured":"Brucker, P., Knust, S.: Resource-Constrained Project Scheduling and Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 277\u2013293. Springer, Heidelberg (2001)"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/08886504.1994.10782112","volume":"27","author":"E.K. Burke","year":"1994","unstructured":"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.\u00a027, 1\u201318 (1994)","journal-title":"J. Res. Comput. in Ed."},{"key":"3_CR9","unstructured":"Caseau, Y., Laburthe, F.: Cumulative Scheduling with Task-Intervals. In: JICSLP 1996: Joint Int. Conf. Symp. on Logic Programming (1996)"},{"key":"3_CR10","first-page":"369","volume-title":"Proc. 11th Int. Conf. Logic Program (ICLP 1994)","author":"Y. Caseau","year":"1994","unstructured":"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\u2013383. MIT Press, Cambridge (1994)"},{"key":"3_CR11","volume-title":"FLAIRS 2003: 16th Int. Florida Artif. Intell. Res. Soc. Conf.","author":"R. Debruyne","year":"2003","unstructured":"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)"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E. Demeulemeester","year":"1992","unstructured":"Demeulemeester, E., Herroelen, W.: A Branch and Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Management Sci.\u00a038, 1803\u20131818 (1992)","journal-title":"Management Sci."},{"key":"3_CR13","unstructured":"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)"},{"key":"3_CR14","unstructured":"Goltz, H.J.: Combined Automatic and Interactive Timetabling using Constraint Logic Programming. In: Proc. PATAT 2000, Konstanz, Germany (August 2000)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-61794-9_56","volume-title":"Practice and Theory of Automated Timetabling","author":"C. Gu\u00e9ret","year":"1996","unstructured":"Gu\u00e9ret, 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.\u00a01153, pp. 130\u2013145. Springer, Heidelberg (1996)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/S0377-2217(99)00488-9","volume":"127","author":"C. Gu\u00e9ret","year":"2000","unstructured":"Gu\u00e9ret, C., Jussien, N., Prins, C.: Using Intelligent Backtracking to Improve Branch and Bound Methods: an Application to Open-Shop Problems. Eur. J. Oper. Res.\u00a0127, 344\u2013354 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","volume":"54","author":"A. Hertz","year":"1991","unstructured":"Hertz, A.: Tabu Search for Large Scale Timetabling Problems. Eur. J. Oper. Res.\u00a054, 39\u201347 (1991)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR18","unstructured":"Jussien, N.: E-constraints: Explanation-Based Constraint Programming. In: Workshop on User-Interaction in Constraint Satisfaction, CP 2001, Paphos, Cyprus (December 2001)"},{"key":"3_CR19","unstructured":"Jussien, N., Boizumault, P.: Dynamic Backtraking with Constraint Propagation \u2013 Application to Static and Dynamic CSPs. In: Workshop on The Theory and Practice of Dynamic Constraint Satisfaction, CP 1997, Schloss Hagenberg, Austria (November 1997)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-45349-0_19","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"N. Jussien","year":"2000","unstructured":"Jussien, N., Debruyne, R., Boizumault, P.: Maintaining Arc-Consistency within Dynamic Backtracking. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 249\u2013261. Springer, Heidelberg (2000)"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"N. Jussien","year":"2002","unstructured":"Jussien, N., Lhomme, O.: Local Search with Constraint Propagation and Conflict- Based Heuristics. Artif. Intell.\u00a0139, 21\u201345 (2002)","journal-title":"Artif. Intell."},{"key":"3_CR22","unstructured":"Jussien, N., Ouis, S.: User-Friendly Explanations for Constraint Programming. In: ICLP 2001 11thWorkshop on Logic Programming Environments, WLPE 2001, Paphos, Cyprus (December 2001)"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0377-2217(92)90360-L","volume":"61","author":"L. Kang","year":"1992","unstructured":"Kang, L., White, G.M.: A Logic Approach to the Resolution of Constraint in Timetabling. Eur. J. Oper. Res.\u00a061, 306\u2013317 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","volume":"112","author":"R. Klein","year":"1999","unstructured":"Klein, R., Scholl, A.: Computing Lower Bounds by Destructive Improvement: an Application to Resource-Constrained Project Scheduling Problem. Eur. J. Oper. Res.\u00a0112, 322\u2013345 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR25","first-page":"147","volume-title":"Handbook on Recent Advances in Project Scheduling","author":"R. Kolisch","year":"1998","unstructured":"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\u2013178. Kluwer, Dordrecht (1998)"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","first-page":"148","volume-title":"Practice and Theory of Automated Timetabling","author":"G. Lajos","year":"1996","unstructured":"Lajos, G.: Complete University Modular Timetabling Using Constraint Logic Programming. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol.\u00a01153, pp. 148\u2013161. Springer, Heidelberg (1996)"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A. Mingozzi","year":"1998","unstructured":"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.\u00a044, 714\u2013729 (1998)","journal-title":"Management Sci."},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/978-3-642-57890-8","volume-title":"Parallel Problem Solving from Nature - PPSN III","author":"P. Ross","year":"1994","unstructured":"Ross, P., Corne, D., Fang, H.-L.: Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation. In: Davidor, Y., M\u00e4nner, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol.\u00a0866, pp. 565\u2013566. Springer, Heidelberg (1994)"},{"key":"3_CR29","first-page":"48","volume-title":"Proc. 5th IEEE Int. Conf. on Tools with Artif. Intell.","author":"T. Schiex","year":"1993","unstructured":"Schiex, T., Verfaillie, G.: Nogood Recording for Static and Dynamic CSP. In: Proc. 5th IEEE Int. Conf. on Tools with Artif. Intell., pp. 48\u201355. IEEE, Boston (1993)"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online Algorithms","author":"J. Sgall","year":"1998","unstructured":"Sgall, J.: On-line scheduling \u2013 a Survey. In: Fiat, A. (ed.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01442, pp. 196\u2013231. Springer, Heidelberg (1998)"},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1080\/05695557808975212","volume":"1","author":"J.P. Stinson","year":"1978","unstructured":"Stinson, J.P., David, E.W., Khamawala, B.M.: Multiple Resource-Constrained Scheduling using Branch and Bound. IIE Trans.\u00a01, 252\u2013259 (1978)","journal-title":"IIE Trans."},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1287\/mnsc.30.12.1473","volume":"30","author":"A. Tripathy","year":"1984","unstructured":"Tripathy, A.: School Timetabling \u2013 a Case in Large Binary Integer Linear Programming. Management Sci.\u00a030, 1473\u20131489 (1984)","journal-title":"Management Sci."}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling IV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45157-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:09:13Z","timestamp":1553353753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45157-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406990","9783540451570"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45157-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}