{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T04:36:53Z","timestamp":1648528613514},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0304-3975(00)00260-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:49:41Z","timestamp":1027615781000},"page":"67-90","source":"Crossref","is-referenced-by-count":13,"title":["On-line scheduling of parallel jobs with runtime restrictions"],"prefix":"10.1016","volume":"268","author":[{"given":"Stefan","family":"Bischof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst","family":"W. Mayr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00260-7_BIB1","series-title":"Highly Parallel Computing","author":"Almasi","year":"1994"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB2","unstructured":"S. Bischof, Efficient algorithms for on-line scheduling and load distribution in parallel systems, Ph.D. Thesis, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, 1999. Available on-line: http:\/\/wwwmayr.in.tum.de\/berichte\/1999\/bischof-thesis.ps.gz."},{"issue":"5","key":"10.1016\/S0304-3975(00)00260-7_BIB3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multiprocessor tasks to minimize schedule length","volume":"C-35","author":"B\u0142a\u017cewicz","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(00)00260-7_BIB4","series-title":"Scheduling in Computer and Manufacturing Processes","author":"B\u0142a\u017cewicz","year":"1996"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB5","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB6","doi-asserted-by":"crossref","unstructured":"S. Chakrabarti, S. Muthukrishnan, Resource scheduling for parallel database and scientific applications, Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures SPAA\u201996, ACM Press, New York, 1996, pp. 329\u2013335.","DOI":"10.1145\/237502.237577"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB7","unstructured":"E.G. Coffman Jr., M.R. Garey, D.S. Johnson, Approximation algorithms for bin packing: a survey, in: D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, 1996, pp. 46\u201393 (Chapter 2)."},{"key":"10.1016\/S0304-3975(00)00260-7_BIB8","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","article-title":"Complexity of scheduling parallel task systems","volume":"2","author":"Du","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(00)00260-7_BIB9","series-title":"Proceedings of the First International Workshop on Approximation Algorithms for Combinatorial Optimization APPROX\u201998","first-page":"89","article-title":"Lower bounds for on-line scheduling with precedence constraints on identical machines","volume":"Vol. 1444","author":"Epstein","year":"1998"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB10","series-title":"Job Scheduling Strategies for Parallel Processing (IPPS\u201995 Workshop)","first-page":"1","article-title":"Parallel job scheduling: issues and approaches","volume":"Vol. 949","author":"Feitelson","year":"1995"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB11","series-title":"Job Scheduling Strategies for Parallel Processing (IPPS\u201996 Workshop)","first-page":"1","article-title":"Toward convergence in job schedulers for parallel supercomputers","volume":"Vol. 1162","author":"Feitelson","year":"1997"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB12","series-title":"Job Scheduling Strategies for Parallel Processing (IPPS\u201997 Workshop)","first-page":"1","article-title":"Theory and practice in parallel job scheduling","volume":"Vol. 1291","author":"Feitelson","year":"1997"},{"issue":"4","key":"10.1016\/S0304-3975(00)00260-7_BIB13","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1023\/A:1009794729459","article-title":"Optimal on-line scheduling of parallel jobs with dependencies","volume":"1","author":"Feldmann","year":"1998","journal-title":"J. Combin. Optim."},{"issue":"1","key":"10.1016\/S0304-3975(00)00260-7_BIB14","first-page":"49","article-title":"Dynamic scheduling on parallel machines","volume":"130","author":"Feldmann","year":"1994","journal-title":"Theoret. Comput. Sci. (Special Issue on Dynamic and On-line Algorithms)"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB15","series-title":"Online Algorithms: The State of the Art","volume":"Vol. 1442","author":"Fiat","year":"1998"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0097-3165(76)90001-7","article-title":"Resource constrained scheduling as generalized bin packing","volume":"21","author":"Garey","year":"1976","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"10.1016\/S0304-3975(00)00260-7_BIB17","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0604011","article-title":"Scheduling opposing forests","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB18","series-title":"Proceedings of the 23rd International Conference on Very Large Data Bases VLDB\u201997","first-page":"296","article-title":"Parallel query scheduling and optimization with time- and space-shared resources","author":"Garofalakis","year":"1997"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB19","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","author":"Graham","year":"1966","journal-title":"Bell System Tech. J."},{"issue":"2","key":"10.1016\/S0304-3975(00)00260-7_BIB20","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(00)00260-7_BIB21","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","article-title":"Fast algorithms for bin packing","volume":"8","author":"Johnson","year":"1974","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/S0304-3975(00)00260-7_BIB22","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u2022 Trees \u2022 Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB23","series-title":"Proceedings of the Second International EURO-PAR Conference on Parallel Processing EURO-PAR\u201996, vol. I","first-page":"37","article-title":"Dynamic load balancing in parallel database systems","volume":"Vol. 1123","author":"Rahm","year":"1996"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB24","doi-asserted-by":"crossref","first-page":"135","DOI":"10.2307\/2305906","article-title":"The approximation of numbers as sums of reciprocals","volume":"54","author":"Salzer","year":"1947","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB25","unstructured":"J. Sgall, On-line scheduling on parallel machines, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1994."},{"issue":"6","key":"10.1016\/S0304-3975(00)00260-7_BIB26","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/S0097539793248317","article-title":"Scheduling parallel machines on-line","volume":"24","author":"Shmoys","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(00)00260-7_BIB27","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(00)00260-7_BIB28","unstructured":"C.B. Stunkel, D.G. Shea, B. Abali, M. Atkins, C.A. Bender, D.G. Grice, P.H. Hochschild, D.J. Joseph, B.J. Nathanson, R.A. Swetz, R.F. Stucke, M. Tsao, P.R. Varker, The SP2 communication subsystem, Research Report RC 19914, IBM Research Division, T.J. Watson Research, 1994."},{"issue":"2","key":"10.1016\/S0304-3975(00)00260-7_BIB29","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0221021","article-title":"A heuristic of scheduling parallel tasks and its analysis","volume":"21","author":"Wang","year":"1992","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002607?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500002607?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T15:56:53Z","timestamp":1556207813000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500002607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0304397500002607"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00260-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}