{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:31:25Z","timestamp":1767339085228},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"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":[[2024,9]]},"DOI":"10.1007\/s11590-023-02073-x","type":"journal-article","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T07:02:31Z","timestamp":1698649351000},"page":"1747-1754","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties"],"prefix":"10.1007","volume":"18","author":[{"given":"Bo","family":"Hou","sequence":"first","affiliation":[]},{"given":"Hongye","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Wen","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Ding-Zhu","family":"Du","sequence":"additional","affiliation":[]},{"given":"Suogang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,30]]},"reference":[{"key":"2073_CR1","volume-title":"Scheduling of Multi-job Customer Orders in Multi-machine Environments","author":"R Ahmadi","year":"1990","unstructured":"Ahmadi, R., Bagchi, U.: Scheduling of Multi-job Customer Orders in Multi-machine Environments. ORSA\/TIMS, Philadelphia (1990)"},{"key":"2073_CR2","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1007\/s10878-020-00649-2","volume":"40","author":"R Chen","year":"2020","unstructured":"Chen, R., Li, S.: Minimizing maximum delivery completion time for order scheduling with rejection. J. Comb. Optim. 40, 1044\u20131064 (2020)","journal-title":"J. Comb. Optim."},{"issue":"1\u20132","key":"2073_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","volume":"63","author":"D Du","year":"2012","unstructured":"Du, D., Lu, R., Xu, D.: A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica 63(1\u20132), 191\u2013200 (2012)","journal-title":"Algorithmica"},{"key":"2073_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"},{"issue":"5","key":"2073_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","volume":"8","author":"JYT Leung","year":"2005","unstructured":"Leung, J.Y.T., Li, H., Pinedo, M.: Order scheduling in an environment with dedicated resources in parallel. J. Sched. 8(5), 355\u2013386 (2005)","journal-title":"J. Sched."},{"issue":"2","key":"2073_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":"2073_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.3390\/math8010133","volume":"8","author":"X Liu","year":"2020","unstructured":"Liu, X., Li, W.: Approximation algorithm for the single machine scheduling problem with release dates and submodular rejection penalty. Mathematics 8, 133 (2020)","journal-title":"Mathematics"},{"key":"2073_CR8","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1007\/s11590-021-01724-1","volume":"15","author":"X Liu","year":"2021","unstructured":"Liu, X., Li, W.: Approximation algorithms for the multiprocessor scheduling with submodular penalties. Optim. Lett. 15, 2165\u20132180 (2021)","journal-title":"Optim. Lett."},{"key":"2073_CR9","first-page":"235","volume-title":"Mathematical Programing the State of the Art","author":"L Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Bachm, A., Grtschel, M., Korte, B. (eds.) Mathematical Programing the State of the Art, pp. 235\u2013237. Springer, Berlin (1983)"},{"key":"2073_CR10","doi-asserted-by":"publisher","first-page":"61","DOI":"10.3390\/math10010061","volume":"10","author":"W Wang","year":"2022","unstructured":"Wang, W., Liu, X.: Combinatorial 2-Approximation algorithm for the parallel-machine scheduling with release times and submodular penalties. Mathematics 10, 61 (2022)","journal-title":"Mathematics"},{"key":"2073_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2016.04.005","volume":"630","author":"D Xu","year":"2016","unstructured":"Xu, D., Wang, F., Du, D., Wu, C.: Approximation algorithms for submodular vertex cover problems with linear\/submodular penalties using primal-dual technique. Theor. Comput. Sci. 630, 117\u2013125 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"2073_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(1), 318\u2013330 (2018)","journal-title":"J. Comb. Optim."},{"key":"2073_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-022-00430-8","author":"H Zheng","year":"2022","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 (2022). https:\/\/doi.org\/10.1007\/s40305-022-00430-8","journal-title":"J. Oper. Res. Soc. China"},{"key":"2073_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10878-021-00842-x","volume":"44","author":"H Zheng","year":"2022","unstructured":"Zheng, H., Gao, S., Liu, W., Wu, W., Du, D., Hou, B.: Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties. J. Comb. Optim. 44, 343\u2013353 (2022)","journal-title":"J. Comb. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02073-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02073-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02073-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T04:17:56Z","timestamp":1724905076000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02073-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,30]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["2073"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02073-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,10,30]]},"assertion":[{"value":"30 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}