{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:32:16Z","timestamp":1753882336193,"version":"3.41.2"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071417"],"award-info":[{"award-number":["12071417"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p> We are given a set of [Formula: see text] identical parallel machines and a set of [Formula: see text] jobs in large computing systems, where each job [Formula: see text] consists of a bag of [Formula: see text] identical tasks with a processing time [Formula: see text], and has a rejection penalty [Formula: see text]. Job [Formula: see text] is either accepted in which case all the [Formula: see text] tasks must be processed by one of the machines, or rejected which incurs a rejection penalty [Formula: see text]. The problem of bag-of-tasks scheduling with rejection is to find a feasible schedule, so as to minimize the makespan plus the total rejection penalty of all rejected jobs. In this paper, we present a polynomial time approximation scheme. <\/jats:p>","DOI":"10.1142\/s0217595923400110","type":"journal-article","created":{"date-parts":[[2023,3,17]],"date-time":"2023-03-17T06:53:12Z","timestamp":1679035992000},"source":"Crossref","is-referenced-by-count":1,"title":["Bag-of-Tasks Scheduling with Rejection in Large Computing Systems"],"prefix":"10.1142","volume":"40","author":[{"given":"Weidong","family":"Li","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Yunnan University, Kunming 650504, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"issue":"1","key":"S0217595923400110BIB001","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"Alon N","year":"1998","journal-title":"Journal of Scheduling"},{"issue":"1","key":"S0217595923400110BIB002","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Bartal Y","year":"2000","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"S0217595923400110BIB003","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0377-2217(99)00261-1","volume":"123","author":"Caprara A","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"S0217595923400110BIB004","doi-asserted-by":"crossref","first-page":"3025","DOI":"10.1007\/s00453-019-00566-9","volume":"81","author":"Kones I","year":"2019","journal-title":"Algorithmica"},{"key":"S0217595923400110BIB006","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.tcs.2015.10.007","volume":"607","author":"Li W","year":"2015","journal-title":"Theoretical Computer Science"},{"key":"S0217595923400110BIB007","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.jpdc.2018.10.013","volume":"124","author":"Li W","year":"2019","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"3","key":"S0217595923400110BIB008","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"Ou J","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"S0217595923400110BIB009","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"Shabtay D","year":"2013","journal-title":"Journal of Scheduling"},{"issue":"6","key":"S0217595923400110BIB010","doi-asserted-by":"crossref","first-page":"1633","DOI":"10.1109\/TPDS.2015.2456020","volume":"27","author":"Tarplee KM","year":"2016","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"S0217595923400110BIB011","doi-asserted-by":"crossref","first-page":"111123","DOI":"10.1016\/j.jss.2021.111123","volume":"184","author":"Yin L","year":"2022","journal-title":"Journal of Systems and Software"},{"issue":"2","key":"S0217595923400110BIB012","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s00607-021-00962-6","volume":"104","author":"Zhang J","year":"2022","journal-title":"Computing"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595923400110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T07:03:55Z","timestamp":1693465435000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0217595923400110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,27]]},"references-count":11,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10.1142\/S0217595923400110"],"URL":"https:\/\/doi.org\/10.1142\/s0217595923400110","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"type":"print","value":"0217-5959"},{"type":"electronic","value":"1793-7019"}],"subject":[],"published":{"date-parts":[[2023,5,27]]},"article-number":"2340011"}}