{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T13:54:50Z","timestamp":1768658090059,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T00:00:00Z","timestamp":1565308800000},"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":"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":["11771406"],"award-info":[{"award-number":["11771406"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10479-019-03352-6","type":"journal-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T06:02:25Z","timestamp":1565330545000},"page":"79-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine"],"prefix":"10.1007","volume":"298","author":[{"given":"Xing","family":"Chai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3925-9066","authenticated-orcid":false,"given":"Wenhua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yuejuan","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,9]]},"reference":[{"issue":"3","key":"3352_CR1","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1287\/moor.1040.0092","volume":"29","author":"EJ Anderson","year":"2004","unstructured":"Anderson, E. J., & Potts, C. N. (2004). Online scheduling of a single machine to minimize total weighted completion time. Mathematics of Operations Research, 29(3), 686\u2013697. https:\/\/doi.org\/10.1287\/moor.1040.0092.","journal-title":"Mathematics of Operations Research"},{"key":"3352_CR2","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker, K. R. (1974). Introduction to sequencing and scheduling. New York: Wiley."},{"key":"3352_CR3","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290676","author":"N Bansal","year":"2007","unstructured":"Bansal, N., & Dhamdhere, K. (2007). Minimizing weighted flow time. ACM Transactions on Algorithms,. https:\/\/doi.org\/10.1145\/1290672.1290676.","journal-title":"ACM Transactions on Algorithms"},{"issue":"3","key":"3352_CR4","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.jda.2005.12.001","volume":"4","author":"L Becchetti","year":"2006","unstructured":"Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., & Pruhs, K. (2006). Online weighted flow time and deadline scheduling. Journal of Discrete Algorithms, 4(3), 339\u2013352. https:\/\/doi.org\/10.1016\/j.jda.2005.12.001. (Special issue in honour of Giorgio Ausiello).","journal-title":"Journal of Discrete Algorithms"},{"issue":"1","key":"3352_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.3.CO;2-I","volume":"1","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., et al. (1998). Scheduling a batching machine. Journal of Scheduling, 1(1), 31\u201354. https:\/\/doi.org\/10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.3.CO;2-I.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"3352_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1080\/00207720903428906","volume":"42","author":"J Cao","year":"2011","unstructured":"Cao, J., Yuan, J., Li, W., & Bu, H. (2011). Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times. International Journal of Systems Science, 42(1), 51\u201355. https:\/\/doi.org\/10.1080\/00207720903428906.","journal-title":"International Journal of Systems Science"},{"key":"3352_CR7","doi-asserted-by":"publisher","unstructured":"Chekuri, C., Khanna, S., & Zhu, A. (2001). Algorithms for minimizing weighted flow time. In Proceedings of the thirty-third annual ACM symposium on theory of computing. ACM, New York, pp. 84\u201393. https:\/\/doi.org\/10.1145\/380752.380778.","DOI":"10.1145\/380752.380778"},{"issue":"1","key":"3352_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10479-011-0985-1","volume":"191","author":"M Gu","year":"2011","unstructured":"Gu, M., & Lu, X. (2011). Asymptotical optimality of wsept for stochastic online scheduling on uniform machines. Annals of Operations Research, 191(1), 97\u2013113. https:\/\/doi.org\/10.1007\/s10479-011-0985-1.","journal-title":"Annals of Operations Research"},{"issue":"04","key":"3352_CR9","doi-asserted-by":"publisher","first-page":"1450030","DOI":"10.1142\/S0217595914500304","volume":"31","author":"C Jiao","year":"2014","unstructured":"Jiao, C., Li, W., & Yuan, J. (2014). A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machines. Asia-Pacific Journal of Operational Research, 31(04), 1450030. https:\/\/doi.org\/10.1142\/S0217595914500304.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"1","key":"3352_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10479-012-1271-6","volume":"204","author":"K Lee","year":"2013","unstructured":"Lee, K., Leung, J. Y. T., & Pinedo, M. L. (2013). Makespan minimization in online scheduling with machine eligibility. Annals of Operations Research, 204(1), 189\u2013222. https:\/\/doi.org\/10.1007\/s10479-012-1271-6.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"3352_CR11","doi-asserted-by":"publisher","first-page":"1550030","DOI":"10.1142\/S021759591550030X","volume":"32","author":"W Li","year":"2015","unstructured":"Li, W. (2015). A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completion time. Asia-Pacific Journal of Operational Research, 32(4), 1550030. https:\/\/doi.org\/10.1142\/S021759591550030X.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"18","key":"3352_CR12","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1016\/j.ipl.2011.06.008","volume":"111","author":"W Li","year":"2011","unstructured":"Li, W., & Yuan, J. (2011). Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time. Information Processing Letters, 111(18), 907\u2013911. https:\/\/doi.org\/10.1016\/j.ipl.2011.06.008.","journal-title":"Information Processing Letters"},{"issue":"4","key":"3352_CR13","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10878-007-9070-8","volume":"14","author":"W Li","year":"2007","unstructured":"Li, W., Yuan, J., & Lin, Y. (2007). A note on special optimal batching structures to minimize total weighted completion time. Journal of Combinatorial Optimization, 14(4), 475\u2013480. https:\/\/doi.org\/10.1007\/s10878-007-9070-8.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"3352_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10878-010-9348-0","volume":"23","author":"M Liu","year":"2012","unstructured":"Liu, M., Chu, C., Xu, Y., & Huo, J. (2012). An optimal online algorithm for single machine scheduling to minimize total general completion time. Journal of Combinatorial Optimization, 23(2), 189\u2013195. https:\/\/doi.org\/10.1007\/s10878-010-9348-0.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"3352_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10951-009-0154-4","volume":"15","author":"P Liu","year":"2012","unstructured":"Liu, P., Lu, X., & Fang, Y. (2012). A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines. Journal of Scheduling, 15(1), 77\u201381. https:\/\/doi.org\/10.1007\/s10951-009-0154-4.","journal-title":"Journal of Scheduling"},{"key":"3352_CR16","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.amc.2015.10.058","volume":"273","author":"R Ma","year":"2016","unstructured":"Ma, R., Tao, J., & Yuan, J. (2016). Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. Applied Mathematics and Computation, 273, 570\u2013583. https:\/\/doi.org\/10.1016\/j.amc.2015.10.058.","journal-title":"Applied Mathematics and Computation"},{"issue":"21\u201322","key":"3352_CR17","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1016\/j.ipl.2009.08.008","volume":"109","author":"J Tian","year":"2009","unstructured":"Tian, J., Cheng, T. C. E., Ng, C. T., & Yuan, J. (2009). Online scheduling on unbounded parallel-batch machines to minimize the makespan. Information Processing Letters, 109(21\u201322), 1211\u20131215. https:\/\/doi.org\/10.1016\/j.ipl.2009.08.008.","journal-title":"Information Processing Letters"},{"issue":"4","key":"3352_CR18","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., & Yuan, J. (2014). Online over time scheduling on parallel-batch machines: A survey. Journal of the Operations Research Society of China, 2(4), 445\u2013454. https:\/\/doi.org\/10.1007\/s40305-014-0060-0.","journal-title":"Journal of the Operations Research Society of China"},{"issue":"4","key":"3352_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1080\/07408179208964233","volume":"24","author":"R Uzsoy","year":"1992","unstructured":"Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1992). A review of production planning and scheduling models in the semiconductor industry Part I: System characteristics, performance evaluation and production planning. IIE Transactions, 24(4), 47\u201360. https:\/\/doi.org\/10.1080\/07408179208964233.","journal-title":"IIE Transactions"},{"issue":"5","key":"3352_CR20","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1080\/07408179408966627","volume":"26","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1994). A review of production planning and scheduling models in the semiconductor industry Part II: Shop-floor control. IIE Transactions, 26(5), 44\u201355. https:\/\/doi.org\/10.1080\/07408179408966627.","journal-title":"IIE Transactions"},{"issue":"1\u20132","key":"3352_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ipl.2011.09.014","volume":"112","author":"S Yu","year":"2012","unstructured":"Yu, S., & Wong, P. W. H. (2012). A note on \u201cAn optimal online algorithm for single machine scheduling to minimize total general completion time\u201d. Information Processing Letters, 112(1\u20132), 55\u201358. https:\/\/doi.org\/10.1016\/j.ipl.2011.09.014.","journal-title":"Information Processing Letters"},{"issue":"3","key":"3352_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/nav.5","volume":"48","author":"G Zhang","year":"2001","unstructured":"Zhang, G., Cai, X., & Wong, C. K. (2001). On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics, 48(3), 241\u2013258. https:\/\/doi.org\/10.1002\/nav.5.","journal-title":"Naval Research Logistics"},{"issue":"2","key":"3352_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/07408170304378","volume":"35","author":"G Zhang","year":"2003","unstructured":"Zhang, G., Cai, X., & Wong, C. K. (2003). Optimal on-line algorithms for scheduling on parallel batch processing machines. IIE Transactions, 35(2), 175\u2013181. https:\/\/doi.org\/10.1080\/07408170304378.","journal-title":"IIE Transactions"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03352-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03352-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03352-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,13]],"date-time":"2021-02-13T20:44:20Z","timestamp":1613249060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03352-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,9]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["3352"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03352-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,9]]},"assertion":[{"value":"9 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}