{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:57:01Z","timestamp":1725796621593},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_50","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"584-595","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Average Flow-Time under Knapsack Constraint"],"prefix":"10.1007","author":[{"given":"Suman Kalyan","family":"Bera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Syamantak","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-39658-1_7","volume-title":"Algorithms - ESA 2003","author":"N. Bansal","year":"2003","unstructured":"Bansal, N., Blum, A., Chawla, S., Dhamdhere, K.: Scheduling for flow-time with admission control. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 43\u201354. Springer, Heidelberg (2003)"},{"key":"50_CR2","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. In: Proc. ACM-SIAM SODA (1996)"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Charikar, M., Khuller, S.: A robust maximum completion time measure for scheduling. In: Proc. ACM-SIAM SODA (2006)","DOI":"10.1145\/1109557.1109594"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/3-540-68530-8_41","volume-title":"Algorithms - ESA \u201998","author":"D.W. Engels","year":"1998","unstructured":"Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 490\u2013501. Springer, Heidelberg (1998)"},{"key":"50_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/11786986_17","volume-title":"Automata, Languages and Programming","author":"N. Garg","year":"2006","unstructured":"Garg, N., Kumar, A.: Better algorithms for minimizing average flow-time on related machines. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part I. LNCS, vol.\u00a04051, pp. 181\u2013190. Springer, Heidelberg (2006)"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Garg, N., Kumar, A.: Minimizing average flow-time: Upper and lower bounds. In: Proc. IEEE FOCS (2007)","DOI":"10.1109\/FOCS.2007.52"},{"key":"50_CR7","unstructured":"Guha, S., Munagala, K.: Model-driven optimization using adaptive probes. In: Proc. ACM-SIAM SODA (2007)"},{"key":"50_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-03685-9_12","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Gupta","year":"2009","unstructured":"Gupta, A., Krishnaswamy, R., Kumar, A., Segev, D.: Scheduling with outliers. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 149\u2013162. Springer, Heidelberg (2009)"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. (1990)","DOI":"10.1007\/BF01585745"},{"key":"50_CR10","unstructured":"Saha, B., Srinivasan, A.: A new approximation technique for resource-allocation problems. In: Proc. ICS (2010)"},{"key":"50_CR11","unstructured":"Shmoys, D.B., Tardos, \u00c9.: Scheduling unrelated machines with costs. In: Proc. ACM-SIAM SODA (1993)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:50:24Z","timestamp":1558939824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}