{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T07:28:44Z","timestamp":1767598124588,"version":"3.35.0"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1016\/j.future.2008.07.006","type":"journal-article","created":{"date-parts":[[2008,7,30]],"date-time":"2008-07-30T08:32:45Z","timestamp":1217406765000},"page":"35-50","source":"Crossref","is-referenced-by-count":50,"title":["Resource allocation on computational grids using a utility model and the knapsack problem"],"prefix":"10.1016","volume":"25","author":[{"given":"Daniel C.","family":"Vanderster","sequence":"first","affiliation":[]},{"given":"Nikitas J.","family":"Dimopoulos","sequence":"additional","affiliation":[]},{"given":"Rafael","family":"Parra-Hernandez","sequence":"additional","affiliation":[]},{"given":"Randall J.","family":"Sobie","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.future.2008.07.006_b1","doi-asserted-by":"crossref","unstructured":"I. Foster, C. Kesselman, S. Tuecke, The anatomy of the grid: Enabling scalable virtual organizations, International J. Supercomputer Applications 15","DOI":"10.1177\/109434200101500302"},{"year":"2003","series-title":"The Grid 2: Blueprint for a New Computing Infrastructure","key":"10.1016\/j.future.2008.07.006_b2"},{"key":"10.1016\/j.future.2008.07.006_b3","unstructured":"R. Raman, M. Livny, M. Solomon, Matchmaking: Distributed resource management for high throughput computing, in: The Seventh International Symposium on High Performance Distributed Computing, 1998, pp. 140\u2013146"},{"key":"10.1016\/j.future.2008.07.006_b4","series-title":"Proceedings of the Tenth International Symposium on High Performance Distributed Computing","article-title":"Condor-g: A computation management agent for multi-institutional grids","author":"Frey","year":"2001"},{"key":"10.1016\/j.future.2008.07.006_b5","doi-asserted-by":"crossref","unstructured":"R. Buyya, H. Stockinger, J. Giddy, D. Abramson, Economic models for management of resources in peer-to-poeer and grid computing, in: Proceedings of the International Conference on Commercial Applications for High-Performance Computing, 2001","DOI":"10.1117\/12.434872"},{"issue":"8","key":"10.1016\/j.future.2008.07.006_b6","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/S0167-739X(02)00085-7","article-title":"A computational economy for grid computing and its implementation in the nimrod-g resource broker","volume":"18","author":"Abramson","year":"2002","journal-title":"Future Generation Computer Systems"},{"key":"10.1016\/j.future.2008.07.006_b7","doi-asserted-by":"crossref","unstructured":"S. Venugopal, R. Buyya, L. Winton, A grid service broker for scheduling distributed data-oriented applications on global grids, in: Proceedings of the 2nd workshop on Middleware for grid computing, 2004, pp. 75\u201380","DOI":"10.1145\/1028493.1028506"},{"key":"10.1016\/j.future.2008.07.006_b8","series-title":"Proceedings of the 6th International Conference on Algorithms and Architectures for Parallel Processing","article-title":"A Deadline and budget constrained scheduling algorithm for e-science applications on data grids","volume":"vol. 3719","author":"Venugopal","year":"2005"},{"issue":"2","key":"10.1016\/j.future.2008.07.006_b9","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/322003.322011","article-title":"Heuristic algorithms for scheduling independent tasks on nonidentical processors","volume":"24","author":"Ibarra","year":"1977","journal-title":"Journal of the ACM"},{"issue":"6","key":"10.1016\/j.future.2008.07.006_b10","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","article-title":"A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems","volume":"61","author":"Braun","year":"2001","journal-title":"Journal of Parallel Distributed Computing"},{"issue":"November","key":"10.1016\/j.future.2008.07.006_b11","first-page":"671","article-title":"Dynamic mapping of a class of independent tasks onto heterogeneous computing systems","volume":"59","author":"Maheswaran","year":"1999","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/j.future.2008.07.006_b12","series-title":"Proceedings of the 9th Heterogeneous Computing Systems Workshop","article-title":"Heuristics for scheduling parameter sweep applications in grid environments","author":"Casanova","year":"2000"},{"key":"10.1016\/j.future.2008.07.006_b13","doi-asserted-by":"crossref","unstructured":"S. Vadhiyar, J. Dongarra, A metascheduler for the grid, in: Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, HPDC-11, 2002, pp. 343\u2013351","DOI":"10.1109\/HPDC.2002.1029934"},{"issue":"October","key":"10.1016\/j.future.2008.07.006_b14","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1016\/S0167-739X(03)00110-9","article-title":"Optimal quality of service routing and admission control using the utility model","volume":"19","author":"Khan","year":"2003","journal-title":"Future Generation Computer Systems"},{"key":"10.1016\/j.future.2008.07.006_b15","unstructured":"J. Gomoluch, M. Schroeder, Market-based resource allocation for grid computing, in: Middleware 2003 Workshops, Rio de Janeiro, Brazil, 2003, pp. 211\u2013218"},{"key":"10.1016\/j.future.2008.07.006_b16","doi-asserted-by":"crossref","unstructured":"P. Barham, B. Dragovic, K. Fraser, S. Hand, T. Harris, A. Ho, R. Neugebauer, I. Pratt, A. Warfield, Xen and the Art of Virtualization, in: Proceedings of the 19th ACM Symposium on Operating Systems Principles, 2003","DOI":"10.1145\/945445.945462"},{"key":"10.1016\/j.future.2008.07.006_b17","doi-asserted-by":"crossref","unstructured":"D.C. Vanderster, N.J. Dimopoulos, R.J. Sobie, Metascheduling multiple resource types using the MMKP, in: Proceedings of the 7th IEEE\/ACM International Conference on Grid Computing, September 2006, pp. 231\u2013237","DOI":"10.1109\/ICGRID.2006.311020"},{"key":"10.1016\/j.future.2008.07.006_b18","unstructured":"R. Parra-Hernandez, A Study of Knapsack-based Admission and Allocation Techniques, Ph.D. Thesis, University of Victoria, Canada, 2005"},{"key":"10.1016\/j.future.2008.07.006_b19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/1520-6750(198704)34:2<161::AID-NAV3220340203>3.0.CO;2-A","article-title":"A heuristic solution procedure for the multiconstraint zero-one knapsack problem","author":"Pirkul","year":"1987","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.future.2008.07.006_b20","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1287\/opre.27.6.1101","article-title":"New greedy-like heuristics for the multidimensional 0\u20131 knapsack problem","author":"Loulou","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/j.future.2008.07.006_b21","first-page":"248","article-title":"Heuristic approaches for solving the multidimensional knapsack problem (mkp)","author":"Parra-Hernandez","year":"2002","journal-title":"WSEAS Transactions on Systems"},{"issue":"5","key":"10.1016\/j.future.2008.07.006_b22","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1109\/TSMCA.2005.851140","article-title":"A new heuristic for solving the multi-choice multidimensional knapsack problem","volume":"35","author":"Parra-Hernandez","year":"2005","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/j.future.2008.07.006_b23","unstructured":"D. Feitelson, A. Weil, Utilization and predictability in scheduling the IBM SP2 with backfilling, in: Parallel Processing Symposium, 1998"},{"key":"10.1016\/j.future.2008.07.006_b24","unstructured":"J.K. Ousterhout, Scheduling techniques for concurrent systems, in: Proceedings of the 3rd International Conference on Distributed Computer Systems, 1982, pp. 22\u201330"},{"key":"10.1016\/j.future.2008.07.006_b25","unstructured":"NPACI JOBLOG Job Trace Repository, [Online]. Available:http:\/\/joblog.npaci.edu\/\u00a0(2000)"},{"key":"10.1016\/j.future.2008.07.006_b26","series-title":"Proceedings of the 1st International Symposium on Cluster Computing and the Grid","first-page":"430","article-title":"Simgrid: A toolkit for the simulation of application scheduling","author":"Casanova","year":"2001"},{"year":"1995","series-title":"Probability and Statistics for Engineering and the Sciences","author":"Devore","key":"10.1016\/j.future.2008.07.006_b27"},{"key":"10.1016\/j.future.2008.07.006_b28","doi-asserted-by":"crossref","unstructured":"G. Mounie, C. Rapine, D. Trystram, Efficient approximation algorithms for scheduling malleable tasks, in: Proceedings of the 11th annual ACM Symposium on Parallel Algorithms and Architecture, 1999, pp. 23\u201332","DOI":"10.1145\/305619.305622"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X08001118?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X08001118?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T07:00:30Z","timestamp":1738306830000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X08001118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["S0167739X08001118"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2008.07.006","relation":{},"ISSN":["0167-739X"],"issn-type":[{"type":"print","value":"0167-739X"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}