{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T22:34:11Z","timestamp":1777415651416,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,11]],"date-time":"2015-02-11T00:00:00Z","timestamp":1423612800000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10878-015-9836-3","type":"journal-article","created":{"date-parts":[[2015,2,10]],"date-time":"2015-02-10T06:42:01Z","timestamp":1423550521000},"page":"1493-1504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["New results on two-machine flow-shop scheduling with rejection"],"prefix":"10.1007","volume":"31","author":[{"given":"Liqi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Shisheng","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,11]]},"reference":[{"key":"9836_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) Multiprocessor scheduling with rejection. SIAM J Discret Math 13:64\u201378","journal-title":"SIAM J Discret Math"},{"key":"9836_CR2","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s11424-007-9050-1","volume":"20","author":"ZG Cao","year":"2007","unstructured":"Cao ZG, Zhang YZ (2007) Scheduling with rejection and non-identical job arrivals. J Syst Sci Complex 20:529\u2013535","journal-title":"J Syst Sci Complex"},{"key":"9836_CR3","doi-asserted-by":"crossref","unstructured":"Chen B, Woeginger GJ (1995) A study of on-line seheduling two-stage shops. In: Du D-Z, Pardalos PM (eds), Minimax and applications. (pp 97\u2013107)","DOI":"10.1007\/978-1-4613-3557-3_6"},{"key":"9836_CR4","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejor.2011.03.017","volume":"213","author":"BC Choi","year":"2011","unstructured":"Choi BC, Chung J (2011) Two-machine flow shop scheduling problem with an outsourcing option. Eur J Oper Res 213:66\u201372","journal-title":"Eur J Oper Res"},{"key":"9836_CR5","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":"9836_CR6","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":"9836_CR7","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":"9836_CR8","volume-title":"Computers and intractablity: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractablity: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9836_CR9","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":"9836_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two-and-three-stage production schedules with set-up times included. Naval Res Logist Quat 1:61\u201368","journal-title":"Naval Res Logist Quat"},{"key":"9836_CR11","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":"9836_CR12","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) Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost. Inf Proces Lett 113:593\u2013598","journal-title":"Inf Proces Lett"},{"key":"9836_CR13","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":"9836_CR14","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1016\/j.cor.2011.05.023","volume":"39","author":"D Shabtay","year":"2012","unstructured":"Shabtay D, Gaspar N (2012) Two-machine flow-shop scheduling with rejection. Comput & Oper Res 39:1087\u20131096","journal-title":"Comput & Oper Res"},{"key":"9836_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:3\u201328","journal-title":"J Sched"},{"key":"9836_CR16","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"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9836-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9836-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9836-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:25Z","timestamp":1559262205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9836-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,11]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9836"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9836-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,11]]}}}