{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T21:10:29Z","timestamp":1768770629681,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T00:00:00Z","timestamp":1436918400000},"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":["OR Spectrum"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00291-015-0409-8","type":"journal-article","created":{"date-parts":[[2015,7,14]],"date-time":"2015-07-14T10:20:46Z","timestamp":1436869246000},"page":"519-529","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Two-machine open-shop scheduling with rejection to minimize the makespan"],"prefix":"10.1007","volume":"38","author":[{"given":"Liqi","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Lingfa","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,15]]},"reference":[{"key":"409_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":"409_CR2","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":"409_CR3","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. Operat Res Lett 30:415\u2013420","journal-title":"Operat Res Lett"},{"key":"409_CR4","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":"409_CR5","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzalez","year":"1976","unstructured":"Gonzalez T, Sahni S (1976) Open shop scheduling to minimize finish time. J ACM 23:665\u2013679","journal-title":"J ACM"},{"key":"409_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 Programm 94:361\u2013374","journal-title":"Math Programm"},{"key":"409_CR7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ejor.2012.12.028","volume":"228","author":"H Kellerer","year":"2013","unstructured":"Kellerer H, Strusevich V (2013) Fast approximation schemes for boolean programming and scheduling problems related to positive convex Half-Product. Euro J Operat Res 228:24\u201332","journal-title":"Euro J Operat Res"},{"key":"409_CR8","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 Process Lett 113:593\u2013598","journal-title":"Inf Process Lett"},{"key":"409_CR9","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":"409_CR10","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 Operat Res 39:1087\u20131096","journal-title":"Comput Operat Res"},{"key":"409_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 offline scheduling with rejection. J Schedul 16:3\u201328","journal-title":"J Schedul"},{"key":"409_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. Operat Res 59:1504\u20131511","journal-title":"Operat Res"},{"key":"409_CR13","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1057\/jors.1991.96","volume":"42","author":"VS Strusevich","year":"1991","unstructured":"Strusevich VS (1991) Two machine super-shop scheduling problem. J Operat Res Soc 42:479\u2013492","journal-title":"J Operat Res Soc"},{"key":"409_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger GJ (2000) When does a dynamic programming formulation guarantee the exitence of an FPTAS? INFORMS J Comput 12:57\u201374","journal-title":"INFORMS J Comput"},{"key":"409_CR15","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. Europ J Operat Res 198:975\u2013978","journal-title":"Europ J Operat Res"},{"key":"409_CR16","doi-asserted-by":"crossref","unstructured":"Zhang LQ, Lu LF, Li SS (2015) New results on two-machine flow-shop scheduling with rejection. J Comb Optim (in press). doi: 10.1007\/s10878-015-9836-3","DOI":"10.1007\/s10878-015-9836-3"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-015-0409-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-015-0409-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-015-0409-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T11:00:06Z","timestamp":1559041206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-015-0409-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,15]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["409"],"URL":"https:\/\/doi.org\/10.1007\/s00291-015-0409-8","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,15]]}}}