{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:54:46Z","timestamp":1781463286087,"version":"3.54.1"},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003787","name":"Hebei Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003787","name":"Hebei Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.04.046","type":"journal-article","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T13:06:02Z","timestamp":1778504762000},"page":"122-126","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Approximation algorithm for the W-prize-collecting scheduling problem on a single machine with release dates and rejection"],"prefix":"10.1016","volume":"391","author":[{"given":"Tianjiao","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gengsheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.dam.2026.04.046_b1","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","article-title":"Multiprocessor scheduling with rejection","volume":"13","author":"Bartal","year":"2000","journal-title":"SIAM J. Discret. Math."},{"issue":"9","key":"10.1016\/j.dam.2026.04.046_b2","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/j.dam.2026.04.046_b3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"10.1016\/j.dam.2026.04.046_b4","first-page":"207","article-title":"An approximation algorithm for P-prize-collecting set cover problem","volume":"11","author":"Guo","year":"2023","journal-title":"J. Oper. Res. Soc. China"},{"key":"10.1016\/j.dam.2026.04.046_b5","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s11590-017-1135-8","article-title":"A 5-approximation algorithm for the k-prize-collecting steiner tree problem","volume":"13","author":"Han","year":"2017","journal-title":"Optim. Lett."},{"key":"10.1016\/j.dam.2026.04.046_b6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10288-016-0303-5","article-title":"Improved algorithms for single machine scheduling with release dates and rejections","volume":"14","author":"He","year":"2016","journal-title":"4OR"},{"key":"10.1016\/j.dam.2026.04.046_b7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/s10878-024-01212-z","article-title":"W-Prize-collecting scheduling problem on parallel machines","volume":"48","author":"Hou","year":"2024","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2026.04.046_b8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.tcs.2020.07.014","article-title":"An approximation algorithm for the k-prize-collecting multicut on a tree problem","volume":"844","author":"Hou","year":"2020","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.04.046_b9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.3390\/math8010133","article-title":"Approximation algorithm for the single machine scheduling problem with release dates and submodular rejection penalty","volume":"8","author":"Liu","year":"2020","journal-title":"Mathematics"},{"key":"10.1016\/j.dam.2026.04.046_b10","doi-asserted-by":"crossref","first-page":"2373","DOI":"10.1007\/s11590-021-01831-z","article-title":"A primal\u2013dual approximation algorithm for the k-prize-collecting minimum power cover problem","volume":"16","author":"Liu","year":"2022","journal-title":"Opt. Lett."},{"issue":"3","key":"10.1016\/j.dam.2026.04.046_b11","doi-asserted-by":"crossref","DOI":"10.1007\/s11704-022-1665-9","article-title":"A prime-dual approximation algorithm for the k-prize-collecting minimum vertex cover problem with submodular penalties","volume":"17","author":"Liu","year":"2023","journal-title":"Front. Comput. Sci."},{"key":"10.1016\/j.dam.2026.04.046_b12","doi-asserted-by":"crossref","unstructured":"R. Sun, B. Deng, W-prize-collecting scheduling problem on a single machine, in: Proceedings of the 2022 6th International Conference on Computer Science and Artificial Intelligence, 2022, pp. 237\u2013242.","DOI":"10.1145\/3577530.3577568"},{"key":"10.1016\/j.dam.2026.04.046_b13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.3390\/math10010061","article-title":"Combinatorial 2-approximation algorithm for the parallel-machine scheduling with release times and submodular penalties","volume":"10","author":"Wang","year":"2022","journal-title":"Mathematics"},{"key":"10.1016\/j.dam.2026.04.046_b14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","article-title":"Parallel-machine scheduling with release dates and rejection","volume":"14","author":"Zhang","year":"2016","journal-title":"4OR"},{"key":"10.1016\/j.dam.2026.04.046_b15","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","article-title":"Single machine scheduling with release dates and rejection","volume":"198","author":"Zhang","year":"2009","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.dam.2026.04.046_b16","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10878-021-00842-x","article-title":"Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties","volume":"44","author":"Zheng","year":"2022","journal-title":"J. Comb. Optim."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002726?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002726?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:06:19Z","timestamp":1781460379000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":16,"alternative-id":["S0166218X26002726"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.046","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximation algorithm for the -prize-collecting scheduling problem on a single machine with release dates and rejection","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.046","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}