{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T14:25:34Z","timestamp":1787063134854,"version":"build-2736575974"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T00:00:00Z","timestamp":1482105600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71101064"],"award-info":[{"award-number":["71101064"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71501051"],"award-info":[{"award-number":["71501051"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Humanities and Social Sciences Research Foundation of Ministry of Education of China","award":["13YJC630239"],"award-info":[{"award-number":["13YJC630239"]}]},{"name":"Foundation for Distinguished Young Teachers in Higher Education of Guangdong Province","award":["YQ201403"],"award-info":[{"award-number":["YQ201403"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10288-016-0339-6","type":"journal-article","created":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T06:39:50Z","timestamp":1482129590000},"page":"387-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Improved approximation algorithms for parallel machine scheduling with release dates and job rejection"],"prefix":"10.1007","volume":"15","author":[{"given":"Xueling","family":"Zhong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jinwen","family":"Ou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,12,19]]},"reference":[{"key":"339_CR1","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonardi S, Marchetti-Spaccamela A, Sgall J, Stougie L (2000) Multiprocessor scheduling with rejection. SIAM J Discrete Math 13:64\u201378","journal-title":"SIAM J Discrete Math"},{"key":"339_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0167-6377(97)00040-0","volume":"21","author":"B Chen","year":"1997","unstructured":"Chen B, Vestjens APA (1997) Scheduling on identical machines: how good is LPT in an on-line setting? Oper Res Lett 21:165\u2013169","journal-title":"Oper Res Lett"},{"key":"339_CR3","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s00453-007-9086-6","volume":"51","author":"AV Fishkin","year":"2008","unstructured":"Fishkin AV, Jansen K, Mastrolilli M (2008) Grouping techniques for scheduling problems: simpler and faster. Algorithmica 51:183\u2013199","journal-title":"Algorithmica"},{"key":"339_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(84)90035-X","volume":"5","author":"D Gusfield","year":"1984","unstructured":"Gusfield D (1984) Bounds for naive multiple machine scheduling with release times and deadlines. J Algorithms 5:1\u20136","journal-title":"J Algorithms"},{"key":"339_CR5","doi-asserted-by":"crossref","unstructured":"Hall LA, Shmoys DB (1989) Approximation schemes for constrained scheduling problems. In: Proceedings of the 30th annual IEEE symposium on foundations of computer science, pp 134\u2013139","DOI":"10.1109\/SFCS.1989.63468"},{"key":"339_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10288-016-0303-5","volume":"14","author":"C He","year":"2016","unstructured":"He C, Leung JY-T, Lee K, Pinedo ML (2016) Improved algorithms for single machine scheduling with release dates and rejections. 4OR Q J Oper Res 14:41\u201355","journal-title":"4OR Q J Oper Res"},{"key":"339_CR7","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra HW Jr (1983) Integer programming with a fixed number of variables. Math Oper Res 8:538\u2013548","journal-title":"Math Oper Res"},{"key":"339_CR8","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1016\/j.ejor.2009.02.011","volume":"200","author":"C-L Li","year":"2010","unstructured":"Li C-L, Wang XL (2010) Scheduling parallel machines with inclusive processing set restrictions and job release times. Eur J Oper Res 200:702\u2013710","journal-title":"Eur J Oper Res"},{"key":"339_CR9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.tcs.2015.10.007","volume":"607","author":"WD Li","year":"2015","unstructured":"Li WD, Li JP, Zhang XJ, Chen ZB (2015) Penalty cost constrained identical parallel machine scheduling problem. Theor Comput Sci 607:181\u2013192","journal-title":"Theor Comput Sci"},{"key":"339_CR10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1023\/A:1026272526225","volume":"6","author":"M Mastrolilli","year":"2003","unstructured":"Mastrolilli M (2003) Efficient approximation schemes for scheduling problems with release dates and delivery times. J Sched 6:521\u2013531","journal-title":"J Sched"},{"key":"339_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-016-2277-2","author":"JW Ou","year":"2016","unstructured":"Ou JW, Zhong XL (2016) Order acceptance and scheduling with consideration of service level. Ann Oper Res. doi:\n                        10.1007\/s10479-016-2277-2","journal-title":"Ann Oper Res"},{"key":"339_CR12","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"JW Ou","year":"2015","unstructured":"Ou JW, Zhong XL, Wang GQ (2015) An improved heuristic for parallel machine scheduling with rejection. Eur J Oper Res 241:653\u2013661","journal-title":"Eur J Oper Res"},{"key":"339_CR13","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ipl.2016.02.008","volume":"116","author":"JW Ou","year":"2016","unstructured":"Ou JW, Zhong XL, Li C-L (2016) Faster algorithms for single machine scheduling with release dates and rejection. Inf Process Lett 116:503\u2013507","journal-title":"Inf Process Lett"},{"key":"339_CR14","doi-asserted-by":"crossref","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":"339_CR15","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D Shmoys","year":"1993","unstructured":"Shmoys D, Tardos E (1993) An approximation algorithm for the generalized assignment problem. Math Program 62:461\u2013474","journal-title":"Math Program"},{"key":"339_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick SA (2011) Order acceptance and scheduling: a taxonomy and review. Eur J Oper Res 212:1\u201311","journal-title":"Eur J Oper Res"},{"key":"339_CR17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","volume":"14","author":"LQ Zhang","year":"2016","unstructured":"Zhang LQ, Lu LF (2016) Parallel-machine scheduling with release dates and rejection. 4OR Q J Oper Res 14:165\u2013172","journal-title":"4OR Q J Oper Res"},{"key":"339_CR18","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"LQ Zhang","year":"2009","unstructured":"Zhang LQ, Lu LF, Yuan JJ (2009) Single machine scheduling with release dates and rejection. Eur J Oper Res 198:975\u2013978","journal-title":"Eur J Oper Res"},{"key":"339_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0016-x","author":"XL Zhong","year":"2016","unstructured":"Zhong XL, Pan ZM, Jiang DK (2016) Scheduling with release times and rejection on two parallel machines. J Comb Optim. doi:\n                        10.1007\/s10878-016-0016-x","journal-title":"J Comb Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-016-0339-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0339-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0339-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T07:47:37Z","timestamp":1589701657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-016-0339-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,19]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["339"],"URL":"https:\/\/doi.org\/10.1007\/s10288-016-0339-6","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,19]]}}}