{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T22:43:38Z","timestamp":1777502618249,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T00:00:00Z","timestamp":1508112000000},"content-version":"unspecified","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":"crossref","award":["61662088"],"award-info":[{"award-number":["61662088"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11301466"],"award-info":[{"award-number":["11301466"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10288-017-0356-0","type":"journal-article","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T16:49:53Z","timestamp":1508172593000},"page":"95-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Vector scheduling with rejection on a single machine"],"prefix":"10.1007","volume":"16","author":[{"given":"Weidong","family":"Li","sequence":"first","affiliation":[]},{"given":"Qianna","family":"Cui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,16]]},"reference":[{"key":"356_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon N, Azar Y, Woeginger GJ, Yadid T (1998) Approximation schemes for scheduling on parallel machines. J Sched 1:55\u201366","journal-title":"J Sched"},{"issue":"4","key":"356_CR2","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1007\/s00453-016-0116-0","volume":"76","author":"N Bansal","year":"2016","unstructured":"Bansal N, Oosterwijk T, Vredeveld T, Zwaan R (2016) Approximating vector scheduling: almost matching upper and lower bounds. Algorithmica 76(4):1077\u20131096","journal-title":"Algorithmica"},{"issue":"1","key":"356_CR3","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 Discrete Math 13(1):64\u201378","journal-title":"SIAM J Discrete Math"},{"key":"356_CR4","unstructured":"Bonifaci V, Wiese A (2012) Scheduling unrelated machines of few different types. \n                        arXiv:1205.0974vl\n                        \n                    ,"},{"issue":"4","key":"356_CR5","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1137\/S0097539799356265","volume":"33","author":"C Chekuri","year":"2004","unstructured":"Chekuri C, Khanna S (2004) On multidimensional packing problems. SIAM J Comput 33(4):837\u2013851","journal-title":"SIAM J Comput"},{"key":"356_CR6","doi-asserted-by":"crossref","unstructured":"Chen L, Jansen K, Zhang G (2014) On the optimality of approximation schemes for the classical scheduling problem. In: Proceedings of the 25th annual ACM-SIAM symposium 19 on discrete algorithms (SODA), pp 657\u2013668","DOI":"10.1137\/1.9781611973402.50"},{"key":"356_CR7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.cosrev.2016.12.001","volume":"24","author":"HI Christensen","year":"2017","unstructured":"Christensen HI, Khan A, Pokutta S, Tetali P (2017) Approximation and online algorithms for multidimensional bin packing: a survey. Comput Sci Rev 24:63\u201379","journal-title":"Comput Sci Rev"},{"issue":"2","key":"356_CR8","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/S0196-6774(03)00055-5","volume":"48","author":"L Epstein","year":"2003","unstructured":"Epstein L, Tassa T (2003) Vector assignment problems: a general framework. J Algorithms 48(2):360\u2013384","journal-title":"J Algorithms"},{"issue":"6\u20137","key":"356_CR9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00236-005-0003-7","volume":"42","author":"L Epstein","year":"2006","unstructured":"Epstein L, Tassa T (2006) Vector assignment schemes for asymmetric settings. Acta Inform 42(6\u20137):501\u2013514","journal-title":"Acta Inform"},{"key":"356_CR10","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"},{"issue":"1","key":"356_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10288-016-0303-5","volume":"14","author":"C He","year":"2016","unstructured":"He C, Leung JYT, Lee K, Pinedo ML (2016) Improved algorithms for single machine scheduling with release deates and rejections. 4OR Q J Oper Res 14(1):41\u201355","journal-title":"4OR Q J Oper Res"},{"issue":"1","key":"356_CR12","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum DS, Shmoys DB (1987) Using dual approximation algorithms for scheduling theoretical and practical results. J ACM 34(1):144\u2013162","journal-title":"J ACM"},{"key":"356_CR13","doi-asserted-by":"crossref","unstructured":"Im S, Kell N, Kulkarni J, Panigrahi D (2015) Tight bounds for online vector scheduling. In: IEEE 56th annual symposium on foundations of computer science (FOCS), pp 525\u2013544","DOI":"10.1109\/FOCS.2015.39"},{"key":"356_CR14","unstructured":"Jansen K, Klein KM, Verschae J (2016) Closing the gap for makespan scheduling via sparsification techniques. arXiv preprint \n                        arXiv:1604.07153"},{"key":"356_CR15","doi-asserted-by":"crossref","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming. In: Proceedings of the sixteenth annual ACM symposium on theory of computing (STOC), pp 302\u2013311","DOI":"10.1145\/800057.808695"},{"key":"356_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.tcs.2015.10.007","volume":"607","author":"W Li","year":"2015","unstructured":"Li W, Li J, Zhang X, Chen Z (2015) Penalty cost constrained identical parallel machine scheduling problem. Theoret Comput Sci 607:181\u2013192","journal-title":"Theoret Comput Sci"},{"key":"356_CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-642-40328-6_21","volume":"8096","author":"A Meyerson","year":"2013","unstructured":"Meyerson A, Roytman A, Tagiku B (2013) Online multidimensional load balancing. Lect Notes Comput Sci 8096:287\u2013302","journal-title":"Lect Notes Comput Sci"},{"issue":"8","key":"356_CR18","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ipl.2016.02.008","volume":"116","author":"J Ou","year":"2016","unstructured":"Ou J, Zhong X, Li C-L (2016) Faster algorithms for single machine scheduling with release dates and rejection. Inf Process Lett 116(8):503\u2013507","journal-title":"Inf Process Lett"},{"issue":"3","key":"356_CR19","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou J, Zhong X, Wang G (2015) An improved heuristic for parallel machine scheduling with rejection. Eur J Oper Res 241(3):653\u2013661","journal-title":"Eur J Oper Res"},{"issue":"1","key":"356_CR20","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(1):3\u201328","journal-title":"J Sched"},{"issue":"4","key":"356_CR21","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10878-010-9350-6","volume":"23","author":"D Shabtay","year":"2012","unstructured":"Shabtay D, Gaspar N, Yedidsion L (2012) A bicriteria approach to scheduling a single machine with job rejection and positional penalties. J Comb Optim 23(4):395\u2013424","journal-title":"J Comb Optim"},{"key":"356_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick SA (2011) Order acceptance and scheduling: a taxonomy and review. Eur J Oper Res 212:1\u201311","journal-title":"Eur J Oper Res"},{"key":"356_CR23","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10288-016-0304-4","volume":"14","author":"L Zhang","year":"2016","unstructured":"Zhang L, Lu L (2016) Parallel-machine scheduling with release dates and rejection. 4OR Q J Oper Res 14:165\u2013172","journal-title":"4OR Q J Oper Res"},{"issue":"3","key":"356_CR24","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"L Zhang","year":"2009","unstructured":"Zhang L, Lu L, Yuan J (2009) Single machine scheduling with release dates and rejection. Eur J Oper Res 198(3):975\u2013978","journal-title":"Eur J Oper Res"},{"issue":"16\u201318","key":"356_CR25","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\u201318):1877\u20131882","journal-title":"Theoret Comput Sci"},{"key":"356_CR26","doi-asserted-by":"publisher","unstructured":"Zhong X, Ou J (2016) Improved approximation algorithms for parallel machine scheduling with release dates and job rejection. 4OR Q J Oper Res. doi:\n                        10.1007\/s10288-016-0339-6\n                        \n                    .","DOI":"10.1007\/s10288-016-0339-6"},{"issue":"3","key":"356_CR27","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1007\/s10878-016-0016-x","volume":"33","author":"X Zhong","year":"2017","unstructured":"Zhong X, Pan Z, Jiang D (2017) Scheduling with release times and rejection on two parallel machines. J Comb Optim 33(3):934\u2013944","journal-title":"J Comb Optim"},{"issue":"4","key":"356_CR28","doi-asserted-by":"crossref","first-page":"2304","DOI":"10.1016\/j.jpdc.2013.12.006","volume":"74","author":"X Zhu","year":"2014","unstructured":"Zhu X, Li Q, Mao W, Chen G (2014) Online vector scheduling and generalized load balancing. J Parallel Distrib Comput 74(4):2304\u20132309","journal-title":"J Parallel Distrib Comput"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-017-0356-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0356-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-017-0356-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,3]],"date-time":"2018-03-03T01:56:27Z","timestamp":1520042187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-017-0356-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,16]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["356"],"URL":"https:\/\/doi.org\/10.1007\/s10288-017-0356-0","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,16]]}}}