{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:25:04Z","timestamp":1747578304193},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_37","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"443-454","source":"Crossref","is-referenced-by-count":3,"title":["An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications"],"prefix":"10.1007","author":[{"given":"Evripidis","family":"Bampis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodolphe","family":"Giroudeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"37_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-48311-X_47","volume-title":"EuroPar\u201999 Parallel Processing","author":"E. Bampis","year":"1999","unstructured":"E. Bampis, R. Giroudeau, and J.-C. K\u00f6nig. Using duplication for the precedence constrained multiprocessor scheduling problem with hierarchical communications. In P. Amestoy, P. Berger, M. Dayd\u00e9, I. Duff, V. Frayss\u00e9, L. Giraud, and D. Ruiz, editors, EuroPar\u201999 Parallel Processing, Lecture Notes in Computer Science, No. 1685, pages 369\u2013372. Springer-Verlag, 1999."},{"key":"37_CR2","unstructured":"E. Bampis, R. Giroudeau, and J.C. K\u00f6nig. On the hardness of approximating the precedence constrained multiprocessor scheduling problem with hierarchical communications. Technical Report 34, Universit\u00e9 d\u2019Evry Val d\u2019Essonne, submitted, 1999."},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"B. Chen, C.N. Potts, and G.J. Woeginger. A review of machine scheduling: complexity, algorithms and approximability. Technical Report Woe-29, TU Graz, 1998.","DOI":"10.1007\/978-1-4613-0303-9_25"},{"key":"37_CR4","unstructured":"P. Chr\u00e9tienne, E.J. Coffman Jr, J.K. Lenstra, and Z. Liu. Scheduling Theory and its Applications. Wiley, 1995."},{"key":"37_CR5","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability, a Guide to the Theory of NP-Completeness. Freeman, 1979."},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministics sequencing and scheduling theory: a survey. Ann. Discrete Math., 5:287\u2013326, 1979.","journal-title":"Ann. Discrete Math."},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"J.A. Hoogeveen, J.K. Lenstra, and B. Veltman. Three, four, five, six, or the complexity of scheduling with communication delays. O. R. Lett., 16(3), 1994.","DOI":"10.1016\/0167-6377(94)90024-8"},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1287\/opre.45.1.145","volume":"45","author":"A. Munier","year":"1997","unstructured":"A. Munier and J.C. K\u00f6nig. A heuristic for a scheduling problem with communication delays. Operations Research, 45(1):145\u2013148, 1997.","journal-title":"Operations Research"},{"key":"37_CR9","unstructured":"C. Picouleau. Etude des probl\u00e8mes d\u2019optimisation dans les syst\u00e8mes distribu\u00e9s. PhD thesis, Universit\u00e9 de Paris VI, 1992."},{"key":"37_CR10","volume-title":"Multiprocessor scheduling with communications delays","author":"B. Veltman","year":"1993","unstructured":"B. Veltman. Multiprocessor scheduling with communications delays. PhD thesis, CWI-Amsterdam, Holland, 1993."}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T14:10:11Z","timestamp":1556719811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}