{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:14Z","timestamp":1759639034507},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200642"},{"type":"electronic","value":"9783540396581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_7","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:24:30Z","timestamp":1279826670000},"page":"43-54","source":"Crossref","is-referenced-by-count":8,"title":["Scheduling for Flow-Time with Admission Control"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]},{"given":"Avrim","family":"Blum","sequence":"additional","affiliation":[]},{"given":"Shuchi","family":"Chawla","sequence":"additional","affiliation":[]},{"given":"Kedar","family":"Dhamdhere","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. Smith","year":"1956","unstructured":"Smith, W.: Various optimizers for single stage production. Naval Research Logistics Quarterly\u00a03, 59\u201366 (1956)","journal-title":"Naval Research Logistics Quarterly"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S.: Approximation schemes for preemptive weighted flow time. In: ACM Symposium on Theory of Computing (STOC) (2002)","DOI":"10.1145\/509907.509954"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Zhu, A.: Algorithms for weighted flow time. In: STOC (2001)","DOI":"10.1145\/380752.380778"},{"key":"7_CR4","unstructured":"Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 508\u2013516 (2003)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44666-4_8","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"L. Becchetti","year":"2001","unstructured":"Becchetti, L., Leonardi, S., Spaccamela, A.M., Pruhs, K.: Online weighted flow time and deadline scheduling. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, pp. 36\u201347. Springer, Heidelberg (2001)"},{"key":"7_CR6","volume-title":"On-Line Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: On-Line Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"7_CR7","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. In: ACM-SIAM Symposium on Discrete Algorithms, SODA (1996)"},{"key":"7_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":"7_CR9","doi-asserted-by":"crossref","unstructured":"Hoogeveen, H., Skutella, M., Woeginger, G.: Preemptive scheduling with rejection. In: European Symposium on Algorithms (2000)","DOI":"10.1007\/3-540-45253-2_25"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Engels, D., Karger, D., Kolliopoulos, S., Sengupta, S., Uma, R., Wein, J.: Techniques for scheduling with rejection. In: European Symposium on Algorithms, pp. 490\u2013501 (1998)","DOI":"10.1007\/3-540-68530-8_41"},{"key":"7_CR11","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"A.W. Marshall","year":"1979","unstructured":"Marshall, A.W., Olkin, I.: Inequalities: Theory of Majorization and Its Applications. Academic Press, London (1979)"},{"key":"7_CR12","volume-title":"Inequalities","author":"G. Hardy","year":"1952","unstructured":"Hardy, G., Littlewood, J.E., Polya, G.: Inequalities. Cambridge University Press, Cambridge (1952)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. JACM\u00a047, 617\u2013643 (2000)","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T09:00:23Z","timestamp":1559293223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}