{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:12Z","timestamp":1759847352090,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,13]],"date-time":"2016-01-13T00:00:00Z","timestamp":1452643200000},"content-version":"tdm","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":["11426094"],"award-info":[{"award-number":["11426094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571321"],"award-info":[{"award-number":["11571321"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1504103"],"award-info":[{"award-number":["U1504103"]}],"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":[[2017,8]]},"DOI":"10.1007\/s10878-016-9992-0","type":"journal-article","created":{"date-parts":[[2016,1,13]],"date-time":"2016-01-13T05:05:20Z","timestamp":1452661520000},"page":"331-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Single-machine scheduling with production and rejection costs to minimize the maximum earliness"],"prefix":"10.1007","volume":"34","author":[{"given":"Lingfa","family":"Lu","sequence":"first","affiliation":[]},{"given":"Liqi","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,13]]},"reference":[{"key":"9992_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":"9992_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":"9992_CR3","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, CA"},{"key":"9992_CR4","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1080\/00207549608904988","volume":"34","author":"AGP Guinet","year":"1996","unstructured":"Guinet AGP, Solomon MM (1996) Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. Int J Prod Res 34:1643\u20131654","journal-title":"Int J Prod Res"},{"key":"9992_CR5","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":"9992_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cie.2015.04.014","volume":"87","author":"C Koulamas","year":"2015","unstructured":"Koulamas C, Panwalkar SS (2015) On the equivalence of single machine earliness\/tardiness problems with job rejection. Comput Ind Eng 87:1\u20133","journal-title":"Comput Ind Eng"},{"key":"9992_CR7","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.tcs.2008.02.015","volume":"396","author":"L Lu","year":"2008","unstructured":"Lu L, Zhang LQ, Yuan JJ (2008) The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theor Comput Sci 396:283\u2013289","journal-title":"Theor Comput Sci"},{"key":"9992_CR8","doi-asserted-by":"crossref","first-page":"2748","DOI":"10.1016\/j.cor.2008.12.003","volume":"36","author":"L Lu","year":"2009","unstructured":"Lu L, Cheng TCE, Yuan JJ, Zhang LQ (2009) Bounded single-machine parallel-batch scheduling with release dates and rejection. Comput Oper Res 36:2748\u20132751","journal-title":"Comput Oper Res"},{"key":"9992_CR9","first-page":"42","volume":"44","author":"L Nie","year":"2012","unstructured":"Nie L, Cheng T (2012) Minimize the maximum earIiness for singIe-machine scheduling with due dates and rejection (in Chinese). J Zhengzhou Univ (Nature Science Edition) 44:42\u201345","journal-title":"J Zhengzhou Univ (Nature Science Edition)"},{"key":"9992_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-540-45078-8_8","volume":"2748","author":"S Sengupta","year":"2003","unstructured":"Sengupta S (2003) Algorithms and approximation schemes for minimum lateness\/tardiness scheduling with rejection. Lect Notes Comput Sci 2748:79\u201390","journal-title":"Lect Notes Comput Sci"},{"key":"9992_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":"9992_CR12","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":"9992_CR13","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":"9992_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":"9992_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. Eur J Oper Res 198:975\u2013978","journal-title":"Eur J Oper Res"},{"key":"9992_CR16","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"LQ Zhang","year":"2010","unstructured":"Zhang LQ, Lu LF, Yuan JJ (2010) Single-machine scheduling under the job rejection constraint. Theor Comput Sci 411:1877\u20131882","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-9992-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-9992-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-9992-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-9992-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:29Z","timestamp":1559262209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-9992-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,13]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["9992"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-9992-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,1,13]]}}}