{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T23:03:53Z","timestamp":1784070233744,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":14,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819233083","type":"print"},{"value":"9789819233090","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T00:00:00Z","timestamp":1784073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-981-92-3309-0_17","type":"book-chapter","created":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:08:16Z","timestamp":1784066896000},"page":"219-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-Machine Flow Shop Scheduling with\u00a0One Non-Availability Interval"],"prefix":"10.1007","author":[{"given":"Hao","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuan","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaojun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanbin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,15]]},"reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.ipl.2004.03.004","volume":"90","author":"J Breit","year":"2004","unstructured":"Breit, J.: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Inf. Process. Lett. 90(6), 273\u2013278 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0167-6377(01)00079-7","volume":"29","author":"J Breit","year":"2001","unstructured":"Breit, J., Schmidt, G., Strusevich, V.A.: Two-machine open shop scheduling with an availability constraint. Oper. Res. Lett. 29(2), 65\u201377 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s001860200267","volume":"57","author":"J Breit","year":"2003","unstructured":"Breit, J., Schmidt, G., Strusevich, V.A.: Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Methods Oper. Res. 57(2), 217\u2013234 (2003)","journal-title":"Math. Methods Oper. Res."},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0167-6377(00)00033-X","volume":"26","author":"TE Cheng","year":"2000","unstructured":"Cheng, T.E., Wang, G.: An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper. Res. Lett. 26(5), 223\u2013229 (2000)","journal-title":"Oper. Res. Lett."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Hadda, H., Dridi, N., Hajri-Gabouj, S.: An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs. 4OR 8(1), 87\u201399 (2010)","DOI":"10.1007\/s10288-009-0102-3"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Nav. Res. Logist. 61\u201368 (1954)","DOI":"10.1002\/nav.3800010110"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.cor.2007.10.013","volume":"36","author":"MA Kubzin","year":"2009","unstructured":"Kubzin, M.A., Potts, C.N., Strusevich, V.A.: Approximation results for flow shop scheduling problems with machine availability constraints. Comput. Oper. Res. 36(2), 379\u2013390 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1002\/nav.20122","volume":"53","author":"MA Kubzin","year":"2006","unstructured":"Kubzin, M.A., Strusevich, V.A., Breit, J., Schmidt, G.: Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints. Nav. Res. Logist. 53(1), 16\u201323 (2006)","journal-title":"Nav. Res. Logist."},{"issue":"3\u20134","key":"17_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"CY Lee","year":"1996","unstructured":"Lee, C.Y.: Machine scheduling with an availability constraint. J. Global Optim. 9(3\u20134), 395\u2013416 (1996)","journal-title":"J. Global Optim."},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","volume":"20","author":"CY Lee","year":"1997","unstructured":"Lee, C.Y.: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Oper. Res. Lett. 20(3), 129\u2013139 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/S0377-2217(97)00452-9","volume":"114","author":"CY Lee","year":"1999","unstructured":"Lee, C.Y.: Two-machine flowshop scheduling with availability constraints. Eur. J. Oper. Res. 114(2), 420\u2013429 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1057\/palgrave.jors.2601421","volume":"53","author":"T Lorigeon","year":"2002","unstructured":"Lorigeon, T., Billaut, J., Bouquard, J.: A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint. J. Oper. Res. Soc. 53(11), 1239\u20131246 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/nav.10107","volume":"51","author":"C Ng","year":"2004","unstructured":"Ng, C., Kovalyov, M.Y.: An FPTAS for scheduling a two-machine flowshop with one unavailability interval. Nav. Res. Logist. 51(3), 307\u2013315 (2004)","journal-title":"Nav. Res. Logist."},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/s10878-021-00773-7","volume":"43","author":"Y Yuan","year":"2022","unstructured":"Yuan, Y., Lan, Y., Ding, N., Han, X.: A PTAS for non-resumable open shop scheduling with an availability constraint. J. Comb. Optim. 43(2), 350\u2013362 (2022)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-3309-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T22:08:17Z","timestamp":1784066897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-3309-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,15]]},"ISBN":["9789819233083","9789819233090"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-3309-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,15]]},"assertion":[{"value":"15 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/event.ntu.edu.sg\/cocoon2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}