{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T10:57:38Z","timestamp":1768733858570,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11871213"],"award-info":[{"award-number":["11871213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10878-020-00642-9","type":"journal-article","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T21:18:51Z","timestamp":1598995131000},"page":"929-952","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["New approximation algorithms for machine scheduling with rejection on single and parallel machine"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3963-1526","authenticated-orcid":false,"given":"Peihai","family":"Liu","sequence":"first","affiliation":[]},{"given":"Xiwen","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,1]]},"reference":[{"issue":"1","key":"642_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(1):64\u201378","journal-title":"SIAM J Discrete Math"},{"key":"642_CR2","doi-asserted-by":"crossref","unstructured":"Cao Z, Wang Z, Zhang Y, Liu S (2006) On several scheduling problems with rejection or discretely compressible processing times. In: Cai JY, Cooper S, Li A (eds) Theory and applications of models of computation, vol 3959. Lecture notes in computer science. Springer, Berlin, pp 90\u201398","DOI":"10.1007\/11750321_8"},{"issue":"6","key":"642_CR3","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1016\/j.cor.2010.09.018","volume":"39","author":"B Cesaret","year":"2012","unstructured":"Cesaret B, Oguz C, Salman FS (2012) A Tabu search algorithm for order acceptance and scheduling. Comput Oper Res 39(6):1197\u20131205","journal-title":"Comput Oper Res"},{"issue":"1","key":"642_CR4","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ejor.2007.11.047","volume":"194","author":"Y Cheng","year":"2009","unstructured":"Cheng Y, Sun S (2009) Scheduling linear deteriorating jobs with rejection on a single machine. Eur J Oper Res 194(1):18\u201327","journal-title":"Eur J Oper Res"},{"issue":"1","key":"642_CR5","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"DW Engels","year":"2003","unstructured":"Engels DW, Karger DR, Kolliopoulos SG, Sengupta S, Uma R, Wein J (2003) Techniques for scheduling with rejection. J Algorithms 49(1):175\u2013191","journal-title":"J Algorithms"},{"issue":"6","key":"642_CR6","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"L Epstein","year":"2002","unstructured":"Epstein L, Noga J, Woeginger GJ (2002) On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper Res Lett 30(6):415\u2013420","journal-title":"Oper Res Lett"},{"issue":"1","key":"642_CR7","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 JYT, Lee K, Pinedo ML (2016) Improved algorithms for single machine scheduling with release dates and rejections. 4OR-Q J Oper Res 14(1):41\u201355","journal-title":"4OR-Q J Oper Res"},{"issue":"2\u20133","key":"642_CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H Hoogeveen","year":"2003","unstructured":"Hoogeveen H, Skutella M, Woeginger GJ (2003) Preemptive scheduling with rejection. Math Program Ser B 94(2\u20133):361\u2013374","journal-title":"Math Program Ser B"},{"issue":"2","key":"642_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.ijpe.2010.12.003","volume":"130","author":"L Lu","year":"2011","unstructured":"Lu L, Ng C, Zhang L (2011) Optimal algorithms for single-machine scheduling with rejection to minimize the makespan. Int J Prod Econ 130(2):153\u2013158","journal-title":"Int J Prod Econ"},{"issue":"1","key":"642_CR10","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.ipl.2013.05.006","volume":"113","author":"R Ma","year":"2013","unstructured":"Ma R, Yuan J (2013) On-line scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost. Inf Process Lett 113(1):593\u2013598","journal-title":"Inf Process Lett"},{"issue":"3","key":"642_CR11","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou J, Zhong X, Wang G (2015) An improved heuristic for parallel machine scheduling with rejection. Eur J Oper Res 241(3):653\u2013661","journal-title":"Eur J Oper Res"},{"issue":"8","key":"642_CR12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ipl.2016.02.008","volume":"116","author":"J Ou","year":"2016","unstructured":"Ou J, Zhong X, Li CL (2016) Faster algorithms for single machine scheduling with release dates and rejection. Inf Process Lett 116(8):503\u2013507","journal-title":"Inf Process Lett"},{"issue":"1\u20132","key":"642_CR13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"SS Seiden","year":"2001","unstructured":"Seiden SS (2001) Preemptive multiprocessor scheduling with rejection. Theor Comput Sci 262(1\u20132):437\u2013458","journal-title":"Theor Comput Sci"},{"key":"642_CR14","doi-asserted-by":"crossref","unstructured":"Sengupta S (2003) Algorithms and approximation schemes for minimum lateness\/tardiness scheduling with rejection. In: Dehne F, Sack JR, Smid M (eds) Algorithms and data structures, vol 2748. Lecture notes in computer science. Springer, Berlin, pp 79\u201390","DOI":"10.1007\/978-3-540-45078-8_8"},{"issue":"1","key":"642_CR15","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(1):3\u201328","journal-title":"J Sched"},{"issue":"1","key":"642_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):1\u201311","journal-title":"Eur J Oper Res"},{"issue":"6","key":"642_CR17","doi-asserted-by":"crossref","first-page":"1504","DOI":"10.1287\/opre.1110.0948","volume":"59","author":"G Steiner","year":"2011","unstructured":"Steiner G, Zhang R (2011) Revised delivery-time quotation in scheduling with tardiness penalties. Oper Res 59(6):1504\u20131511","journal-title":"Oper Res"},{"issue":"2","key":"642_CR18","doi-asserted-by":"crossref","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-Q J Oper Res 14(2):165\u2013172","journal-title":"4OR-Q J Oper Res"},{"issue":"3","key":"642_CR19","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"L Zhang","year":"2009","unstructured":"Zhang L, Lu L, Yuan J (2009) Single machine scheduling with release dates and rejection. Eur J Oper Res 198(3):975\u2013978","journal-title":"Eur J Oper Res"},{"issue":"4","key":"642_CR20","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10288-016-0339-6","volume":"15","author":"X Zhong","year":"2017","unstructured":"Zhong X, Ou J (2017) Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR-Q J Oper Res 15(4):387\u2013406","journal-title":"4OR-Q J Oper Res"},{"issue":"3","key":"642_CR21","doi-asserted-by":"crossref","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-020-00642-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00642-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00642-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T01:07:19Z","timestamp":1630458439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00642-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,1]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["642"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00642-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,1]]},"assertion":[{"value":"1 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}