{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:22:45Z","timestamp":1648538565335},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1989,11]]},"DOI":"10.1007\/bf01415940","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T15:15:24Z","timestamp":1112541324000},"page":"423-437","source":"Crossref","is-referenced-by-count":2,"title":["Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints"],"prefix":"10.1007","volume":"33","author":[{"given":"W.","family":"Kubiak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Baer JL (1974) Optimal scheduling on two processors of different speeds. In: Glelenbe E, Mahl R (eds) Computer architectures and networks. North Holland, pp 27?45"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz J, Lenstra JK, Rinnooy Kan AHG (1983) Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math 5:11?24","journal-title":"Discrete Appl Math"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman Jr","year":"1972","unstructured":"Coffman EG Jr, Graham RL (1972) Optimal scheduling for two-processor systems. Acta Informat 1:200?213","journal-title":"Acta Informat"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0196-6774(84)90039-7","volume":"5","author":"D Dolev","year":"1984","unstructured":"Dolev D, Warmuth MK (1984) Scheduling precedence graphs of bounded height. J Algorithms 5:48?59","journal-title":"J Algorithms"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1137\/0606066","volume":"6","author":"D Dolev","year":"1985","unstructured":"Dolev D, Warmuth MK (1985) Profile scheduling of opposing forests and level orders. SIAM J Algebraic and Discrete Methods 6:665?687","journal-title":"SIAM J Algebraic and Discrete Methods"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1145\/322326.322335","volume":"29","author":"HN Gabow","year":"1982","unstructured":"Gabow HN (1982) An almost-linear algorithm for two-processor scheduling. J Assoc Comput Mach 29:766?780","journal-title":"J Assoc Comput Mach"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Gabow HN, Tarjan RE (1983) A linear-time algorithm for a special case of disjoint set union. Proc. 15th Annual ACM Symp. Theory of Computing, pp 246?251","DOI":"10.1145\/800061.808753"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0604011","volume":"4","author":"MR Garey","year":"1983","unstructured":"Garey MR, Johnson DS, Tarjan RE, Yannakakis M (1983) Scheduling opposing forests. SIAM J Algebraic Discrete Methods 4:72?93","journal-title":"SIAM J Algebraic Discrete Methods"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"TC Hu","year":"1961","unstructured":"Hu TC (1961) Parallel sequencing and assembly line problems. Oper Res 9:841?848","journal-title":"Oper Res"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0196-6774(83)90045-7","volume":"4","author":"DS Johnson","year":"1983","unstructured":"Johnson DS (1983) The NP-completeness column: an ongoing guide. J Algorithms 4:189?203","journal-title":"J Algorithms"},{"key":"CR11","unstructured":"Kubiak W (1988) Exact and approximate algorithms for scheduling unit time tasks with tree-like precedence constraints. Abstracts EURO IX ? TIMS XXVIII, Paris, pp 195"},{"key":"CR12","volume-title":"Report BW 138","author":"BJ Lageweg","year":"1981","unstructured":"Lageweg BJ, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1981) Computer aided complexity classification of deterministic scheduling problems. Report BW 138, Mathematisch Centrum, Amsterdam, The Netherlands"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1145\/358690.363066","volume":"25","author":"BJ Lageweg","year":"1982","unstructured":"Lageweg BJ, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1982) Computer aided complexity classification of combinatorial problems. Comm ACM 25:812?822","journal-title":"Comm ACM"},{"key":"CR14","volume-title":"Proc. of Summer School on Combinatorial Optimization","author":"JK Lenstra","year":"1983","unstructured":"Lenstra JK, Rinnooy Kan AHG (1983) Scheduling theory since 1981: an annotated bibliography. In: Proc. of Summer School on Combinatorial Optimization, National Institute for Higher Education, Dublin, July 4?15"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman JD (1975) NP-complete scheduling problems. J Comput System Sri 10:384?393","journal-title":"J Comput System Sri"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415940.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01415940\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01415940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:12:37Z","timestamp":1556802757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01415940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["BF01415940"],"URL":"https:\/\/doi.org\/10.1007\/bf01415940","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}