{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,16]],"date-time":"2025-04-16T06:29:12Z","timestamp":1744784952832},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_11","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T16:10:33Z","timestamp":1276359033000},"page":"87-91","source":"Crossref","is-referenced-by-count":10,"title":["Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition"],"prefix":"10.1007","author":[{"given":"Elvin","family":"Coban","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John N.","family":"Hooker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1016\/S0098-1354(02)00100-X","volume":"26","author":"I. Harjunkoski","year":"2002","unstructured":"Harjunkoski, I., Grossmann, I.E.: Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Computers and Chemical Engineering\u00a026, 1533\u20131552 (2002)","journal-title":"Computers and Chemical Engineering"},{"key":"11_CR2","unstructured":"Hooker, J.N.: Logic-based benders decomposition. Technical report, CMU (1995)"},{"key":"11_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033036","volume-title":"Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J.N. Hooker","year":"2000","unstructured":"Hooker, J.N.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10601-005-2812-2","volume":"10","author":"J.N. Hooker","year":"2005","unstructured":"Hooker, J.N.: A hybrid method for planning and scheduling. Constraints\u00a010, 385\u2013401 (2005)","journal-title":"Constraints"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10601-006-8060-2","volume":"11","author":"J.N. Hooker","year":"2006","unstructured":"Hooker, J.N.: An integrated method for planning and scheduling to minimize tardiness. Constraints\u00a011, 139\u2013157 (2006)","journal-title":"Constraints"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"J.N. Hooker","year":"2007","unstructured":"Hooker, J.N.: Planning and scheduling by logic-based benders decomposition. Operations Research\u00a055, 588\u2013602 (2007)","journal-title":"Operations Research"},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming\u00a096, 33\u201360 (2003)","journal-title":"Mathematical Programming"},{"key":"11_CR8","first-page":"267","volume-title":"Principles and Practice of Constraint Programming: The Newport Papers","author":"J.N. Hooker","year":"1995","unstructured":"Hooker, J.N., Yan, H.: Logic circuit verification by Benders decomposition. In: Principles and Practice of Constraint Programming: The Newport Papers, pp. 267\u2013288. MIT Press, Cambridge (1995)"},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain, V., Grossmann, I.E.: Algorithms for hybrid MILP\/CP models for a class of optimization problems. INFORMS Journal on Computing\u00a013(4), 258\u2013276 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"1921","DOI":"10.1016\/j.compchemeng.2004.03.016","volume":"28","author":"C.T. Maravelias","year":"2004","unstructured":"Maravelias, C.T., Grossmann, I.E.: A hybrid MILP\/CP decomposition approach for the continuous time scheduling of multipurpose batch plants. Computers and Chemical Engineering\u00a028, 1921\u20131949 (2004)","journal-title":"Computers and Chemical Engineering"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00291-002-0107-1","volume":"24","author":"C. Timpe","year":"2002","unstructured":"Timpe, C.: Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum\u00a024, 431\u2013448 (2002)","journal-title":"OR Spectrum"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:06:02Z","timestamp":1619784362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}