{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T04:21:22Z","timestamp":1770697282689,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T00:00:00Z","timestamp":1466035200000},"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":["11531014"],"award-info":[{"award-number":["11531014"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (CA)","doi-asserted-by":"publisher","award":["283106"],"award-info":[{"award-number":["283106"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11501412"],"award-info":[{"award-number":["11501412"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-016-0044-6","type":"journal-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T12:57:05Z","timestamp":1466081825000},"page":"318-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Approximation algorithms for precedence-constrained identical machine scheduling with rejection"],"prefix":"10.1007","volume":"35","author":[{"given":"Xianzhao","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dachuan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,16]]},"reference":[{"key":"44_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 Discret Math 13:64\u201378","journal-title":"SIAM J Discret Math"},{"key":"44_CR2","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ejor.2007.11.047","volume":"194","author":"YS Cheng","year":"2009","unstructured":"Cheng YS, Sun SJ (2009) Scheduling linear deteriorating jobs with rejection on a single machine. Eur J Op Res 194:18\u201327","journal-title":"Eur J Op Res"},{"key":"44_CR3","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 RN, Wein J (2003) Techniques for scheduling with rejection. J Algorithms 49:175\u2013191","journal-title":"J Algorithms"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"6666","DOI":"10.1016\/j.tcs.2011.08.031","volume":"412","author":"L Epstein","year":"2011","unstructured":"Epstein L, Haider HZ (2011) Online scheduling with rejection and withdrawal. Theor Comput Sci 412:6666\u20136674","journal-title":"Theor Comput Sci"},{"key":"44_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10951-013-0326-0","volume":"17","author":"L Epstein","year":"2014","unstructured":"Epstein L, Haider HZ (2014) Preemptive online scheduling with rejection of unit jobs on two uniformly related machines. J Sched 17:87\u201393","journal-title":"J Sched"},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/j.ipl.2012.06.009","volume":"112","author":"E Gerstl","year":"2012","unstructured":"Gerstl E, Mosheiov G (2012) Scheduling on parallel identical machines with job-rejection and position-dependent processing times. Inf Process Lett 112:743\u2013747","journal-title":"Inf Process Lett"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Hanen C, Munier A (1995) An approximation algorithm for scheduling dependent tasks on $$m$$ m processors with small communication delays. In: Proceedings of the INREA\/IEEE symposium on emerging technologies and factory automation, pp 167\u2013190","DOI":"10.1109\/ETFA.1995.496773"},{"key":"44_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00021409","volume":"65","author":"Y He","year":"2000","unstructured":"He Y, Min X (2000) On-line uniform machine scheduling with rejection. Computing 65:1\u201312","journal-title":"Computing"},{"key":"44_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-6377(94)90024-8","volume":"16","author":"JA Hoogeveen","year":"1994","unstructured":"Hoogeveen JA, Lenstra JK, Veltman B (1994) Three, four, five, six, or the complexity of scheduling with communication delays. Op Res Lett 16:129\u2013137","journal-title":"Op Res Lett"},{"key":"44_CR10","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 Progr Ser B 94:361\u2013374","journal-title":"Math Progr Ser B"},{"key":"44_CR11","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1287\/opre.9.3.296","volume":"9","author":"J Kelley","year":"1961","unstructured":"Kelley J (1961) Critical-path planning and scheduling: mathematical basis. Op Res 9:296\u2013320","journal-title":"Op Res"},{"key":"44_CR12","doi-asserted-by":"crossref","first-page":"3642","DOI":"10.1016\/j.tcs.2010.06.008","volume":"411","author":"SS Li","year":"2010","unstructured":"Li SS, Yuan JJ (2010) Parallel-machine scheduling with deteriorating jobs and rejection. Theor Comput Sci 411:3642\u20133650","journal-title":"Theor Comput Sci"},{"key":"44_CR13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.ijpe.2010.12.003","volume":"130","author":"LF Lu","year":"2011","unstructured":"Lu LF, Ng CT, Zhang LQ (2011) Optimal algorithms for single-machine scheduling with rejection to minimize the makespan. Int J Prod Econ 130:153\u2013158","journal-title":"Int J Prod Econ"},{"key":"44_CR14","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/s10878-011-9435-x","volume":"26","author":"X Min","year":"2013","unstructured":"Min X, Wang YQ, Liu J, Jiang M (2013) Semi-online scheduling on two identical machines with rejection. J Comb Optim 26:472\u2013479","journal-title":"J Comb Optim"},{"key":"44_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.45.1.145","volume":"45","author":"A Munier","year":"1997","unstructured":"Munier A, Konig J (1997) A heuristic for a scheduling problem with communication delays. Op Res 45:145\u2013147","journal-title":"Op Res"},{"key":"44_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0166-218X(94)00063-J","volume":"60","author":"C Picouleau","year":"1995","unstructured":"Picouleau C (1995) New complexity results on scheduling with small communication delays. Discr Appl Math 60:331\u2013342","journal-title":"Discr Appl Math"},{"key":"44_CR17","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:437\u2013458","journal-title":"Theor Comput Sci"},{"key":"44_CR18","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":"44_CR19","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 Op Res 212:1\u201311","journal-title":"Eur J Op Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0044-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0044-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0044-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0044-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T20:34:15Z","timestamp":1656707655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0044-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,16]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["44"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0044-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,16]]}}}