{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:38:21Z","timestamp":1768455501603,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Jrl Syst Sci & Complex"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s11424-007-9050-1","type":"journal-article","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T13:25:09Z","timestamp":1194269109000},"page":"529-535","source":"Crossref","is-referenced-by-count":22,"title":["Scheduling with Rejection and Non-Identical Job Arrivals"],"prefix":"10.1007","volume":"20","author":[{"given":"Zhigang","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9050_CR1","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, Multiprocessor scheduling with rejection, SIAM Journal of Discrete Maths, 2000, 13(1): 64\u201378.","journal-title":"SIAM Journal of Discrete Maths"},{"issue":"1","key":"9050_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00021409","volume":"65","author":"Y. He","year":"2000","unstructured":"Y. He and X. Min, On-line uniform machine scheduling with rejection, Computing, 2000, 65(1): 1\u201312.","journal-title":"Computing"},{"key":"9050_CR3","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-45253-2_25","volume":"1879","author":"H. Hoogeveen","year":"2000","unstructured":"H. Hoogeveen, M. Skutella, and G. J. Woeginger, Preemptive scheduling with rejection, Lecture Notes in Computer Science, 2000, 1879: 268\u2013277.","journal-title":"Lecture Notes in Computer Science"},{"issue":"1","key":"9050_CR4","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, Theoretical Computer Science, 2001, 262(1): 437\u2013458.","journal-title":"Theoretical Computer Science"},{"key":"9050_CR5","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1007\/3-540-68530-8_41","volume":"1461","author":"D.W. Engels","year":"1998","unstructured":"D. W. Engels, D. R. Karger, S. G. Kolliopoulos, S. Sengupta, R. N. Uma, and J. Wein, Techniques for scheduling with rejection. Lecture Notes in Computer Science, 1998, 1461: 490\u2013501.","journal-title":"Lecture Notes in Computer Science"},{"issue":"6","key":"9050_CR6","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"L. Epstein","year":"2002","unstructured":"L. Epstein, J. Noga, and G. J. Woeginger, On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters, 2002, 30(6): 415\u2013420.","journal-title":"Operations Research Letters"},{"key":"9050_CR7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-540-45078-8_8","volume":"2748","author":"S. Sengupta","year":"2003","unstructured":"S. Sengupta, Algorithms and approximation schemes for mimimum lateness\/tardiness scheduling with rejection, Lecture Notes in Computer Science, 2003, 2748: 79\u201390.","journal-title":"Lecture Notes in Computer Science"},{"key":"9050_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling, Annals of Discrete Mathematics, 1979, 5: 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"9050_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"G.J. Woeginger","year":"2000","unstructured":"G.J. Woeginger, When does a dynamic programming formulation guarantee the exitence of an FPTAS? INFORMS Journal on Computing, 2000, 12(1): 57\u201374.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-007-9050-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-007-9050-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-007-9050-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T16:25:52Z","timestamp":1684081552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-007-9050-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["9050"],"URL":"https:\/\/doi.org\/10.1007\/s11424-007-9050-1","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}