{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:07:04Z","timestamp":1767211624152,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T00:00:00Z","timestamp":1615334400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T00:00:00Z","timestamp":1615334400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["11601316"],"award-info":[{"award-number":["11601316"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSF of China","doi-asserted-by":"crossref","award":["71520107003"],"award-info":[{"award-number":["71520107003"]}],"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":[[2022,7]]},"DOI":"10.1007\/s10878-021-00715-3","type":"journal-article","created":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T20:02:48Z","timestamp":1615406568000},"page":"1645-1654","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Non-resumable scheduling on a single bounded parallel-batch machine with periodic maintenance"],"prefix":"10.1007","volume":"43","author":[{"given":"Jing","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6057-7528","authenticated-orcid":false,"given":"Hui","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,3,10]]},"reference":[{"key":"715_CR1","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1002\/nav.21641","volume":"62","author":"BY Cheng","year":"2015","unstructured":"Cheng BY, Leung JYT, Li K, Yang SL (2015) Single batch machine scheduling with deliveries. Naval Res Logist 62:470\u2013482","journal-title":"Naval Res Logist"},{"key":"715_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2013.09.007","volume":"510","author":"G Dosa","year":"2013","unstructured":"Dosa G, Li R, Han X, Tuza Z (2013) Tight absolute bound for first fit decreasing bin packing. Theor Comput Sci 510:13\u201361","journal-title":"Theor Comput Sci"},{"key":"715_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/nav.21587","volume":"61","author":"G Dosa","year":"2014","unstructured":"Dosa G, Tan ZY, Tuza Z, Yan YJ, L\u00e1nyi CS (2014) Improved bounds for batch scheduling with nonidentical job sizes. Naval Res Logist 61:351\u2013358","journal-title":"Naval Res Logist"},{"key":"715_CR4","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1007\/s10878-015-9857-y","volume":"30","author":"J Fan","year":"2015","unstructured":"Fan J, Lu XW (2015) Supply chain scheduling problem in the hospital with periodic working time on a single machine. J Comb Optim 30:892\u2013905","journal-title":"J Comb Optim"},{"key":"715_CR5","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-030-57602-8_47","volume":"12290","author":"J Fan","year":"2020","unstructured":"Fan J, Ng CT, Cheng TCE, Shi H (2020) Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery, AAIM 2020. Lect Notes Comput Sci 12290:525\u2013536","journal-title":"Lect Notes Comput Sci"},{"key":"715_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1002\/nav.20083","volume":"52","author":"Y He","year":"2005","unstructured":"He Y, Ji M, Cheng TCE (2005) Single machine scheduling with a restricted rate-modifying activity. Naval Res Logist 52:361\u2013369","journal-title":"Naval Res Logist"},{"key":"715_CR7","doi-asserted-by":"publisher","first-page":"1764","DOI":"10.1016\/j.cor.2005.05.034","volume":"34","author":"M Ji","year":"2007","unstructured":"Ji M, He Y, Cheng TCE (2007) Single-machine scheduling with periodic maintenance to minimize makespan. Comput Oper Res 34:1764\u20131770","journal-title":"Comput Oper Res"},{"key":"715_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00121681","volume":"9","author":"CY Lee","year":"1996","unstructured":"Lee CY (1996) Machine scheduling with an availability constraints. J Global Optim 9:395\u2013416","journal-title":"J Global Optim"},{"key":"715_CR9","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1016\/S0305-0548(02)00074-6","volume":"30","author":"CJ Liao","year":"2003","unstructured":"Liao CJ, Chen WJ (2003) Single-machine scheduling with periodic maintenance and nonresumable jobs. Comput Oper Res 30:1335\u20131347","journal-title":"Comput Oper Res"},{"key":"715_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10878-017-0211-4","volume":"37","author":"WH Li","year":"2019","unstructured":"Li WH, Chai X (2019) The medical laboratory scheduling for weighted flow-time. J Comb Optim 37:83\u201394","journal-title":"J Comb Optim"},{"key":"715_CR11","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-030-57602-8_48","volume":"12290","author":"LL Liu","year":"2020","unstructured":"Liu LL, Fu CY (2020) A batch scheduling problem of automatic drug dispensing system in outpatient pharmacy, AAIM 2020. Lect Notes Comput Sci 12290:537\u2013543","journal-title":"Lect Notes Comput Sci"},{"key":"715_CR12","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.apm.2009.04.014","volume":"34","author":"CY Low","year":"2010","unstructured":"Low CY, Ji M, Hsu CJ, Su CT (2010) Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance. Appl Math Model 34:334\u2013342","journal-title":"Appl Math Model"},{"key":"715_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y Ma","year":"2010","unstructured":"Ma Y, Chu CB, Zuo CR (2010) A survey of scheduling with deterministic machine availability constraints. Comput Ind Eng 58:199\u2013211","journal-title":"Comput Ind Eng"},{"key":"715_CR14","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy R (1994) A single batch processing machine with nonidentical job sizes. Int J Prod Res 32:1615\u20131635","journal-title":"Int J Prod Res"},{"key":"715_CR15","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1016\/j.cor.2006.08.015","volume":"35","author":"DH Xu","year":"2008","unstructured":"Xu DH, Sun KB, Li HX (2008) Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan. Comput Oper Res 35:1344\u20131349","journal-title":"Comput Oper Res"},{"key":"715_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10951-013-0350-0","volume":"17","author":"XY Yu","year":"2014","unstructured":"Yu XY, Zhang YL, Steiner G (2014) Single-machine scheduling with periodic maintenance to minimize makespan revisited. J Sched 17:263\u2013270","journal-title":"J Sched"},{"key":"715_CR17","first-page":"1","volume":"5","author":"AE Zade","year":"2013","unstructured":"Zade AE, Fakhrzad MB (2013) A dynamic genetic algorithm for solving a single machine scheduling problem with periodic maintenance. ISRN Ind Eng 5:1\u201311","journal-title":"ISRN Ind Eng"},{"key":"715_CR18","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1002\/nav.4","volume":"48","author":"GC Zhang","year":"2001","unstructured":"Zhang GC, Cai XQ, Lee CY, Wong CK (2001) Minimizing makespan on a single batch processing machine with nonidentical job sizes. Naval Res Logist 48:226\u2013240","journal-title":"Naval Res Logist"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00715-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00715-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00715-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T18:03:32Z","timestamp":1657735412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00715-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,10]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["715"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00715-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,3,10]]},"assertion":[{"value":"15 February 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}