{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:12:54Z","timestamp":1767211974541},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T00:00:00Z","timestamp":1641254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T00:00:00Z","timestamp":1641254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00842-x","type":"journal-article","created":{"date-parts":[[2022,1,4]],"date-time":"2022-01-04T12:02:41Z","timestamp":1641297761000},"page":"343-353","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties"],"prefix":"10.1007","volume":"44","author":[{"given":"Hongye","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Suogang","family":"Gao","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":"Bo","family":"Hou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,4]]},"reference":[{"key":"842_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall JSL (2000) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13:64\u201378","journal-title":"SIAM J Discrete Math"},{"issue":"3","key":"842_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01111739","volume":"12","author":"C Chenier","year":"1995","unstructured":"Chenier C, Urrutia J, Zaguia N (1995) Scheduling tasks with communication delays on parallel processors. Order 12(3):213\u2013220","journal-title":"Order"},{"key":"842_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0166-218X(02)00458-4","volume":"131","author":"L Fleicher","year":"2003","unstructured":"Fleicher L, Iwata S (2003) A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Appl Math 131:311\u2013322","journal-title":"Discrete Appl Math"},{"key":"842_CR4","volume-title":"Submodular functions and optimization","author":"S Fujishige","year":"2005","unstructured":"Fujishige S (2005) Submodular functions and optimization, 2nd edn. Elsevier, Amsterdam","edition":"2"},{"issue":"9","key":"842_CR5","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45(9):1563\u20131581","journal-title":"Bell Syst Tech J"},{"key":"842_CR6","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S Iwata","year":"2001","unstructured":"Iwata S, Fleischer L, Fujishige S (2001) A combinatorial strongly polynomial algorithm for minimizing submodular finction. J ACM 48:761\u2013777","journal-title":"J ACM"},{"key":"842_CR7","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler EL (1973) Optimal sequencing a single machine subject to precedence constraints. Manag Sci 19:544\u2013546","journal-title":"Manag Sci"},{"key":"842_CR8","doi-asserted-by":"crossref","unstructured":"Leutenegger ST, Vernon MK (1990) The performance of multiprogrammed multiprocessor scheduling algorithms. In: Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems, pp 226\u2013236","DOI":"10.1145\/98460.98761"},{"key":"842_CR9","doi-asserted-by":"publisher","first-page":"133","DOI":"10.3390\/math8010133","volume":"8","author":"X Liu","year":"2020","unstructured":"Liu X, Li W (2020) Approximation algorithm for the single machine scheduling problem with release dates and submodular rejection penalty. Mathematics 8:133","journal-title":"Mathematics"},{"key":"842_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01724-1","author":"X Liu","year":"2021","unstructured":"Liu X, Li W (2021) Approximation algorithms for the multiprocessor scheduling with submodular penalties. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-021-01724-1","journal-title":"Optim Lett"},{"key":"842_CR11","first-page":"235","volume-title":"Mathematical programing the state of the art","author":"L Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz L (1983) Submodular functions and convexity. In: Bachm A, Grtschel M, Korte B (eds) Mathematical programing the state of the art. Springer, Berlin, pp 235\u2013237"},{"key":"842_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay D, Gaspar N, Kaspi M (2013) A survey on offline scheduling with rejection. J Sched 16:3\u201328","journal-title":"J Sched"},{"key":"842_CR13","doi-asserted-by":"publisher","first-page":"382","DOI":"10.3390\/math7050382","volume":"7","author":"YN Sotskov","year":"2019","unstructured":"Sotskov YN, Egorova NG (2019) The optimality region for a single-machine scheduling problem with bounded durations of the jobs and the total completion time objective. Mathematics 7:382","journal-title":"Mathematics"},{"key":"842_CR14","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 (2016) Approximation algorithms for submodular vertex cover problems with linear\/submodular penalties using primal-dual technique. Theor Comput Sci 630:117\u2013125","journal-title":"Theor Comput Sci"},{"key":"842_CR15","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","volume":"14","author":"L Zhang","year":"2016","unstructured":"Zhang L, Lu L (2016) Parallel-machine scheduling with release dates and rejection. 4OR 14:165\u2013172","journal-title":"4OR"},{"issue":"1","key":"842_CR16","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 (2018) Approximation algorithms for precedence-constrained identical machine scheduling with rejection. J Comb Optim 35(1):318\u2013330","journal-title":"J Comb Optim"},{"issue":"3","key":"842_CR17","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1007\/s10878-016-0016-x","volume":"33","author":"X Zhong","year":"2017","unstructured":"Zhong X, Pan Z, Jiang D (2017) Scheduling with release times and rejection on two parallel machines. J Comb Optim 33(3):934\u2013944","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00842-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00842-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00842-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:30:56Z","timestamp":1659079856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00842-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["842"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00842-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,4]]},"assertion":[{"value":"21 December 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}