{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T00:17:37Z","timestamp":1774138657960,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0377-2217(02)00760-9","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T13:32:55Z","timestamp":1053351175000},"page":"377-389","source":"Crossref","is-referenced-by-count":22,"title":["Scheduling multiprocessor tasks on parallel processors with limited availability"],"prefix":"10.1016","volume":"149","author":[{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Dell\u2019Olmo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Drozdowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemys\u0142aw","family":"M\u0105czka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00760-9_BIB1","doi-asserted-by":"crossref","first-page":"1806","DOI":"10.1137\/S0097539797321237","article-title":"Bandwidth allocation with preemption","volume":"28","author":"Bar-Noy","year":"1999","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB2","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multiprocessor tasks to minimize schedule length","volume":"35","author":"B\u0142a\u017cewicz","year":"1986","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB3","series-title":"Handbook on Parallel and Distributed Processing","first-page":"263","article-title":"Management of resources in parallel systems","author":"B\u0142a\u017cewicz","year":"2000"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB4","unstructured":"J. B\u0142a\u017cewicz, P. Dell\u2019Olmo, M. Drozdowski, Scheduling multiprocessor tasks on two parallel processors, Proceedings of the 2nd International Conference on Parallel Computing Systems, Ensenada, Mexico, 1999, pp. 165\u2013170"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0167-8191(94)90110-4","article-title":"Scheduling independent multiprocessor tasks on a uniform k-processor system","volume":"20","author":"B\u0142a\u017cewicz","year":"1994","journal-title":"Parallel Computing"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(96)00126-9","article-title":"Scheduling multiprocessor tasks with chain constraints","volume":"94","author":"B\u0142a\u017cewicz","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB7","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s001860000089","article-title":"Scheduling UET task systems with concurrency on two parallel identical processors","volume":"52","author":"Brucker","year":"2000","journal-title":"Mathematical Methods in Operations Research"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB8","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/0885-064X(87)90009-4","article-title":"Bin packing with divisible item sizes","volume":"3","author":"Coffman","year":"1987","journal-title":"Journal of Complexity"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB9","first-page":"437","article-title":"Scheduling multiprocessor tasks on hypercubes","volume":"42","author":"Drozdowski","year":"1994","journal-title":"Bulletin of the Polish Academy of Sciences, Technical Sciences"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB10","first-page":"381","article-title":"On complexity of multiprocessor task scheduling","volume":"43","author":"Drozdowski","year":"1995","journal-title":"Bulletin of the Polish Academy of Sciences. Technical Series"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0377-2217(96)00123-3","article-title":"Scheduling multiprocessor tasks\u2013\u2013An overview","volume":"94","author":"Drozdowski","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1006\/jpdc.1996.0064","article-title":"Evaluation of design choices for gang scheduling using distributed hierarchical control","volume":"35","author":"Feitelson","year":"1996","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB13","series-title":"Parallel Processing: The Cm* Experience","author":"Gehringer","year":"1987"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB14","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/322047.322055","article-title":"Preemptive scheduling of uniform processor systems","volume":"25","author":"Gonzales","year":"1978","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB16","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TC.1985.1676647","article-title":"An approximation algorithm for diagnostic test scheduling in multicomputer systems","volume":"34","author":"Krawczyk","year":"1985","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB17","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1109\/71.282559","article-title":"Job scheduling is more important than processor allocation for hypercube computers","volume":"5","author":"Krueger","year":"1994","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB18","series-title":"Job Scheduling Strategies for Parallel Processing: Proceedings of IPPS\u201997 Workshop","first-page":"117","article-title":"PScheD: Political scheduling on the CRAY T3E","volume":"1291","author":"Lagerstrom","year":"1997"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0166-218X(93)E0151-N","article-title":"Preemptive scheduling with variable profile, precedence constraints and due dates","volume":"58","author":"Liu","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB21","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/321574.321586","article-title":"Preemptive scheduling of real-time tasks on multiprocessor systems","volume":"17","author":"Muntz","year":"1970","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB22","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s002360050143","article-title":"Machine scheduling with availability constraints","volume":"35","author":"Sanlaville","year":"1998","journal-title":"Acta Informatica"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB23","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01920917","article-title":"Scheduling on semi-identical processors","volume":"28","author":"Schmidt","year":"1984","journal-title":"Zeitschrift f\u00fcr Operations Research A"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","article-title":"Scheduling with limited machine availability","volume":"121","author":"Schmidt","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB25","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communications delays","volume":"16","author":"Veltman","year":"1990","journal-title":"Parallel Computing"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB26","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/71.89064","article-title":"The effect of scheduling discipline on spin overhead in shared memory parallel systems","volume":"2","author":"Zahorjan","year":"1991","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10.1016\/S0377-2217(02)00760-9_BIB27","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/71.205653","article-title":"On job scheduling on a hypercube","volume":"4","author":"Zhu","year":"1993","journal-title":"IEEE Transactions on Parallel and Distributed Systems"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007609?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007609?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T02:57:03Z","timestamp":1553914623000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702007609"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00760-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}