{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:23:38Z","timestamp":1762521818820},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T00:00:00Z","timestamp":1440806400000},"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":["Oper Res Int J"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s12351-015-0193-x","type":"journal-article","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T07:37:40Z","timestamp":1440747460000},"page":"211-221","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The single machine serial batch scheduling problems with rejection"],"prefix":"10.1007","volume":"16","author":[{"given":"Juan","family":"Zou","sequence":"first","affiliation":[]},{"given":"Cuixia","family":"Miao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"issue":"1","key":"193_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(1):64\u201378","journal-title":"SIAM J Discret Math"},{"issue":"4","key":"193_CR2","first-page":"566","volume":"51","author":"EG Coffman","year":"1990","unstructured":"Coffman EG, Yannakakis M, Magazine MJ, Santos C (1990) Batch sizing and sequencing on a single machine. Oper Res 51(4):566\u2013584","journal-title":"Oper Res"},{"issue":"1","key":"193_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(1):175\u2013191","journal-title":"J Algorithms"},{"issue":"2","key":"193_CR4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0167-6377(99)00066-8","volume":"26","author":"MM Guntzer","year":"2000","unstructured":"Guntzer MM, Jungnickel D (2000) Approximate minimization algorithms for the 0\/1 knapsack and subset-sum problem. Oper Res Lett 26(2):55\u201366","journal-title":"Oper Res Lett"},{"issue":"3","key":"193_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 Prog 94(3):361\u2013374","journal-title":"Math Prog"},{"key":"193_CR6","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Plenum Press, New York, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"193_CR7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0167-6377(03)00007-5","volume":"31","author":"CT Ng","year":"2003","unstructured":"Ng CT, Cheng TCE, Yuan JJ, Liu ZH (2003) On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. Oper Res Lett 31(4):323\u2013326","journal-title":"Oper Res Lett"},{"key":"193_CR8","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"},{"issue":"1","key":"193_CR9","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2013.08.013","volume":"233","author":"D Shabtay","year":"2014","unstructured":"Shabtay D (2014) The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur J Oper Res 233(1):64\u201374","journal-title":"Eur J Oper Res"},{"issue":"3","key":"193_CR10","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):3\u201328","journal-title":"J Sched"},{"key":"193_CR11","volume-title":"Multicriteria scheduling: theory, models and algorithms","author":"V T\u2019kindt","year":"2006","unstructured":"T\u2019kindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms. Springer, Berlin"},{"issue":"4","key":"193_CR12","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/opre.43.4.692","volume":"43","author":"S Webster","year":"1995","unstructured":"Webster S, Baker KR (1995) Scheduling groups of jobs on a single machine. Oper Res 43(4):692\u2013703","journal-title":"Oper Res"},{"issue":"6","key":"193_CR13","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1057\/jors.2012.64","volume":"64","author":"H Xuan","year":"2013","unstructured":"Xuan H, Li B (2013) Scheduling dynamic hybrid flow shop with serial batching machine. J Oper Res Soc 64(6):825\u2013832","journal-title":"J Oper Res Soc"},{"issue":"2","key":"193_CR14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1016\/S0377-2217(03)00361-8","volume":"158","author":"JJ Yuan","year":"2004","unstructured":"Yuan JJ, Yang AF, Cheng TCE (2004) A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times. Eur J Oper Res 158(2):525\u2013528","journal-title":"Eur J Oper Res"},{"issue":"16","key":"193_CR15","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L Zhang","year":"2010","unstructured":"Zhang L, Lu L, Yuan J (2010) Single machine scheduling under the job rejection constraint. Theoret Comput Sci 411(16):1877\u20131882","journal-title":"Theoret Comput Sci"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-015-0193-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-015-0193-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-015-0193-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T08:04:37Z","timestamp":1559462677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-015-0193-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,29]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["193"],"URL":"https:\/\/doi.org\/10.1007\/s12351-015-0193-x","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,29]]}}}