{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:39:53Z","timestamp":1743107993889,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540218364"},{"type":"electronic","value":"9783540246640"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24664-0_22","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T14:59:59Z","timestamp":1287845999000},"page":"319-334","source":"Crossref","is-referenced-by-count":12,"title":["Scheduling Abstractions for Local Search"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Van Hentenryck","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Michel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Iterative flattening: A scalable method for solving multi-capacity scheduling problems. In: AAAI\/IAAI, pp. 742\u2013747 (2000)"},{"key":"22_CR2","volume-title":"Optimization Software Class Libraries, chapter Writing Local Search Algorithms Using Easy Local++","author":"L. Di Gaspero","year":"2002","unstructured":"Di Gaspero, L., Schaerf, A.: Optimization Software Class Libraries, chapter Writing Local Search Algorithms Using Easy Local++. Kluwer, Dordrecht (2002)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<125::AID-JOS40>3.0.CO;2-C","volume":"3","author":"W. Kreipl","year":"2000","unstructured":"Kreipl, W.: A large step random walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling\u00a03, 125\u2013138 (2000)","journal-title":"Journal of Scheduling"},{"issue":"2","key":"22_CR4","first-page":"151","volume":"143","author":"P. Laborie","year":"2003","unstructured":"Laborie, P.: Algorithms for propagating resource constraints in ai planning and scheduling: Existing approaches and new results. AIJ\u00a0143(2), 151\u2013188 (2003)","journal-title":"AIJ"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49481-2_23","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"F. Laburthe","year":"1998","unstructured":"Laburthe, F., Caseau, Y.: SALSA: A Language for Search Algorithms. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, Springer, Heidelberg (1998)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico, M.: andM. Trubian. Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research\u00a041, 231\u2013252 (1993)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M. Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., Gambardella, L.: Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling\u00a03(1), 3\u201320 (2000)","journal-title":"Journal of Scheduling"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1009818401322","volume":"5","author":"L. Michel","year":"2000","unstructured":"Michel, L., Van Hentenryck, P.: Localizer. Constraints\u00a05, 41\u201382 (2000)","journal-title":"Constraints"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: OOPSLA 2000, Seattle, WA (2002)","DOI":"10.1145\/582419.582430"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45193-8_37","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"L. Michel","year":"2003","unstructured":"Michel, L., Van Hentenryck, P.: Maintaining longest path incrementally. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, Springer, Heidelberg (2003)"},{"key":"22_CR11","unstructured":"Michel, L., Van Hentenryck, P.: Iterative relaxations for iterative flattening in cumulative scheduling. In: ICAPS 2004, Whistler, BC, Canada (2004)"},{"issue":"6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Management Science\u00a042(6), 797\u2013813 (1996)","journal-title":"Management Science"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1009687210594","volume":"3","author":"W. Nuijten","year":"1998","unstructured":"Nuijten, W., Le Pape, C.: Constraint-based job shop scheduling with ilog scheduler. Journal of Heuristics\u00a03, 271\u2013286 (1998)","journal-title":"Journal of Heuristics"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","volume":"90","author":"W.P.M. Nuijten","year":"1996","unstructured":"Nuijten, W.P.M., Aarts, E.H.L.: A computational study of constraint satisfaction for multiple capacitated job shop scheduling. EJOR\u00a090(2), 269\u2013284 (1996)","journal-title":"EJOR"},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1021188818613","volume":"115","author":"P. Shaw","year":"2002","unstructured":"Shaw, P., De Backer, B., Furnon, V.: Improved local search for CP toolkits. Annals of Operations Research\u00a0115, 31\u201350 (2002)","journal-title":"Annals of Operations Research"},{"key":"22_CR16","first-page":"109","volume":"30","author":"M. Singer","year":"1997","unstructured":"Singer, M., Pinedo, M.: A computational study of branch and bound techniques for minimizing the totalweighted tardiness in job shops. IIE Scheduling and Logistics\u00a030, 109\u2013118 (1997)","journal-title":"IIE Scheduling and Logistics"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#","volume":"46","author":"M. Singer","year":"1999","unstructured":"Singer, M., Pinedo, M.: A shifting bottleneck heuristic for minimizing the totalweighted tardiness in job shops. Naval Research Logistics\u00a046(1), 1\u201317 (1999)","journal-title":"Naval Research Logistics"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45193-8_5","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"P. Van Hentenryck","year":"2003","unstructured":"Van Hentenryck, P., Michel, L.: Control abstractions for local search. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, Springer, Heidelberg (2003) (Best Paper Award)"},{"key":"22_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/b101931","volume-title":"Optimization Software Class Libraries","author":"S. Voss","year":"2002","unstructured":"Voss, S., Woodruff, D.: Optimization Software Class Libraries. Kluwer, Dordrecht (2002)"},{"key":"22_CR20","volume-title":"Integer Optimization by Local Search","author":"J. Walser","year":"1998","unstructured":"Walser, J.: Integer Optimization by Local Search. Springer, Heidelberg (1998)"},{"key":"22_CR21","unstructured":"Werner, F., Winkler, A.: Insertion Techniques for the Heuristic Solution of the Job Shop Problem. TR, Technical Universitaet Magdebourg (1992)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24664-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T00:24:00Z","timestamp":1676075040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24664-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540218364","9783540246640"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24664-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}