{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:50Z","timestamp":1742914310684,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319896557"},{"type":"electronic","value":"9783319896564"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89656-4_5","type":"book-chapter","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T04:53:44Z","timestamp":1522904024000},"page":"60-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Logic-Based Benders Decomposition for Two-Stage Flexible Flow Shop Scheduling with Unrelated Parallel Machines"],"prefix":"10.1007","author":[{"given":"Yingcong","family":"Tan","sequence":"first","affiliation":[]},{"given":"Daria","family":"Terekhov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-15396-9_10","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"JC Beck","year":"2010","unstructured":"Beck, J.C.: Checking-up on branch-and-check. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 84\u201398. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_10"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10951-016-0485-x","volume":"20","author":"K B\u00fclb\u00fcl","year":"2017","unstructured":"B\u00fclb\u00fcl, K., \u015een, H.: An exact extended formulation for the unrelated parallel machine total weighted completion time problem. J. Sched. 20(4), 373\u2013389 (2017)","journal-title":"J. Sched."},{"issue":"5","key":"5_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/inte.20.5.61","volume":"20","author":"JD Camm","year":"1990","unstructured":"Camm, J.D., Raturi, A.S., Tsubakitani, S.: Cutting big $$M$$ down to size. Interfaces 20(5), 61\u201366 (1990)","journal-title":"Interfaces"},{"issue":"5","key":"5_CR4","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1017\/S0269888916000254","volume":"31","author":"AA Cir\u00e9","year":"2016","unstructured":"Cir\u00e9, A.A., Coban, E., Hooker, J.N.: Logic-based Benders decomposition for planning and scheduling: a computational analysis. Knowl. Eng. Rev. 31(5), 440\u2013451 (2016)","journal-title":"Knowl. Eng. Rev."},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1016\/j.apm.2012.03.020","volume":"37","author":"Y Demir","year":"2013","unstructured":"Demir, Y., \u0130\u015fleyen, S.K.: Evaluation of mathematical models for flexible job-shop scheduling problems. Appl. Math. Model. 37(3), 977\u2013988 (2013)","journal-title":"Appl. Math. Model."},{"issue":"3","key":"5_CR6","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/S0377-2217(97)00194-X","volume":"109","author":"MM Dessouky","year":"1998","unstructured":"Dessouky, M.M., Dessouky, M.I., Verma, S.K.: Flowshop scheduling with identical jobs and uniform parallel machines. Eur. J. Oper. Res. 109(3), 620\u2013631 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.cie.2009.02.012","volume":"58","author":"H Fei","year":"2010","unstructured":"Fei, H., Meskens, N., Chu, C.: A planning and scheduling problem for an operating theatre using an open scheduling strategy. Comput. Ind. Eng. 58(2), 221\u2013230 (2010)","journal-title":"Comput. Ind. Eng."},{"issue":"7","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1080\/00207549108948025","volume":"29","author":"JN Gupta","year":"1991","unstructured":"Gupta, J.N., Tunc, E.A.: Schedules for a two-stage hybrid flowshop with parallel machines at the second stage. Int. J. Prod. Res. 29(7), 1489\u20131502 (1991)","journal-title":"Int. J. Prod. Res."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-33954-2_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"A Heching","year":"2016","unstructured":"Heching, A., Hooker, J.N.: Scheduling home hospice care with logic-based Benders decomposition. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 187\u2013197. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33954-2_14"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-66158-2_36","volume-title":"Principles and Practice of Constraint Programming","author":"JN Hooker","year":"2017","unstructured":"Hooker, J.N.: Job sequencing bounds from decision diagrams. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 565\u2013578. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_36"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/3-540-58601-6_111","volume-title":"Principles and Practice of Constraint Programming","author":"JN Hooker","year":"1994","unstructured":"Hooker, J.N.: Logic-based methods for optimization. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 336\u2013349. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58601-6_111"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10601-005-2812-2","volume":"10","author":"JN Hooker","year":"2005","unstructured":"Hooker, J.N.: A hybrid method for the planning and scheduling. Constraints 10(4), 385\u2013401 (2005)","journal-title":"Constraints"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based Benders decomposition. Math. Program. 96(1), 33\u201360 (2003)","journal-title":"Math. Program."},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cor.2016.04.006","volume":"73","author":"WY Ku","year":"2016","unstructured":"Ku, W.Y., Beck, J.C.: Mixed integer programming models for job shop scheduling: a computational analysis. Comput. Oper. Res. 73, 165\u2013173 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne, A.S.: On the job-shop scheduling problem. Oper. Res. 8(2), 219\u2013223 (1960)","journal-title":"Oper. Res."},{"issue":"6","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1016\/j.apm.2009.09.002","volume":"34","author":"C \u00d6zg\u00fcven","year":"2010","unstructured":"\u00d6zg\u00fcven, C., \u00d6zbak\u0131r, L., Yavuz, Y.: Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl. Math. Model. 34(6), 1539\u20131548 (2010)","journal-title":"Appl. Math. Model."},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1287\/ijoc.2017.0745","volume":"29","author":"V Roshanaei","year":"2017","unstructured":"Roshanaei, V., Luong, C., Aleman, D.M., Urbach, D.R.: Collaborative operating room planning and scheduling. INFORMS J. Comput. 29(3), 558\u2013580 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","volume":"169","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C.: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur. J. Oper. Res. 169(3), 781\u2013800 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz, R., V\u00e1zquez-Rodr\u00edguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1\u201318 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0925-5273(01)00119-0","volume":"74","author":"CS Thomalla","year":"2001","unstructured":"Thomalla, C.S.: Job shop scheduling with alternative process plans. Int. J. Prod. Econ. 74(1), 125\u2013134 (2001)","journal-title":"Int. J. Prod. Econ."},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45578-7_2","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"ES Thorsteinsson","year":"2001","unstructured":"Thorsteinsson, E.S.: Branch-and-check: a hybrid framework integrating mixed integer programming and constraint logic programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 16\u201330. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_2"},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1287\/ijoc.2015.0666","volume":"28","author":"TT Tran","year":"2016","unstructured":"Tran, T.T., Araujo, A., Beck, J.C.: Decomposition methods for the parallel machine scheduling problem with setups. INFORMS J. Comput. 28(1), 83\u201395 (2016)","journal-title":"INFORMS J. Comput."},{"key":"5_CR23","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1613\/jair.5306","volume":"58","author":"TT Tran","year":"2017","unstructured":"Tran, T.T., Vaquero, T., Nejat, G., Beck, J.C.: Robots in retirement homes: applying off-the-shelf planning and scheduling to a team of assistive robots. J. Artif. Intell. Res. 58, 523\u2013590 (2017)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89656-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:34:19Z","timestamp":1710354859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89656-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319896557","9783319896564"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89656-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"6 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Canadian AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canadian Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toronto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"canadianai2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.caiac.ca\/en\/conferences\/canadianai-2018\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}