{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T02:53:39Z","timestamp":1770692019117,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12461059"],"award-info":[{"award-number":["12461059"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["CCF Trans. HPC"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s42514-025-00245-y","type":"journal-article","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T05:21:06Z","timestamp":1761369666000},"page":"15-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online parallel-machine customer order scheduling with delivery time and penalties"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1650-2625","authenticated-orcid":false,"given":"Xiaofei","family":"Liu","sequence":"first","affiliation":[]},{"given":"Tianhan","family":"He","sequence":"additional","affiliation":[]},{"given":"Wencheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,25]]},"reference":[{"key":"245_CR1","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1007\/s10878-020-00649-2","volume":"40","author":"RX Chen","year":"2020","unstructured":"Chen, R.X., Li, S.S.: Minimizing maximum delivery completion time for order scheduling with rejection. J. Comb. Optim. 40, 1044\u20131064 (2020)","journal-title":"J. Comb. Optim."},{"issue":"12","key":"245_CR2","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1080\/00207160.2019.1711373","volume":"97","author":"B Dai","year":"2020","unstructured":"Dai, B., Li, W.: Vector scheduling with rejection on two machines. Int. J. Comput. Math. 97(12), 2507\u20132515 (2020)","journal-title":"Int. J. Comput. Math."},{"key":"245_CR3","doi-asserted-by":"crossref","unstructured":"Fiat, A., Woeginger, G.J.: Online algorithms: the state of the art. Springer, (1998)","DOI":"10.1007\/BFb0029561"},{"key":"245_CR4","volume-title":"Submodular Functions and Optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige, S.: Submodular Functions and Optimization, 2nd edn. Elsevier, Amsterdam (2005)","edition":"2"},{"key":"245_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-02302073-x","author":"B Hou","year":"2023","unstructured":"Hou, B., Zheng, H., Liu, W., Du, D.Z., Gao, S.: Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties. Optim. Lett. (2023). https:\/\/doi.org\/10.1007\/s11590-02302073-x","journal-title":"Optim. Lett."},{"issue":"2","key":"245_CR6","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.ejor.2004.03.030","volume":"168","author":"JYT Leung","year":"2006","unstructured":"Leung, J.Y.T., Li, H., Pinedo, M.: Scheduling orders for multiple product types with due date related objectives. Eur. J. Oper. Res. 168(2), 370\u2013389 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"245_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10288-017-0356-0","volume":"16","author":"W Li","year":"2018","unstructured":"Li, W., Cui, Q.: Vector scheduling with rejection on a single machine. 4OR 16, 95\u2013104 (2018)","journal-title":"4OR"},{"issue":"4","key":"245_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10878-023-01032-7","volume":"45","author":"X Liu","year":"2023","unstructured":"Liu, X., Xiao, M., Li, W., Zhu, Y., Ma, L.: Algorithms for single machine scheduling problem with release dates and submodular penalties. J. Comb. Optim. 45(4), 105 (2023)","journal-title":"J. Comb. Optim."},{"key":"245_CR9","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: Submodular Functions and Convexity. Mathematical Programming the State of the Art, pp. 235\u2013237. Springer, Berlin, Heidelberg (1983)","DOI":"10.1007\/978-3-642-68874-4_10"},{"key":"245_CR11","doi-asserted-by":"publisher","DOI":"10.13245\/j.hust.251097","author":"W Wang","year":"2025","unstructured":"Wang, W., Zheng, X., Liu, X.: Parallel-machine customer order scheduling with weighted and submodular rejection penalties. J Huazhong Univ Sci Technol (Natural Science Edition, Chinese) (2025). https:\/\/doi.org\/10.13245\/j.hust.251097","journal-title":"J Huazhong Univ Sci Technol (Natural Science Edition, Chinese)"},{"key":"245_CR12","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s10878-016-0044-6","volume":"35","author":"X Zhang","year":"2018","unstructured":"Zhang, X., Xu, D., Du, D., Wu, C.: Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J. Comb. Optim. 35, 318\u2013330 (2018)","journal-title":"J. Comb. Optim."},{"key":"245_CR13","doi-asserted-by":"crossref","unstructured":"Zheng, X., Zhang, H., Liu, X.: Randomized rounding algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties. In Proceedings of the 2024 China Automation Congress (CAC), Qingdao, China, pp. 4840-4844 (2024)","DOI":"10.1109\/CAC63892.2024.10864832"},{"issue":"2","key":"245_CR14","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s40305-022-00430-8","volume":"12","author":"H Zheng","year":"2024","unstructured":"Zheng, H., Gao, S., Liu, W., Hou, B.: An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties. J. Oper. Res. Soc. China 12(2), 495\u2013504 (2024)","journal-title":"J. Oper. Res. Soc. China"}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00245-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-025-00245-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-025-00245-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T09:00:08Z","timestamp":1770627608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-025-00245-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,25]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["245"],"URL":"https:\/\/doi.org\/10.1007\/s42514-025-00245-y","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"value":"2524-4922","type":"print"},{"value":"2524-4930","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,25]]},"assertion":[{"value":"25 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no financial or proprietary interests in any material discussed in this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}