{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T08:28:14Z","timestamp":1777364894435,"version":"3.51.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T00:00:00Z","timestamp":1452556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10288-016-0304-4","type":"journal-article","created":{"date-parts":[[2016,1,12]],"date-time":"2016-01-12T06:11:55Z","timestamp":1452579115000},"page":"165-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Parallel-machine scheduling with release dates and rejection"],"prefix":"10.1007","volume":"14","author":[{"given":"Liqi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,12]]},"reference":[{"key":"304_CR1","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal Y, Leonardi S, Spaccamela AM, Sgall J, Stougie L (2000) Multi-processor scheduling with rejection. SIAM J Discret Math 13:64\u201378","journal-title":"SIAM J Discret Math"},{"key":"304_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 Oper Res 194:18\u201327","journal-title":"Eur J Oper Res"},{"key":"304_CR3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10878-006-9003-y","volume":"12","author":"G Dosa","year":"2006","unstructured":"Dosa G, He Y (2006) Scheduling with machine cost and rejection. J Comb Optim 12:337\u2013350","journal-title":"J Comb Optim"},{"key":"304_CR4","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":"304_CR5","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:415\u2013420","journal-title":"Oper Res Lett"},{"key":"304_CR6","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 94:361\u2013374","journal-title":"Math Program"},{"key":"304_CR7","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler EL (1973) Optimal sequencing a single machine subject to precedence constraints. Manag Sci 19:544\u2013546","journal-title":"Manag Sci"},{"key":"304_CR8","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":"304_CR9","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 JJ (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:593\u2013598","journal-title":"Inf Process Lett"},{"key":"304_CR10","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"S Seiden","year":"2001","unstructured":"Seiden S (2001) Preemptive multiprocessor scheduling with rejection. Theor Comput Sci 262:437\u2013458","journal-title":"Theor Comput Sci"},{"key":"304_CR11","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 off-line scheduling with rejection. J Sched 16:3\u201328","journal-title":"J Sched"},{"key":"304_CR12","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:1504\u20131511","journal-title":"Oper Res"},{"key":"304_CR13","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"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0304-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-016-0304-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0304-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:13:00Z","timestamp":1559117580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-016-0304-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,12]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["304"],"URL":"https:\/\/doi.org\/10.1007\/s10288-016-0304-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,12]]}}}