{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T18:40:48Z","timestamp":1783190448550,"version":"3.54.6"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Syst. Sci. Complex."],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s11424-008-9070-5","type":"journal-article","created":{"date-parts":[[2008,2,4]],"date-time":"2008-02-04T10:18:04Z","timestamp":1202120284000},"page":"114-118","source":"Crossref","is-referenced-by-count":4,"title":["On-Line Scheduling of Unit Time Jobs with Rejection on Uniform Machines"],"prefix":"10.1007","volume":"21","author":[{"given":"Shoupeng","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9070_CR1","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. E. Tarjan, Amortized efficiency of list update and paging rule, Communications of ACM, 1985, 28: 202\u2013208.","journal-title":"Communications of ACM"},{"key":"9070_CR2","doi-asserted-by":"crossref","unstructured":"D. W. Engels, S. G. Kolliopoulous, S. Sengupta, R. N. Uma, and J. Wein, Techniques for scheduling with rejection, in Proceedings of the 6th European Symposium on Algorithm (ESA\u20191998), Lecture Notes in Computer Science, 1998, 1461: 490\u2013501.","DOI":"10.1007\/3-540-68530-8_41"},{"key":"9070_CR3","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"Epstein Leah","year":"2002","unstructured":"Leah Epstein, Join Noga, and J. Gerhard Woeginger, On-line scheduling of unit time with rejection: minimizing the total completion time, Operations Research Letters, 2002, 30: 415\u2013420.","journal-title":"Operations Research Letters"},{"key":"9070_CR4","doi-asserted-by":"crossref","unstructured":"H. Hoogeveen, M. Skutella, and G. J. Woeginger, Preemptive scheduling with rejection, in Proceedings of the 8th European Symposium on Algorithms (ESA\u20192000), Lecture Notes in Computer Science, 2000, 1879: 268\u2013277.","DOI":"10.1007\/3-540-45253-2_25"},{"key":"9070_CR5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y. Bartal","year":"2000","unstructured":"Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. Sgall, and L. Stougie, Multiprocess or scheduling with rejection, SIAM J. Discrete Math, 2000, 13: 64\u201378.","journal-title":"SIAM J. Discrete Math"},{"key":"9070_CR6","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"S.S. Seiden","year":"2001","unstructured":"S. S. Seiden, Preemptive multiprocessor scheduling with rejection, Theoret. Comput. Sci., 2001, 262: 437\u2013458.","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"9070_CR7","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s00453-003-1053-2","volume":"38","author":"X.T. Deng","year":"2004","unstructured":"X. T. Deng, H. D. Feng, P. X. Zhang, Y. Z. Zhang, and Z. Hong, Minimizing mean completion time in a batch processing system, Algorithmica, 2004, 38(4): 513\u2013528.","journal-title":"Algorithmica"},{"issue":"3","key":"9070_CR8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1027316504440","volume":"7","author":"X.T. Deng","year":"2003","unstructured":"X. T. Deng, C. K. Poon, and Y. Z. Zhang, Approximation algorithms in batch processing, J. Comb. Optim., 2003, 7(3): 247\u2013257.","journal-title":"J. Comb. Optim."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-008-9070-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-008-9070-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-008-9070-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:53:56Z","timestamp":1559400836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-008-9070-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9070"],"URL":"https:\/\/doi.org\/10.1007\/s11424-008-9070-5","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]}}}