{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T01:47:19Z","timestamp":1768787239215,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,1,7]],"date-time":"2009-01-07T00:00:00Z","timestamp":1231286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s10852-008-9100-2","type":"journal-article","created":{"date-parts":[[2009,1,6]],"date-time":"2009-01-06T10:21:31Z","timestamp":1231237291000},"page":"245-270","source":"Crossref","is-referenced-by-count":19,"title":["Principles for the Design of Large Neighborhood Search"],"prefix":"10.1007","volume":"8","author":[{"given":"Tom","family":"Carchrae","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,7]]},"reference":[{"key":"9100_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manage. Sci. 34, 391\u2013401 (1988)","journal-title":"Manage. Sci."},{"key":"9100_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA J. Comput. 3, 149\u2013156 (1991)","journal-title":"ORSA J. Comput."},{"key":"9100_CR3","unstructured":"Baptiste, P., Le\u00a0Pape, C., Nuijten, W.: Constraint-based optimization and approximation for job-shop scheduling. In: Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI-95 (1995)"},{"issue":"1","key":"9100_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(99)00099-5","volume":"117","author":"J.C. Beck","year":"2000","unstructured":"Beck, J.C., Fox, M.S.: Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artif. Intell. 117(1), 31\u201381 (2000)","journal-title":"Artif. Intell."},{"key":"9100_CR5","unstructured":"Birrattari, M., Sttzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proceedings of the Genetic and Evolutionary Computation Conference. pp. 11\u201318 (2002)"},{"issue":"4","key":"9100_CR6","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1111\/j.1467-8640.2005.00278.x","volume":"21","author":"T. Carchrae","year":"2005","unstructured":"Carchrae, T., Beck, J.: Applying machine learning to low-knowledge control of optimization algorithms. Comput. Intell. 21(4), 372\u2013387 (2005)","journal-title":"Comput. Intell."},{"issue":"1","key":"9100_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1017\/S0269888901000078","volume":"16","author":"Y. Caseau","year":"2001","unstructured":"Caseau, Y., Laburthe, F., Pape, C.L., Rottembourg, B.: Combining local and global search in a constraint programming environment. Knowl. Eng. Rev. 16(1), 41\u201368 (2001)","journal-title":"Knowl. Eng. Rev."},{"key":"9100_CR8","unstructured":"Cesta, A., Oddi, A., Smith, S.: Iterative flattening: a scalable method for solving multi-capacity scheduling problems. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, pp. 742\u2013747. AAAI\/MIT, Menlo Park (2000)"},{"key":"9100_CR9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/B:ANOR.0000032577.81139.84","volume":"130","author":"A. Chabrier","year":"2004","unstructured":"Chabrier, A., Danna, E., Le\u00a0Pape, C., Perron, L.: Solving a network design problem. Ann. Oper. Res. 130, 217\u2013239 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9100_CR10","doi-asserted-by":"crossref","unstructured":"Danna, E., Perron, L.: Structured vs. unstructured large neighborhood search: a case study on job-shop scheduling problems with earliness and tardiness costs. In: Ninth International Conference on Principles and Practice of Constraint Programming, pp. 817\u2013821 (2003)","DOI":"10.1007\/978-3-540-45193-8_59"},{"key":"9100_CR11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artif. Intell. 49, 61\u201395 (1991)","journal-title":"Artif. Intell."},{"key":"9100_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"9100_CR13","unstructured":"Godard, D., Laborie, P., Nuijten, W.: Randomized large neighborhood search for cumulative scheduling. In: Proceedings of Fifteenth International Conference on Automated Planning and Scheduling, pp. 81\u201389 (2005)"},{"key":"9100_CR14","unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), pp. 431\u2013437 (1998)"},{"key":"9100_CR15","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hamadi, Y., Leyton-Brown, K., Hoos, H.H.: Performance prediction and automated tuning of randomized and parametric algorithms. In: Principles and Practice of Constraint Programming\u00a0(CP\u201906), pp. 213\u2013228 (2006)","DOI":"10.1007\/11889205_17"},{"key":"9100_CR16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","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. Artif. Intell. 143, 151\u2013188 (2003)","journal-title":"Artif. Intell."},{"key":"9100_CR17","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Inf. Process. Lett. 47, 173\u2013180 (1993)","journal-title":"Inf. Process. Lett."},{"key":"9100_CR18","unstructured":"Mautor, T., Michelon, P.: Mimausa: an application of referent domain optimization. Technical report, Laboratoire dInformatique dAvignon (2001)"},{"key":"9100_CR19","unstructured":"Michel, L., Van\u00a0Hentenryck, P.: Iterative relaxations for iterative flattening in cumulative scheduling. In: Proceedings of Fourteenth International Conference on Automated Planning and Scheduling, pp. 200\u2013208 (2004)"},{"key":"9100_CR20","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9100_CR21","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1009687210594","volume":"3","author":"W. Nuijten","year":"1998","unstructured":"Nuijten, W., Le\u00a0Pape, C.: Constraint-based job shop scheduling with ILOG scheduler. J. Heuristics 3, 271\u2013286 (1998)","journal-title":"J. Heuristics"},{"key":"9100_CR22","unstructured":"Nuijten, W.P.M.: Time and resource constrained scheduling: a constraint satisfaction approach. Ph.D. thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology (1994)"},{"issue":"1\u20134","key":"9100_CR23","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/B:ANOR.0000039521.26237.62","volume":"131","author":"M. Palpant","year":"2004","unstructured":"Palpant, M., Artigues, C., Michelon, P.: LSSPER: solving the resource-constrained project scheduling problem with large neighbourhood search. Ann. Oper. Res. 131(1\u20134), 237\u2013257 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9100_CR24","doi-asserted-by":"crossref","unstructured":"Perron, L., Shaw, P.: Combining forces to solve the car sequencing problem. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 225\u2013239 (2004)","DOI":"10.1007\/978-3-540-24664-0_16"},{"key":"9100_CR25","doi-asserted-by":"crossref","unstructured":"Perron, L., Shaw, P., Furnon, V.: Propagation guided large neighborhood search. In: Proceedings of Tenth International Conference on Principles and Practice of Constraint Programming, pp. 468\u2013481 (2004)","DOI":"10.1007\/978-3-540-30201-8_35"},{"key":"9100_CR26","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume":"1520","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. Lect. Notes Comput. Sci. 1520, 417 (1998)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9100_CR27","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E. Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"9100_CR28","unstructured":"Taillard, E.: Best lower and upper bounds known, from OR-Lib. Website (2005). http:\/\/mistic.heig-vd.ch\/taillard\/problemes.dir\/ordonnancement.dir\/jobshop.dir\/best_lb_up.txt"},{"key":"9100_CR29","doi-asserted-by":"crossref","unstructured":"Wu, H., van Beek, P.: Restart strategies: analysis and simulation. In: Ninth International Conference on Principles and Practice of Constraint Programming, p. 1001 (2003)","DOI":"10.1007\/978-3-540-45193-8_125"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9100-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-008-9100-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9100-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:31Z","timestamp":1559269591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-008-9100-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,7]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["9100"],"URL":"https:\/\/doi.org\/10.1007\/s10852-008-9100-2","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,7]]}}}