{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:30:06Z","timestamp":1779316206765,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642020254","type":"print"},{"value":"9783642020261","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_39","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"411-420","source":"Crossref","is-referenced-by-count":14,"title":["Scheduling with Rejection to Minimize the Makespan"],"prefix":"10.1007","author":[{"given":"Yuzhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengfei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation Schemes for Minimizing Average Weighted Completion Time with Release Data. In: Proceedings of 40th FOCS, pp. 32\u201343 (1999)","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y. Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multi-Processor Scheduling with Rejection. SIAM Journal of Discrete Maths.\u00a013, 64\u201378 (2000)","journal-title":"SIAM Journal of Discrete Maths."},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s11424-007-9050-1","volume":"20","author":"Z. Cao","year":"2007","unstructured":"Cao, Z., Zhang, Y.: Scheduling with Rejection and Non-Identical Job Arrivals. Journal of System Science and Complexity\u00a020, 529\u2013535 (2007)","journal-title":"Journal of System Science and Complexity"},{"issue":"1","key":"39_CR4","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"D.W. Engels","year":"2003","unstructured":"Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for Scheduling with Rejection. Journal of Algorithms\u00a049(1), 175\u2013191 (2003)","journal-title":"Journal of Algorithms"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"L. Epstein","year":"2002","unstructured":"Epstein, L., Noga, J., Woeginger, G.J.: On-line Scheduling of Unit Time Jobs with Rejection: Minimizing the Total Completion Time. Operations Research Letters\u00a030, 415\u2013420 (2002)","journal-title":"Operations Research Letters"},{"key":"39_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Ann. Disc. Math.\u00a05, 287\u2013326 (1979)","journal-title":"Ann. Disc. Math."},{"key":"39_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00021409","volume":"65","author":"Y. He","year":"2000","unstructured":"He, Y., Min, X.: On-Line Uniform Machine Scheduling with Rejection. Computing\u00a065, 1\u201312 (2000)","journal-title":"Computing"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"S.S. Seiden","year":"2001","unstructured":"Seiden, S.S.: Preemptive Multiprocessor Scheduling with Rejection. Theoretical Computer Science\u00a0262, 437\u2013458 (2001)","journal-title":"Theoretical Computer Science"},{"key":"39_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-45078-8_8","volume-title":"Algorithms and Data Structures","author":"S. Sengupta","year":"2003","unstructured":"Sengupta, S.: Algorithms and Approximation Schemes for Minimizing Lateness\/Tardiness Scheduling with Rejection. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 79\u201390. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:52:41Z","timestamp":1739166761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}