{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:53:02Z","timestamp":1725562382924},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219378"},{"type":"electronic","value":"9783540246749"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24674-9_36","type":"book-chapter","created":{"date-parts":[[2010,8,5]],"date-time":"2010-08-05T01:36:21Z","timestamp":1280972181000},"page":"342-351","source":"Crossref","is-referenced-by-count":3,"title":["Construction and Repair: A Hybrid Approach to Search in CSPs"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Chatzikokolakis","sequence":"first","affiliation":[]},{"given":"George","family":"Boukeas","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Stamatopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Nareyek, A., Smith, S.F., Ohler, C.M.: Integrating local-search advice into refinement search (or not). In: Proceedings of the CP 2003 Third International Workshop on Cooperative Solvers in Constraint Programming, pp. 29\u201343 (2003)"},{"key":"36_CR2","unstructured":"Zhang, J., Zhang, H.: Combining local search and backtracking techniques for constraint satisfaction. In: AAAI 1996, pp. 369\u2013374 (1996)"},{"key":"36_CR3","unstructured":"Schaerf, A.: Combining local search and look-ahead for scheduling and constraint satisfaction problems. In: IJCAI 1997, pp. 1254\u20131259 (1997)"},{"key":"36_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45331-8_26","volume-title":"Artificial Intelligence: Methodology, Systems, and Applications","author":"N. Roos","year":"2000","unstructured":"Roos, N., Ran, Y., van den Herik, H.J.: Combining local search and constraint propagation to find a minimal change solution for a dynamic csp. In: Cerri, S.A., Dochev, D. (eds.) AIMSA 2000. LNCS (LNAI), vol.\u00a01904, pp. 272\u2013282. Springer, Heidelberg (2000)"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1021140902684","volume":"115","author":"S. Prestwich","year":"2002","unstructured":"Prestwich, S.: Combining the scalability of local search with the pruning techniques of systematic search. Annals of Operations Research\u00a0115, 51\u201372 (2002)","journal-title":"Annals of Operations Research"},{"key":"36_CR6","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 conflictbased heuristics. Artificial Intelligence\u00a0139, 21\u201345 (2002)","journal-title":"Artificial Intelligence"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence\u00a058, 161\u2013205 (1992)","journal-title":"Artificial Intelligence"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of the ACM\u00a023, 665\u2013679 (1976)","journal-title":"Journal of the ACM"},{"key":"36_CR9","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operational Research"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(96)00116-3","volume":"76","author":"P. Brucker","year":"1997","unstructured":"Brucker, P., Hurink, J., Jurich, B., Wostmann, B.: A branch-and-bound algorithm for the open-shop problem. Discrete Applied Mathematics\u00a076, 43\u201359 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1018930613891","volume":"92","author":"C. Gu\u00e9ret","year":"1999","unstructured":"Gu\u00e9ret, C., Prins, C.: A new lower bound for the open-shop problem. Annals of Operations Research\u00a092, 165\u2013183 (1999)","journal-title":"Annals of Operations Research"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s001860000090","volume":"52","author":"C. Prins","year":"2000","unstructured":"Prins, C.: Competitive genetic algorithms for the open shop scheduling problem. Mathematical Methods of Operations Research\u00a052, 389\u2013411 (2000)","journal-title":"Mathematical Methods of Operations Research"},{"key":"36_CR13","first-page":"283","volume":"5","author":"D. Alcaide","year":"1997","unstructured":"Alcaide, D., Sicilia, J., Vigo, D.: A tabu search algorithm for the open shop problem. Trobajos de Investigaci\u00f3n Operativa\u00a05, 283\u2013297 (1997)","journal-title":"Trobajos de Investigaci\u00f3n Operativa"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0305-0548(98)00056-2","volume":"26","author":"C.F. Liaw","year":"1999","unstructured":"Liaw, C.F.: A tabu search algorithm for the open shop scheduling problem. Computers and Operations Research\u00a026, 109\u2013126 (1999)","journal-title":"Computers and Operations Research"},{"key":"36_CR15","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 branchand- bound methods: An application to open-shop problems. European Journal of Operational Research\u00a0127, 344\u2013354 (2000)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Methods and Applications of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24674-9_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:00:19Z","timestamp":1620010819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24674-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219378","9783540246749"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24674-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}