{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:40:02Z","timestamp":1752360002817,"version":"3.41.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cluster Computing"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1023\/a:1020910932147","type":"journal-article","created":{"date-parts":[[2003,3,20]],"date-time":"2003-03-20T19:19:47Z","timestamp":1048187987000},"page":"19-29","source":"Crossref","is-referenced-by-count":18,"title":["Divisible Load Scheduling in Systems with Limited Memory"],"prefix":"10.1007","volume":"6","author":[{"given":"M.","family":"Drozdowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Wolniewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5101796_CR1","unstructured":"M. Berkelaar, lp_solve-Mixed Integer Linear Program solver, ftp:\/\/ftp.es.ele.tue.nl\/pub\/lp_solve (1995)."},{"key":"5101796_CR2","volume-title":"Scheduling Divisible Loads in Parallel and Distributed Systems","author":"V. Bharadwaj","year":"1996","unstructured":"V. Bharadwaj, D. Ghose, V. Mani and T. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems (IEEE Computer Society Press, Los Alamitos, CA, 1996)."},{"issue":"1-3","key":"5101796_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0166-218X(99)00013-X","volume":"94","author":"J. B\u0142a\u017cewicz","year":"1999","unstructured":"J. B\u0142a\u017cewicz, M. Drozdowski, F. Guinand and D. Trystram, Scheduling a divisible task in a 2-dimensional mesh, Discrete Applied Mathematics 94(1\u20133) (June 1999) 35\u201350.","journal-title":"Discrete Applied Mathematics"},{"key":"5101796_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0167-8191(98)00104-5","volume":"25","author":"J. B\u0142a\u017cewicz","year":"1999","unstructured":"J. B\u0142a\u017cewicz, M. Drozdowski and M. Markiewicz, Divisible task scheduling\u2013concept and verification, Parallel Computing 25 (1999) 87\u201398.","journal-title":"Parallel Computing"},{"key":"5101796_CR5","volume-title":"Series: Rozprawy","author":"M. Drozdowski","year":"1997","unstructured":"M. Drozdowski, Selected problems of scheduling tasks in multiprocessor computer systems, Series: Rozprawy, No. 321, Pozn\u00e1n University of Technology Press, Pozn\u00e1n (1997). Also: http:\/\/www.cs.put. poznan.pl\/~maciejd\/txt\/h.ps"},{"key":"5101796_CR6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/S0167-8191(99)00004-6","volume":"25","author":"M. Drozdowski","year":"1999","unstructured":"M. Drozdowski and W. G\u0142azek, Scheduling divisible loads in a threedimensional mesh of processors, Parallel Computing 25 (1999) 381\u2013404.","journal-title":"Parallel Computing"},{"key":"5101796_CR7","doi-asserted-by":"crossref","unstructured":"M. Drozdowski and P. Wolniewicz, Experiments with scheduling divisible tasks in clusters of workstations, in: Euro-Par 2000, Lecture Notes in Computer Science, Vol. 1900, eds. A. Bode, T. Ludwig, W. Karl and R. Wism\u00fcller (Springer, 2000) pp. 311\u2013319.","DOI":"10.1007\/3-540-44520-X_40"},{"key":"5101796_CR8","unstructured":"M. Drozdowski and P. Wolniewicz, On the complexity of divisible job scheduling with limited memory buffers, Technical Report 29 001\/2001, Institute of Computing Science, Pozn\u00e1n University of Technology, 2001."},{"key":"5101796_CR9","unstructured":"R. Fourer, Linear Programming Frequently Asked Questions (2000), http:\/\/www-unix.mcs.anl.gov\/otc\/Guide\/faq\/ linear-programming-faq.html"},{"key":"5101796_CR10","volume-title":"Computers and Intractability: 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, San Francisco, 1979)."},{"key":"5101796_CR11","volume-title":"Algorithms for scheduling divisible tasks on parallel machines","author":"W. G\u0142azek","year":"1998","unstructured":"W. G\u0142azek, Algorithms for scheduling divisible tasks on parallel machines, Ph.D. Thesis, Department of Electronics, Telecommunication and Computer Science, Technical University of Gd\u00e1nsk, Poland, 1998."},{"key":"5101796_CR12","first-page":"107","volume-title":"Advances in Linear and Integer Programming","author":"J. Gondzio","year":"1996","unstructured":"J. Gondzio and T. Terlaky, A computational view of interior-point methods for linear programming, in: Advances in Linear and Integer Programming, ed. Beasley (Oxford University Press, Oxford, 1996) pp. 107\u2013146."},{"issue":"4","key":"5101796_CR13","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1109\/7.892677","volume":"36","author":"X. Li","year":"2000","unstructured":"X. Li, V. Bharadwaj and C.C. Ko, Optimal divisible task scheduling on single-level tree networks with buffer constraints, IEEE Transactions on Aerospace and Electronic Systems 36(4) (2000) 1298\u20131308.","journal-title":"IEEE Transactions on Aerospace and Electronic Systems"},{"issue":"1","key":"5101796_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"I.J. Lustig","year":"1994","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, Interior point methods for linear programming: Computational state of the art, ORSA Journal on Computing 6(1) (1994) 1\u201314.","journal-title":"Computational state of the art, ORSA Journal on Computing"},{"key":"5101796_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988)."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020910932147.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020910932147\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020910932147.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:16:50Z","timestamp":1752358610000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020910932147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["5101796"],"URL":"https:\/\/doi.org\/10.1023\/a:1020910932147","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}