{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T04:11:26Z","timestamp":1768536686400,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:00:00Z","timestamp":1594598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T00:00:00Z","timestamp":1594598400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11701148"],"award-info":[{"award-number":["11701148"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571321"],"award-info":[{"award-number":["11571321"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871213"],"award-info":[{"award-number":["11871213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Henan University of Engineering","award":["D2016017"],"award-info":[{"award-number":["D2016017"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501279"],"award-info":[{"award-number":["11501279"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Young Backbone Teachers of Henan Colleges","award":["2019GGJS202"],"award-info":[{"award-number":["2019GGJS202"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s11590-020-01618-8","type":"journal-article","created":{"date-parts":[[2020,7,13]],"date-time":"2020-07-13T08:04:46Z","timestamp":1594627486000},"page":"1155-1173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A best possible online algorithm for parallel batch scheduling with delivery times and limited restart"],"prefix":"10.1007","volume":"15","author":[{"given":"Hailing","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4728-6048","authenticated-orcid":false,"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,13]]},"reference":[{"key":"1618_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1002\/1099-1425(200011\/12)3:6<333::AID-JOS53>3.0.CO;2-8","volume":"3","author":"MVD Akker","year":"2003","unstructured":"Akker, M.V.D., Hoogeveen, H., Vakhania, N.: Restarts can help in the online minimization of the maximum delivery time on a single machine. J. Sched. 3, 333\u2013341 (2003)","journal-title":"J. Sched."},{"key":"1618_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0304-3975(02)00488-7","volume":"299","author":"L Epstein","year":"2003","unstructured":"Epstein, L., Van Stee, R.: Lower bounds for on-line single-machine scheduling. Theor. Comput. Sci. 299, 439\u2013450 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"1618_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.orl.2007.07.001","volume":"36","author":"RY Fu","year":"2008","unstructured":"Fu, R.Y., Tian, J., Yuan, J.J., He, C.: On-line scheduling on a batch machine to minimize makespan with limited restarts. Oper. Res. Lett. 36, 255\u2013258 (2008)","journal-title":"Oper. Res. Lett."},{"key":"1618_CR4","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.ipl.2010.04.008","volume":"110","author":"RY Fu","year":"2010","unstructured":"Fu, R.Y., Cheng, T.C.E., Ng, C.T., Yuan, J.J.: Online scheduling on two parallel batching machines with limited restarts to minimize the makespan. Inf. Process. Lett. 110, 444\u2013450 (2010)","journal-title":"Inf. Process. Lett."},{"key":"1618_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6377(00)00061-4","volume":"27","author":"H Hoogeveen","year":"2000","unstructured":"Hoogeveen, H., Potts, C.N., Woeginger, G.J.: On-line Scheduling on a single machine: maximizing the number of early jobs. Oper. Res. Lett. 27, 193\u2013197 (2000)","journal-title":"Oper. Res. Lett."},{"key":"1618_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"JA Hoogeveen","year":"2000","unstructured":"Hoogeveen, J.A., Vestjens, A.P.A.: A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM J. Discrete Math. 13, 56\u201363 (2000)","journal-title":"SIAM J. Discrete Math."},{"key":"1618_CR7","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"CY Lee","year":"1992","unstructured":"Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semi-conductor burn-in operations. Oper. Res. 40, 764\u2013775 (1992)","journal-title":"Oper. Res."},{"issue":"1","key":"1618_CR8","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s10878-014-9706-4","volume":"29","author":"PH Liu","year":"2015","unstructured":"Liu, P.H., Lu, X.W.: Online unbounded batch scheduling on parallel machines with delivery times. J. Comb. Optim. 29(1), 228\u2013236 (2015)","journal-title":"J. Comb. Optim."},{"key":"1618_CR9","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1007\/s10878-015-9844-3","volume":"31","author":"HL Liu","year":"2016","unstructured":"Liu, H.L., Yuan, J.J., Li, W.J.: Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart. J. Comb. Optim. 31, 1609\u20131622 (2016)","journal-title":"J. Comb. Optim."},{"key":"1618_CR10","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1016\/j.dam.2011.12.002","volume":"160","author":"J Tian","year":"2012","unstructured":"Tian, J., Cheng, T.C.E., Ng, C.T., Yuan, J.J.: An improved on-line algorithm for single parallel-batch machine scheduling with delivery times. Discrete Appl. Math. 160, 1191\u20131210 (2012)","journal-title":"Discrete Appl. Math."},{"key":"1618_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s40305-014-0060-0","volume":"2","author":"J Tian","year":"2014","unstructured":"Tian, J., Fu, R.Y., Yuan, J.J.: Online over time scheduling on parallel batch machines: a survey. J. Oper. Res. Soc. China 2, 445\u2013454 (2014)","journal-title":"J. Oper. Res. Soc. China"},{"key":"1618_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2016.01.001","volume":"617","author":"J Tian","year":"2016","unstructured":"Tian, J., Wang, Q., Fu, R.Y., Yuan, J.J.: Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time. Theor. Comput. Sci. 617, 65\u201368 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"1618_CR13","first-page":"47","volume":"24","author":"R Uzsoy","year":"1992","unstructured":"Uzsoy, R., Lee, C.Y., Martin-Vega, L.A.: A review of production planning and scheduling models in the semiconductor industry, part I: system characteristics, performance evaluation and production planning. IIE Trans. Sched. Logist. 24, 47\u201361 (1992)","journal-title":"IIE Trans. Sched. Logist."},{"key":"1618_CR14","first-page":"44","volume":"26","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R., Lee, C.Y., Martin-Vega, L.A.: A survey of production planning and scheduling models in the semiconductor industry, part II: shop-floor control. IIE Trans. Sched. Logist. 26, 44\u201355 (1994)","journal-title":"IIE Trans. Sched. Logist."},{"key":"1618_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jalgor.2004.10.001","volume":"57","author":"R Van Stee","year":"2005","unstructured":"Van Stee, R., Poutr\u00e9, H.L.: Minimizing the total completion time on-line on a single machine, using restarts. J. Algorithms. 57, 95\u2013129 (2005)","journal-title":"J. Algorithms."},{"key":"1618_CR16","unstructured":"Wei, Z.G.: Scheduling on a batch machine with item-availability to minimize total weighted completion time. Master Degree Thesis, Zhengzhou University, (2011)"},{"key":"1618_CR17","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/s10878-007-9108-y","volume":"17","author":"JJ Yuan","year":"2009","unstructured":"Yuan, J.J., Li, S.S., Tian, J., Fu, R.Y.: A best on-line scheduling for the single machine parallel-batch scheduling with restricted delivery time. J. Comb. Optim. 17, 206\u2013213 (2009)","journal-title":"J. Comb. Optim."},{"key":"1618_CR18","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s10951-010-0172-2","volume":"14","author":"JJ Yuan","year":"2011","unstructured":"Yuan, J.J., Fu, R.Y., Ng, C.T., Cheng, T.C.E.: A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. J. Sched. 14, 361\u2013369 (2011)","journal-title":"J. Sched."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01618-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-020-01618-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01618-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:10:26Z","timestamp":1626135026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-020-01618-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,13]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1618"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01618-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,13]]},"assertion":[{"value":"8 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}