{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:03:09Z","timestamp":1777608189224,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,9,29]],"date-time":"2016-09-29T00:00:00Z","timestamp":1475107200000},"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":"publisher","award":["NSFC (11501171"],"award-info":[{"award-number":["NSFC (11501171"]}],"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":["NSFC (11571321)"],"award-info":[{"award-number":["NSFC (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":["NSFC (11671368)"],"award-info":[{"award-number":["NSFC (11671368)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006407","name":"Natural Science Foundation of Henan Province","doi-asserted-by":"publisher","award":["NSF-Henan (15IRTSTHN006)"],"award-info":[{"award-number":["NSF-Henan (15IRTSTHN006)"]}],"id":[{"id":"10.13039\/501100006407","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-0083-z","type":"journal-article","created":{"date-parts":[[2016,9,29]],"date-time":"2016-09-29T23:07:33Z","timestamp":1475190453000},"page":"483-503","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Online scheduling to minimize the total weighted completion time plus the rejection cost"],"prefix":"10.1007","volume":"34","author":[{"given":"Ran","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinjiang","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,29]]},"reference":[{"issue":"3","key":"83_CR1","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/moor.1040.0092","volume":"29","author":"EJ Anderson","year":"2004","unstructured":"Anderson EJ, Potts CN (2004) Online scheduling of a single machine to minimize total weighted completion time. Math Oper Res 29(3):686\u2013697","journal-title":"Math Oper Res"},{"issue":"1","key":"83_CR2","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"},{"key":"83_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 Algorithm 49:175\u2013191","journal-title":"J Algorithm"},{"key":"83_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1137\/S089548019936223X","volume":"15","author":"MX Goemans","year":"2002","unstructured":"Goemans MX, Queyranne M, Schulz AS, Skutella M, Wang Y (2002) Single machine scheduling with release dates. SIAM J Discret Math 15:165\u2013192","journal-title":"SIAM J Discret Math"},{"key":"83_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"issue":"3","key":"83_CR6","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"LA Hall","year":"1997","unstructured":"Hall LA, Schulz AS, Shmoys DB, Wein J (1997) Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Math Oper Res 22(3):513\u2013544","journal-title":"Math Oper Res"},{"key":"83_CR7","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":"83_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":"83_CR9","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ijpe.2014.07.027","volume":"158","author":"R Ma","year":"2014","unstructured":"Ma R, Yuan JJ (2014) Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time. Int J Prod Econ 158:114\u2013119","journal-title":"Int J Prod Econ"},{"key":"83_CR10","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.amc.2015.10.058","volume":"273","author":"R Ma","year":"2016","unstructured":"Ma R, Tao JP, Yuan JJ (2016) Online scheduling with linear deteriorating jobs to minimize the total weighted completion time. Appl Math Comput 273:570\u2013583","journal-title":"Appl Math Comput"},{"key":"83_CR11","first-page":"199","volume":"82","author":"C Philips","year":"1998","unstructured":"Philips C, Stein C, Wein J (1998) Minimizing average completion time in the presence of release dates. Math Program 82:199\u2013223","journal-title":"Math Program"},{"key":"83_CR12","unstructured":"Schulz AS, Skutella M (1997) Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria. In: Burkard R, Woeginger G (eds) Algorithms, ESA-97, Proceedings of the 5th annual European symposium on algorithms, Lecture Notes in Computer Science, vol 1284, Springer, Berlin, pp 416\u2013429"},{"key":"83_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/jos.93","volume":"5","author":"AS Schulz","year":"2002","unstructured":"Schulz AS, Skutella M (2002) The power of $$\\alpha $$ \u03b1 -points in preemptive single scheduling. J Sched 5:121\u2013133","journal-title":"J Sched"},{"key":"83_CR14","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":"83_CR15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist Q 3:59\u201366","journal-title":"Nav Res Logist Q"},{"key":"83_CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.cor.2013.09.016","volume":"43","author":"JP Tao","year":"2014","unstructured":"Tao JP (2014) A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time. Comput Oper Res 43:215\u2013224","journal-title":"Comput Oper Res"},{"issue":"2","key":"83_CR17","doi-asserted-by":"crossref","first-page":"269","DOI":"10.3934\/jimo.2010.6.269","volume":"6","author":"JP Tao","year":"2010","unstructured":"Tao JP, Chao ZJ, Xi YG (2010a) A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times. J Ind Manag Optim 6(2):269\u2013282","journal-title":"J Ind Manag Optim"},{"issue":"8\u20139","key":"83_CR18","first-page":"325","volume":"110","author":"JP Tao","year":"2010","unstructured":"Tao JP, Chao ZJ, Xi YG, Tao Y (2010b) An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time. Inf Process Lett 110(8\u20139):325\u2013330","journal-title":"Inf Process Lett"},{"key":"83_CR19","unstructured":"Tao JP, Jiang H, Liu TD (2012) A 2.5-competitive online algorithm for $$Pm| r_j| \\sum w_jC_j$$ P m | r j | \u2211 w j C j . In: The 24th Chinese control and decision conference (CCDC), Taiyuan, pp 3184-3188"},{"key":"83_CR20","unstructured":"Tao JP, Liu TD (2013) WSPT\u2019s competitive performance for minimizing the total weighted flow time: from single to parallel machines. Math Probl Eng, Article ID 343287"},{"key":"83_CR21","unstructured":"Vestjens APA (1997) On-line machine scheduling. Ph.D. Thesis, Eindhoven University of Technology, Netherlands"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0083-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0083-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0083-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T09:38:04Z","timestamp":1601113084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0083-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,29]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["83"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0083-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,29]]}}}