{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:08Z","timestamp":1725483728147},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_10","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:20:53Z","timestamp":1178356853000},"page":"112-125","source":"Crossref","is-referenced-by-count":8,"title":["Task Distributions on Multiprocessor Systems"],"prefix":"10.1007","author":[{"given":"Evgeny V.","family":"Shchepin","sequence":"first","affiliation":[]},{"given":"Nodari N.","family":"Vakhania","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"J.K. Lenstra, D. B. Shmoys, E. Tardos \u201cApproximation algorithms for scheduling unrelated parallel machines\u201d Mathematical programming, 46, 259\u2013271, 1990","journal-title":"Mathematical programming"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M. Reducibility among combinatorial problems. In Complexity of Computer Computations, R.E. Miller and J.W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85\u2013103"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1966","unstructured":"Graham R. L. \u201cBounds for certain multiprocessing anomalies\u201d Bell. Syst. Tech. J, 45 (1966), 1563\u20131581","journal-title":"Bell. Syst. Tech. J"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/0213013","volume":"13","author":"D. K. Friesen","year":"1984","unstructured":"D. K. Friesen \u201cTighter bound for the MULTIFIT processor scheduling algorithm\u201d SIAM J. Comput., 13, n. 1, Febr. 1984, 170\u2013181.","journal-title":"SIAM J. Comput."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF02216826","volume":"24","author":"M. Yue","year":"1990","unstructured":"Yue M. \u201cOn the exact upper bound for the multifit processors scheduling algorithm\u201d, Ann. Oper. Res., 24 (1990), 233\u2013259","journal-title":"Ann. Oper. Res."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/0212004","volume":"12","author":"D. K. Friesen","year":"1983","unstructured":"D. K. Friesen, M. A. Langston \u201cBounds for MULTIFIT scheduling on uniform processors\u201d SIAM J. Comput., 12, n. 1, Febr. 1983, 60\u201370.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D. S. Hochbaum","year":"1988","unstructured":"D. S. Hochbaum and D. B. Shmoys \u201cA polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach\u201d, SIAM J. Comput., 17, n. 3 (1988), 539\u2013551","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10_CR8","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz E. and Sahni S., \u201cExact and approximate algorithms for scheduling nonidentical processors\u201d, J. ACM, 23, n. 5, (apr. 1976), 317\u2013327","journal-title":"J. ACM"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/322003.322011","volume":"24","author":"O.H. Ibarra","year":"1977","unstructured":"Ibarra O.H., Kim C. E. \u201cHeuristic algorithms for scheduling independent tasks on nonidentical processors\u201d, J. ACM, 24, 2 (April 1977) 280\u2013289","journal-title":"J. ACM"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1145\/322276.322284","volume":"28","author":"E. Davis","year":"1981","unstructured":"E. Davis, J. M. Jaffe Algorithms for Scheduling Tasks on Unrelated Processors, Journal of the ACM 28, 721\u2013736 (1981).","journal-title":"Journal of the ACM"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0166-218X(85)90009-5","volume":"10","author":"C. N. Potts","year":"1985","unstructured":"C. N. Potts \u201cAnalysis of a linear programming heuristic for scheduling unrelated parallel machines\u201d Discrete Appl. Math., 10, 155\u2013164 (1985)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1137\/0213044","volume":"13","author":"G. Dobson","year":"1984","unstructured":"G. Dobson, Scheduling independent tasks on uniform processors, SIAM J. Comput., Vol 13, No 4, November 1984,pp. 705\u2013716","journal-title":"SIAM J. Comput."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T. Gonzalez","year":"1976","unstructured":"Gonzalez T. and S. Sahni, \u201cOpen Shop Scheduling to Minimize Finish time\u201d, Journal of the ACM 23, 665\u2013679 (1976).","journal-title":"Journal of the ACM"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/322092.322101","volume":"25","author":"E.L. Lawler","year":"1978","unstructured":"Lawler E.L. and J. Labetoulle, \u201cOn preemptive scheduling of unrelated parallel processors by linear programming\u201d, J. of the ACM 25, 612\u2013619 (1978).","journal-title":"J. of the ACM"},{"key":"10_CR15","volume-title":"Linear programming and extensions","author":"G. B. Dantzig","year":"1963","unstructured":"G. B. Dantzig \u201c Linear programming and extensions\u201d Princeton University Press, Princeton, NJ, 1963."},{"key":"10_CR16","first-page":"134","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge C. \u201cGraphs and Hypergraphs\u201d, American Elsevier, New York, 1973, p. 134"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Jansen K. and L. Porkolab. \u201cImproved approximation schemes for scheduling unrelated parallel machines\u201d. Proc. STOC99, 1999.","DOI":"10.1145\/301250.301361"},{"key":"10_CR18","unstructured":"Hall L.A. \u201cApproximation algorithms for scheduling\u201d. In Approximation algorithms for NP-hard problems, PWS Pub., 1997."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T09:36:38Z","timestamp":1550309798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}