{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:49:18Z","timestamp":1768535358982,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T00:00:00Z","timestamp":1652918400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11590-022-01889-3","type":"journal-article","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T05:02:37Z","timestamp":1652936557000},"page":"591-612","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Online NDP-constraint scheduling of jobs with delivery times or weights"],"prefix":"10.1007","volume":"17","author":[{"given":"Wenjie","family":"Li","sequence":"first","affiliation":[]},{"given":"Hailing","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,19]]},"reference":[{"key":"1889_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":"1889_CR2","volume-title":"Introduction to Sequencing and Scheduling","author":"KR Baker","year":"1974","unstructured":"Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, New York (1974)"},{"key":"1889_CR3","doi-asserted-by":"crossref","unstructured":"Chai, X., Lu, L.F., Li, W.H., Zhang, L.Q.: Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time. Asia Pac. J. Oper. Res. 35, 1850048(1-10) (2018)","DOI":"10.1142\/S0217595918500483"},{"key":"1889_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10288-019-00410-4","volume":"18","author":"RB Chen","year":"2020","unstructured":"Chen, R.B., Yuan, J.J.: Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 4OR Q. J. Oper. Res. 18, 177\u2013196 (2020)","journal-title":"4OR Q. J. Oper. Res."},{"key":"1889_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10878-010-9298-6","volume":"22","author":"Y Fang","year":"2011","unstructured":"Fang, Y., Liu, P.H., Lu, X.W.: Optimal on-line algorithms for one batch machine with grouped processing times. J. Comb. Optim. 22, 509\u2013516 (2011)","journal-title":"J. Comb. Optim."},{"key":"1889_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/S0895480196296823","volume":"13","author":"H Hoogeveen","year":"2000","unstructured":"Hoogeveen, H., Vestjens, A.P.A.: A best possible deterministic on-line algorithm for minimizing maximum delivery time on a single machine. SIAM J. Discret. Math. 13, 56\u201363 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"1889_CR7","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.: Online scheduling on a single machine: maximizing the number of early jobs. Oper. Res. Lett. 27, 193\u2013196 (2000)","journal-title":"Oper. Res. Lett."},{"key":"1889_CR8","unstructured":"Keskinocak, P.: Online algorithms with lookahead: a survey, ISYE working paper (1999)"},{"key":"1889_CR9","doi-asserted-by":"crossref","unstructured":"Li, W.J.: A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completion time. Asia Pac. J. Oper. Res. 32, 1550030(1-10) (2015)","DOI":"10.1142\/S021759591550030X"},{"key":"1889_CR10","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s40299-018-0405-2","volume":"6","author":"WH Li","year":"2018","unstructured":"Li, W.H., Chai, X.: Online scheduling on bounded batch machines to minimize the maximum weighted completion time. Asia Pac. J. Oper. Res. 6, 455\u2013465 (2018)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"1889_CR11","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/s10878-021-00722-4","volume":"41","author":"WJ Li","year":"2021","unstructured":"Li, W.J., Yuan, J.J.: Single-machine online scheduling of jobs with non-delayed processing constraint. J. Comb. Optim. 41, 830\u2013843 (2021)","journal-title":"J. Comb. Optim."},{"key":"1889_CR12","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2009.03.028","volume":"201","author":"M Liu","year":"2010","unstructured":"Liu, M., Chu, C.B., Xu, Y.F., Zheng, F.F.: An optimal online algorithm for single machine scheduling with bounded delivery times. Eur. J. Oper. Res. 201, 693\u2013700 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1889_CR13","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/s11590-020-01618-8","volume":"15","author":"HL Liu","year":"2021","unstructured":"Liu, H.L., Lu, X.W., Li, W.J.: A best possible online algorithm for parallel batch scheduling with delivery times and limited restart. Optim. Lett. 15, 1155\u20131173 (2021)","journal-title":"Optim. Lett."},{"key":"1889_CR14","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.orl.2007.06.004","volume":"36","author":"ZY Tan","year":"2008","unstructured":"Tan, Z.Y., Yu, S.H.: Online scheduling with reassignment. Oper. Res. Lett. 36, 250\u2013254 (2008)","journal-title":"Oper. Res. Lett."},{"key":"1889_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2006.12.001","volume":"374","author":"J Tian","year":"2007","unstructured":"Tian, J., Fu, R.Y., Yuan, J.J.: On-line scheduling with delivery time on a single batch machine. Theoret. Comput. Sci. 374, 49\u201357 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"1889_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.tcs.2007.11.006","volume":"393","author":"J Tian","year":"2008","unstructured":"Tian, J., Fu, R.Y., Yuan, J.J.: A best on-line algorithm for single machine scheduling with small delivery times. Theoret. Comput. Sci. 393, 287\u2013293 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"1889_CR17","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1016\/j.ipl.2011.08.003","volume":"111","author":"J Tian","year":"2011","unstructured":"Tian, J., Fu, R.Y., Yuan, J.J.: An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times. Inf. Process. Lett. 111, 1048\u20131053 (2011)","journal-title":"Inf. Process. Lett."},{"key":"1889_CR18","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. Discret. Appl. Math. 160, 1191\u20131210 (2012)","journal-title":"Discret. Appl. Math."},{"key":"1889_CR19","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 possible on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times. J. Comb. Optim. 17, 206\u2013213 (2009)","journal-title":"J. Comb. Optim."},{"key":"1889_CR20","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1016\/j.ejor.2019.07.072","volume":"280","author":"JJ Yuan","year":"2020","unstructured":"Yuan, J.J., Ng, C.T., Cheng, T.C.E.: Scheduling with release dates and preemption to minimize multiple max-form objective functions. Eur. J. Oper. Res. 280, 860\u2013875 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"1889_CR21","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/s10878-019-00507-w","volume":"39","author":"QL Zhao","year":"2020","unstructured":"Zhao, Q.L., Yuan, J.J.: Bicriteria scheduling of equal length jobs on uniform parallel machines. J. Comb. Optim. 39, 637\u2013661 (2020)","journal-title":"J. Comb. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01889-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01889-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01889-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T12:16:22Z","timestamp":1678277782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01889-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,19]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1889"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01889-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,19]]},"assertion":[{"value":"19 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}