{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:58:30Z","timestamp":1772297910888,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0167-8191(00)00035-1","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T08:06:40Z","timestamp":1051258000000},"page":"1195-1211","source":"Crossref","is-referenced-by-count":28,"title":["Scheduling preemptable tasks on parallel processors with limited availability"],"prefix":"10.1016","volume":"26","author":[{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Drozdowski","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Formanowicz","sequence":"additional","affiliation":[]},{"given":"Wies\u0142aw","family":"Kubiak","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(00)00035-1_BIB1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1018994726051","article-title":"Preemptive multiprocessor task scheduling with release times and time windows","volume":"70","author":"Bianco","year":"1997","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB2","first-page":"155","article-title":"Deterministyczne problemy szeregowania zadan na rownoleglych procesorach, Cz. I. Zbiory zadan zaleznych","volume":"6","author":"B\u0142a\u017cewicz","year":"1976","journal-title":"Podstawy sterowania"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB3","doi-asserted-by":"crossref","unstructured":"J. B\u0142a\u017cewicz, K. Ecker, E. Pesch, G. Schmidt, J. W\u0229glarz, Scheduling Computer and Manufacturing Processes, Springer, Berlin, 1996","DOI":"10.1007\/978-3-662-03217-6"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB4","doi-asserted-by":"crossref","unstructured":"D. Dolev, M. Warmuth, Scheduling flat graphs, SIAM Journal on Computing 14 (3) (1985) 638\u2013657","DOI":"10.1137\/0214047"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/mnsc.32.3.341","article-title":"Preemptive scheduling of uniform processors by ordinary network flow techniques","volume":"32","author":"Federgruen","year":"1986","journal-title":"Management Science"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB6","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB7","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\/S0167-8191(00)00035-1_BIB8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/322047.322055","article-title":"Preemptive scheduling of uniform processor systems","volume":"25","author":"Gonzalez","year":"1978","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB9","doi-asserted-by":"crossref","unstructured":"K.S. Hong, J.Y.-T. Leung, On-line scheduling of real-time tasks, IEEE Transactions on Computers 41 (10) (1992) 1326\u20131331","DOI":"10.1109\/12.166609"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB10","unstructured":"W. Kubiak, J. B\u0142a\u017cewicz, P. Formanowicz, J. Breit, G. Schmidt, Flow shops with limited machine availability, submitted for publication, 1997"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB11","doi-asserted-by":"crossref","unstructured":"J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnoy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W.R. Pulleyblank (Ed.), Progress in Combinatorial Optimization, Academic Press, New York, 1984, pp. 245\u2013261","DOI":"10.1016\/B978-0-12-566780-7.50020-9"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB12","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/322092.322101","article-title":"Preemptive scheduling of unrelated parallel processors by linear programming","volume":"25","author":"Lawler","year":"1978","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB13","unstructured":"C.-Y. Lee, Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint, reaserch report, Department of Industrial and Systems Engineering, University of Florida, 1995"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB14","unstructured":"C.L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill, New York, 1968"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB15","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\/S0167-8191(00)00035-1_BIB16","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\/S0167-8191(00)00035-1_BIB17","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\/S0167-8191(00)00035-1_BIB18","first-page":"153","article-title":"Scheduling on semi-identical processors","volume":"28","author":"Schmidt","year":"1984","journal-title":"Zeitschrift f\u00fcr Operations Research A"},{"key":"10.1016\/S0167-8191(00)00035-1_BIB19","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"Journal of Computer System Sciences"},{"issue":"3","key":"10.1016\/S0167-8191(00)00035-1_BIB20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0041-5553(82)90143-4","article-title":"Minimization of the maximum delay in servicing systems with interruption","volume":"22","author":"Vizing","year":"1982","journal-title":"USSR Computational Mathematics and Mathematical Physics"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000351?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000351?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:02:24Z","timestamp":1578520944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819100000351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0167819100000351"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(00)00035-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}