{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T05:45:46Z","timestamp":1786167946977,"version":"3.56.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1007\/bf01940883","type":"journal-article","created":{"date-parts":[[2005,7,27]],"date-time":"2005-07-27T11:12:55Z","timestamp":1122462775000},"page":"600-625","source":"Crossref","is-referenced-by-count":501,"title":["Proportionate progress: A notion of fairness in resource allocation"],"prefix":"10.1007","volume":"15","author":[{"given":"S. K.","family":"Baruah","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"N. K.","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C. G.","family":"Plaxton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D. A.","family":"Varvel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF01940883_CR1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01995675","volume":"2","author":"S. K. Baruah","year":"1990","unstructured":"S. K. Baruah, R. R. Howell, and L. E. Rosier. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor.Real-Time Systems, 2:301\u2013324, 1990.","journal-title":"Real-Time Systems"},{"key":"BF01940883_CR2","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection.Journal of Computer and System Sciences, 7:448\u2013461, 1973.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF01940883_CR3","volume-title":"Ph.D. thesis","author":"X. Deng","year":"1989","unstructured":"X. Deng. Mathematical Programming: Complexity and Applications. Ph.D. thesis, Department of Operations Research, Stanford University, Stanford, CA, September 1989."},{"key":"BF01940883_CR4","volume-title":"Flows in Networks","author":"L. R. Ford Jr.","year":"1962","unstructured":"L. R. Ford, Jr., and D. R. Fulkerson.Flows in Networks. Princeton University Press, Princeton, NJ, 1962."},{"key":"BF01940883_CR5","volume-title":"A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson.Computers and Intractability.A Guide to the Theory of NP-Completeness. Freeman, New York, 1979."},{"key":"BF01940883_CR6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/321921.321936","volume":"23","author":"D. S. Hirschberg","year":"1976","unstructured":"D. S. Hirschberg and C. K. Wong. A polynomial-time algorithm for the knapsack problem with two variables.Journal of the Association for Computing Machinery, 23:147\u2013154, 1976.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF01940883_CR7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"W. A. Horn","year":"1974","unstructured":"W. A. Horn. Some simple scheduling algorithms.Naval Research Logistics Quarterly, 21:177\u2013185, 1974.","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF01940883_CR8","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322169.322179","volume":"27","author":"R. Kannan","year":"1980","unstructured":"R. Kannan. A polynomial algorithm for the two-variable integer programming problem.Journal of the Association for Computing Machinery, 27:118\u2013122, 1980.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF01940883_CR9","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H. W. Lenstra Jr","year":"1983","unstructured":"H. W. Lenstra, Jr. Integer programming with a fixed number of variables.Mathematics of Operations Research, 8:538\u2013548, 1983.","journal-title":"Mathematics of Operations Research"},{"key":"BF01940883_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01553887","volume":"4","author":"J. Y.-T. Leung","year":"1989","unstructured":"J. Y.-T. Leung. A new algorithm for scheduling periodic, real-time tasks.Algorithmica, 4:209\u2013219, 1989.","journal-title":"Algorithmica"},{"key":"BF01940883_CR11","first-page":"28","volume-title":"JPL Space Programs Summary 37\u201360, vol. II","author":"C. L. Liu","year":"1969","unstructured":"C. L. Liu. Scheduling Algorithms for Multiprocessors in a Hard-Real-Time Environment. JPL Space Programs Summary 37\u201360, vol. II, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, pages 28\u201337, November, 1969."},{"key":"BF01940883_CR12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C. L. Liu","year":"1973","unstructured":"C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment.Journal of the Association for Computing Machinery, 20:46\u201361, 1973.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF01940883_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/1911124","volume":"49","author":"H. E. Scarf","year":"1981","unstructured":"H. E. Scarf. Production sets with indivisibilities, Part I: Generalities.Econometrica, 49:1\u201332, 1981.","journal-title":"Econometrica"},{"key":"BF01940883_CR14","doi-asserted-by":"crossref","first-page":"395","DOI":"10.2307\/1913318","volume":"49","author":"H. E. Scarf","year":"1981","unstructured":"H. E. Scarf. Production sets with indivisibilities, Part II: The case of two activities.Econometrica, 49:395\u2013423, 1981.","journal-title":"Econometrica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940883.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01940883\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:33:55Z","timestamp":1557750835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01940883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["BF01940883"],"URL":"https:\/\/doi.org\/10.1007\/bf01940883","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}