{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:18:39Z","timestamp":1761488319058},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042430"},{"type":"electronic","value":"9783642042447"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04244-7_33","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:17:24Z","timestamp":1252937844000},"page":"400-408","source":"Crossref","is-referenced-by-count":15,"title":["Closing the Open Shop: Contradicting Conventional Wisdom"],"prefix":"10.1007","author":[{"given":"Diarmuid","family":"Grimes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Malapert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Malapert, A., Cambazard, H., Gu\u00e9ret, C., Jussien, N., Langevin, A., Rousseau, L.-M.: An Optimal Constraint Programming Approach to the Open-Shop problem. Submitted to INFORMS, Journal of Computing (2008)"},{"key":"33_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-Based Scheduling: Applying Constraint Programming Techniques to Scheduling Problems","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming Techniques to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)"},{"key":"33_CR3","unstructured":"Beck, J.C., Davenport, A.J., Sitarski, E.M., Fox, M.S.: Texture-Based Heuristics for Scheduling Revisited. In: AAAI\/IAAI, pp. 241\u2013248 (1997)"},{"key":"33_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1613\/jair.2169","volume":"29","author":"J. Christopher Beck","year":"2007","unstructured":"Christopher Beck, J.: Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling. Journal of Artificial Intelligence Research\u00a029, 49\u201377 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"33_CR5","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004), Valencia, Spain, August 2004, pp. 482\u2013486 (2004)"},{"key":"33_CR6","first-page":"43","volume-title":"GO-II Meeting: Proceedings of the Second International Colloquium on Graphs and Optimization","author":"P. Brucker","year":"1997","unstructured":"Brucker, P., Hurink, J., Jurisch, B., W\u00f6stmann, B.: A Branch & Bound Algorithm for the Open-shop Problem. In: GO-II Meeting: Proceedings of the Second International Colloquium on Graphs and Optimization, pp. 43\u201359. Elsevier Science Publishers B. V., Amsterdam (1997)"},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J., Pinson, E.: An Algorithm for Solving the Job-shop Problem. Management Science\u00a035(2), 164\u2013176 (1989)","journal-title":"Management Science"},{"key":"33_CR8","unstructured":"The choco team. choco: an Open Source Java Constraint Programming Library. In: The Third International CSP Solver Competition, pp. 31\u201340 (2008)"},{"key":"33_CR9","unstructured":"Fox, M.S., Sadeh, N.M., Baykan, C.A.: Constrained heuristic search. In: IJCAI, pp. 309\u2013315 (1989)"},{"key":"33_CR10","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":"33_CR11","unstructured":"Hebrard, E.: Mistral, a Constraint Satisfaction Library. In: The Third International CSP Solver Competition, pp. 31\u201340 (2008)"},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","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. Artificial Intelligence\u00a0143(2), 151\u2013188 (2003)","journal-title":"Artificial Intelligence"},{"key":"33_CR13","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood Recording from Restarts. In: IJCAI, pp. 131\u2013136 (2007)"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. In: ISTCS, pp. 128\u2013133 (1993)","DOI":"10.1109\/ISTCS.1993.253477"},{"key":"33_CR15","unstructured":"Meiri, I.: Combining Qualitative and Quantitative Constraints in Temporal Reasoning. In: AAAI, pp. 260\u2013267 (1991)"},{"issue":"6","key":"33_CR16","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. Manage. Sci.\u00a042(6), 797\u2013813 (1996)","journal-title":"Manage. Sci."},{"issue":"2","key":"33_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E. Nowicki","year":"2005","unstructured":"Nowicki, E., Smutnicki, C.: An Advanced Tabu Search Algorithm for the Job Shop Problem. Journal of Scheduling\u00a08(2), 145\u2013159 (2005)","journal-title":"Journal of Scheduling"},{"key":"33_CR18","unstructured":"Nuijten, W.: Time and Resource Constraint Scheduling: A Constraint Satisfaction Approach. PhD thesis, Eindhoven University of Technology (1994)"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Pape Le","year":"1994","unstructured":"Le Pape, C.: Implementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems. Intelligent Systems Engineering\u00a03, 55\u201366 (1994)","journal-title":"Intelligent Systems Engineering"},{"issue":"10","key":"33_CR20","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.1016\/j.cor.2007.02.019","volume":"35","author":"D.Y. Sha","year":"2008","unstructured":"Sha, D.Y., Hsu, C.-Y.: A new Particle Swarm Optimization for the Open Shop Scheduling Problem. Computers & Operation Research\u00a035(10), 3243\u20133261 (2008)","journal-title":"Computers & Operation Research"},{"key":"33_CR21","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 Operations Research\u00a064, 278\u2013285 (1993)","journal-title":"European Journal of Operations Research"},{"key":"33_CR22","unstructured":"Walsh, T.: Search in a Small World. In: IJCAI, pp. 1172\u20131177 (1999)"},{"key":"33_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-68155-7_21","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J.-P. Watson","year":"2008","unstructured":"Watson, J.-P., Beck, J.C.: A Hybrid Constraint Programming \/ Local Search Approach to the Job-Shop Scheduling Problem. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 263\u2013277. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04244-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:47:02Z","timestamp":1552142822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04244-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042430","9783642042447"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04244-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}