{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:56:07Z","timestamp":1725573367258},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540307051"},{"type":"electronic","value":"9783540324218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593577_8","type":"book-chapter","created":{"date-parts":[[2005,11,5]],"date-time":"2005-11-05T07:32:45Z","timestamp":1131175965000},"page":"126-146","source":"Crossref","is-referenced-by-count":22,"title":["Minimal Perturbation Problem in Course Timetabling"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"M\u00fcller","sequence":"first","affiliation":[]},{"given":"Hana","family":"Rudov\u00e1","sequence":"additional","affiliation":[]},{"given":"Roman","family":"Bart\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-24662-6_13","volume-title":"Recent Advances in Constraints","author":"R. Bart\u00e1k","year":"2004","unstructured":"Bart\u00e1k, R., M\u00fcller, T., Rudov\u00e1, H.: A New Approach to Modeling and Solving Minimal Perturbation Problems. In: Apt, K.R., Fages, F., Rossi, F., Szeredi, P., V\u00e1ncza, J. (eds.) CSCLP 2003. LNCS (LNAI), vol.\u00a03010, pp. 233\u2013249. Springer, Heidelberg (2004)"},{"key":"8_CR2","first-page":"388","volume-title":"Applied Computing","author":"R. Bart\u00e1k","year":"2005","unstructured":"Bart\u00e1k, R., Rudov\u00e1, H.: Limited Assignments: A New Cutoff Strategy for Incomplete Depth-First Search. In: Applied Computing, pp. 388\u2013392. ACM, New York (2005)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11593577_12","volume-title":"Practice and Theory of Automated Timetabling V","author":"H. Cambazard","year":"2005","unstructured":"Cambazard, H., Demazeau, F., Jussien, N., David, P.: Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 107\u2013124. Springer, Heidelberg (2005)"},{"key":"8_CR4","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Mateo (2003)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Dechter, R., Frost, D.: Backjump-Based Backtracking for Constraint Satisfaction Problems. Artif. Intell. 136, 147\u2013188 (2002)","DOI":"10.1016\/S0004-3702(02)00120-0"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-45157-0_3","volume-title":"Practice and Theory of Automated Timetabling IV","author":"A. Elkhyari","year":"2003","unstructured":"Elkhyari, A., Gu\u00e9ret, C., Jussien, N.: Solving Dynamic Timetabling Problems as Dynamic Resource Constrained Project Scheduling Problems Using New Constraint Programming Tools. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 39\u201359. Springer, Heidelberg (2003)"},{"key":"8_CR7","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":"8_CR8","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":"8_CR9","unstructured":"Kocjan, W.: Dynamic Scheduling: State of the Art Report. Technical Report T2002:28. SICS (2002)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Berlin (2000)","DOI":"10.1007\/978-3-662-04131-4"},{"key":"8_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-85729-378-7","volume-title":"Dynamic Flexible Constraint Satisfaction and its Application to AI Planning","author":"I. Miguel","year":"2004","unstructured":"Miguel, I.: Dynamic Flexible Constraint Satisfaction and its Application to AI Planning. Springer, Berlin (2004)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/978-3-642-18164-1","volume-title":"Practice and Theory of Automated Timetabling IV","author":"T. M\u00fcller","year":"2003","unstructured":"M\u00fcller, T., Bart\u00e1k, R.: Interactive Timetabling: Concepts, Techniques, and Practical Results. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 58\u201372. Springer, Heidelberg (2003)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/11593577_3","volume-title":"Practice and Theory of Automated Timetabling V","author":"S. Piechowiak","year":"2005","unstructured":"Piechowiak, S., Ma, J., Mandiau, R.: EDT-2004: An Open Interactive Timetabling Tool. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 34\u201350. Springer, Heidelberg (2005)"},{"key":"8_CR14","unstructured":"Ran, Y., Roos, N., van den Herik, J.: Approaches to Find a Near-Minimal Change Solution for Dynamic CSPs. In: Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems, pp. 373\u2013387 (2002)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-45157-0_21","volume-title":"Practice and Theory of Automated Timetabling IV","author":"H. Rudov\u00e1","year":"2003","unstructured":"Rudov\u00e1, H., Murray, K.: University Course Timetabling with Soft Constraints. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 310\u2013328. Springer, Heidelberg (2003)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"4","author":"H. Sakkout El","year":"2000","unstructured":"El Sakkout, H., Wallace, M.: Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling. Constraints\u00a04, 359\u2013388 (2000)","journal-title":"Constraints"},{"key":"8_CR17","unstructured":"Verfaillie, G., Jussien, N.: Dynamic Constraint Solving. A tutorial including commented bibliography presented at CP 2003 (2003), See http:\/\/www.emn.fr\/x-info\/jussien\/CP03tutorial\/"},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10601-005-2239-9","volume":"10","author":"G. Verfaillie","year":"2005","unstructured":"Verfaillie, G., Jussien, N.: Constraint Solving in Uncertain and Dynamic Environments: A Survey. Constraints 10, 253\u2013281 (2005)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593577_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:50Z","timestamp":1605643370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593577_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540307051","9783540324218"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11593577_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}