{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:26:29Z","timestamp":1787502389901,"version":"build-2736575974"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,23]],"date-time":"2020-02-23T00:00:00Z","timestamp":1582416000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,23]],"date-time":"2020-02-23T00:00:00Z","timestamp":1582416000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871213"],"award-info":[{"award-number":["11871213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["71431004"],"award-info":[{"award-number":["71431004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10878-020-00548-6","type":"journal-article","created":{"date-parts":[[2020,2,22]],"date-time":"2020-02-22T23:18:53Z","timestamp":1582413533000},"page":"1060-1078","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Two-machine flow shop scheduling with an operator non-availability period to minimize makespan"],"prefix":"10.1007","volume":"39","author":[{"given":"Dawei","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4728-6048","authenticated-orcid":false,"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,2,23]]},"reference":[{"issue":"3","key":"548_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10288-008-0084-6","volume":"7","author":"N Brauner","year":"2009","unstructured":"Brauner N, Finke G, Lehoux-Lebacque V, Rapine C, Kellerer H, Potts C, Strusevich V (2009) Operator non-availability periods. 4OR 7(3):239\u2013253","journal-title":"4OR"},{"issue":"6","key":"548_CR2","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 (2004) An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. Inf Process Lett 90(6):273\u2013278","journal-title":"Inf Process Lett"},{"issue":"4","key":"548_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.ins.2013.07.003","volume":"251","author":"Y Chen","year":"2013","unstructured":"Chen Y, Zhang A, Tan ZY (2013) Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time. Inf Sci 251(4):150\u2013163","journal-title":"Inf Sci"},{"issue":"5","key":"548_CR4","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0167-6377(00)00033-X","volume":"26","author":"TCE Cheng","year":"2000","unstructured":"Cheng TCE, Wang GQ (2000) An improved heuristic for two-machine flowshop scheduling with an availability constraint. Oper Res Lett 26(5):223\u2013229","journal-title":"Oper Res Lett"},{"issue":"1","key":"548_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10288-009-0102-3","volume":"8","author":"H Hadda","year":"2010","unstructured":"Hadda H, Dridi N, Hajri-Gabouj S (2010) An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs. 4OR 8(1):87\u201399","journal-title":"4OR"},{"issue":"Complete","key":"548_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.ijpe.2015.02.025","volume":"164","author":"F Hnaien","year":"2015","unstructured":"Hnaien F, Yalaoui F, Mhadhbi A (2015) Makespan minimization on a two-machine flowshop with an availability constraint on the first machine. Int J Prod Econ 164(Complete):95\u2013104","journal-title":"Int J Prod Econ"},{"issue":"1","key":"548_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist 1(1):61\u201368","journal-title":"Nav Res Logist"},{"issue":"2","key":"548_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.cor.2007.10.013","volume":"36","author":"MA Kubzin","year":"2009","unstructured":"Kubzin MA, Potts CN, Strusevich VA (2009) Approximation results for flow shop scheduling problems with machine availability constraints. Comput Oper Res 36(2):379\u2013390","journal-title":"Comput Oper Res"},{"issue":"3","key":"548_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0167-6377(96)00041-7","volume":"20","author":"CY Lee","year":"1997","unstructured":"Lee CY (1997) Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Oper Res Lett 20(3):129\u2013139","journal-title":"Oper Res Lett"},{"issue":"2","key":"548_CR10","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/S0377-2217(97)00452-9","volume":"114","author":"CY Lee","year":"1999","unstructured":"Lee CY (1999) Two-machine flowshop scheduling with availability constraints. Eur J Oper Res 114(2):420\u2013429","journal-title":"Eur J Oper Res"},{"key":"548_CR11","unstructured":"Lebacque V, Brauner N, Celse B, Finke G, Rapine C (2007) Planification d\u2019exp\u00e9riences dans l\u2019industrie chimique, Chap. 1, pp 21\u201332. Dans Les syst\u00e8mes de production applications interdisciplinaires et mutations sous la direction de Boujut J-F, Llerena D, Brissaud D, Herm\u00e8s-Lavoisier, ISBN, 978-2-7462-1819-2"},{"issue":"2","key":"548_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10951-012-0269-x","volume":"15","author":"C Rapine","year":"2012","unstructured":"Rapine C, Brauner N, Finke G, Lebacque V (2012) Single machine scheduling with small operator-non-availability periods. J Sched 15(2):127\u2013139","journal-title":"J Sched"},{"key":"548_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2018.03.005","volume":"445\u2013446","author":"L Wan","year":"2018","unstructured":"Wan L, Yuan JJ (2018) Single-machine scheduling with operator non-availability to minimize total weighted completion time. Inf Sci 445\u2013446:1\u20135","journal-title":"Inf Sci"},{"issue":"1","key":"548_CR14","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.cor.2005.05.003","volume":"34","author":"XL Wang","year":"2007","unstructured":"Wang XL, Cheng TCE (2007) Heuristics for two-machine flowshop scheduling with setup times and an availability constraint. Comput Oper Res 34(1):152\u2013162","journal-title":"Comput Oper Res"},{"issue":"3","key":"548_CR15","first-page":"1","volume":"43","author":"ZJ Xu","year":"2017","unstructured":"Xu ZJ, Xu DH, He J, Wang Q, Liu AH, Xiao JF (2017) Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint. Arab J Sci Eng 43(3):1\u201312","journal-title":"Arab J Sci Eng"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00548-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00548-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00548-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,21]],"date-time":"2021-02-21T19:19:20Z","timestamp":1613935160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00548-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,23]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["548"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00548-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,23]]},"assertion":[{"value":"23 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}