{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:03:24Z","timestamp":1725483804969},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_11","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T01:59:47Z","timestamp":1179194387000},"page":"155-171","source":"Crossref","is-referenced-by-count":10,"title":["Local Probing Applied to Scheduling"],"prefix":"10.1007","author":[{"given":"Olli","family":"Kamarainen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hani El","family":"Sakkout","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"11_CR1","unstructured":"F. Ajili and H. El Sakkout. LP probing for piecewise linear optimization in scheduling. In Proc. of CP-AI-OR\u201901, pages 189\u2013203, 2001."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"N. Barnier and P. Brisset. Combine & conquer: Genetic algorithm and CP for optimization. In Proc. of CP98, page 436, 1998.","DOI":"10.1007\/3-540-49481-2_34"},{"key":"11_CR3","unstructured":"C. Beck and P. Refalo. A hybrid approach to scheduling with earliness and tardiness costs. In Proc. of CP-AI-OR\u201901, pages 175\u2013188, 2001."},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1009661600931","volume":"5","author":"Y. Caseau","year":"1999","unstructured":"Y. Caseau and F. Laburthe. Heuristics for large constrained vehicle routing problems. Journal of Heuristics, 5(3):281\u2013303, 1999.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2002","unstructured":"A. Cesta, A. Oddi, and S. Smith. A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8(1):109\u2013136, 2002.","journal-title":"Journal of Heuristics"},{"key":"11_CR6","unstructured":"A. El-Kholy and B. Richards. Temporal and resource reasoning in planning: The parcPLAN approach. In Proc. of ECAI96, pages 614\u2013618, 1996."},{"key":"11_CR7","series-title":"PhD Thesis","volume-title":"Improving Backtrack Search: Three Case Studies of Localized Dynamic Hybridization","author":"H. E. Sakkout","year":"1999","unstructured":"H. El Sakkout. Improving Backtrack Search: Three Case Studies of Localized Dynamic Hybridization. PhD Thesis, Imperial College, London, 1999."},{"key":"11_CR8","unstructured":"H. El Sakkout, T. Richards, and M. Wallace. Minimal perturbation in dynamic scheduling. In Proc. of ECAI98, pages 504\u2013508, 1998."},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"5","author":"H. E. Sakkout","year":"2000","unstructured":"H. El Sakkout and M. Wallace. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4):359\u2013388, 2000.","journal-title":"Constraints"},{"key":"11_CR10","unstructured":"F. Focacci, F. Laburthe, and A. Lodi. Local search and constraint programming. In Handbook on Metaheuristics, Kluwer, 2002. To be published."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"5","author":"F. Glover","year":"1986","unstructured":"F. Glover. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research, 5:533\u2013549, 1986.","journal-title":"Computers & Operations Research"},{"key":"11_CR12","unstructured":"D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989."},{"key":"11_CR13","unstructured":"W. D. Harvey and M. L. Ginsberg. Limited discrepancy search. In Proc. of IJCAI95, pages 607\u2013615, 1995."},{"key":"11_CR14","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. H. Holland","year":"1975","unstructured":"J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1013195004424","volume":"104","author":"J. N. Hooker","year":"2001","unstructured":"J. N. Hooker, Hak-Jin Kim, and G. Ottosson. A declarative modeling framework that integrates solution methods. Annals of Operations Res., 104:141\u2013161, 2001.","journal-title":"Annals of Operations Res."},{"key":"11_CR16","unstructured":"IC-Parc. ECLiPSe User manual. \n                    http:\/\/www.icparc.ic.ac.uk\/eclipse\/\n                    \n                  , 2001."},{"key":"11_CR17","unstructured":"N. Jussien and O. Lhomme. Local search with constraint propagation and conflict-based heuristics. In Proc. of AAAI-00, pages 169\u2013174, 2000."},{"key":"11_CR18","unstructured":"O. Kamarainen, H. El Sakkout, and J. Lever. Local probing for resource constrained scheduling. In Proc. of the CP01 Workshop on Cooperative Solvers, 2001."},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C. Gelatt Jr., and M. Vecchi. Optimization by simulated annealing. Science, 220:671\u2013680, 1983.","journal-title":"Science"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"L. Michel and P. Van Hentenryck. Localizer: A modeling language for local search. In Proc. of CP97, pages 237\u2013251, 1997.","DOI":"10.1007\/BFb0017443"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"S. Minton, M. D. Johnston, A. B. Philips, and P. Laird. Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58:161\u2013205, 1992.","journal-title":"Artificial Intelligence"},{"key":"11_CR22","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"N. Mladenovic and P. Hansen. Variable neighbourhood search. Computers & Operations Research, 24:1097\u20131100, 1997.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"11_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G. Pesant","year":"1999","unstructured":"G. Pesant and M. Gendreau. A constraint programming framework for local search methods. Journal of Heuristics, 5(3):255\u2013279, 1999.","journal-title":"Journal of Heuristics"},{"key":"11_CR24","unstructured":"A. Schaerf. Combining local search and look-ahead for scheduling and constraint satisfaction problems. In Proc. of IJCAI97, pages 1254\u20131259, 1997."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Proc. of CP98, pages 417\u2013431, 1998.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"11_CR26","unstructured":"C. Voudouris and E. Tsang. Partial constraint satisfaction problems and guided local search. In Proc. of PACT96, pages 337\u2013356, 1996."},{"issue":"4","key":"11_CR27","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1014450507312","volume":"34","author":"M. Wallace","year":"2002","unstructured":"M. Wallace and J. Schimpf. Finding the right hybrid algorithm-a combinatorial meta-problem. Annals of Math. and Artificial Intelligence, 34(4):259\u2013269, 2002.","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"11_CR28","unstructured":"J. Zhang and H. Zhang. Combining local search and backtracking techniques for constraint satisfaction. In Proc. of AAAI96, pages 369\u2013374, 1996."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:18:13Z","timestamp":1550319493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}