{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:57:16Z","timestamp":1761487036428},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004,1]]},"DOI":"10.1016\/s0167-8191(03)00091-7","type":"journal-article","created":{"date-parts":[[2003,9,17]],"date-time":"2003-09-17T00:11:16Z","timestamp":1063757476000},"page":"103-120","source":"Crossref","is-referenced-by-count":14,"title":["Sensitivity analysis of tree scheduling on two machines with communication delays"],"prefix":"10.1016","volume":"30","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Guinand","sequence":"first","affiliation":[]},{"given":"Aziz","family":"Moukrim","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Sanlaville","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/S0167-8191(03)00091-7_BIB1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"6","author":"Hu","year":"1961","journal-title":"Operations Research"},{"issue":"17","key":"10.1016\/S0167-8191(03)00091-7_BIB2","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"2","author":"Graham","year":"1969","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","article-title":"UET scheduling with interprocessor communication delays","volume":"18","author":"Rayward-Smith","year":"1987","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0377-2217(89)90216-6","article-title":"A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints","volume":"43","author":"Chr\u00e9tienne","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB5","unstructured":"E. Lawler, J.K. Lenstra, A.H.G, Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, Technical Report BS-R8909, CWI Amsterdam, 1989"},{"issue":"2","key":"10.1016\/S0167-8191(03)00091-7_BIB6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","article-title":"Towards an architecture-independent analysis of parallel algorithms","volume":"19","author":"Papadimitriou","year":"1990","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB7","unstructured":"A. Wagelmans, Sensitivity Analysis in Combinatorial Optimization, Ph.D. Thesis, Erasmus Universiteit Rotterdam, 1990"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB8","doi-asserted-by":"crossref","unstructured":"A. Jakoby, R. Reischuk, The complexity of scheduling problems with communication delays for trees, in Lecture Notes in Computer Sciences 621 (1992) 165\u2013177","DOI":"10.1007\/3-540-55706-7_15"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB9","unstructured":"C. Picouleau, Etude des probl\u00e8mes d\u2019optimisation dans les syst\u00e8mes distribu\u00e9s, Ph.D. Thesis, Paris VI, 1992"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB10","unstructured":"R. Saad, Scheduling with communication delays, Technical Report 754, LRI, University of Paris-Sud, Paris, France, 1992"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB11","unstructured":"E.L. Lawler, Scheduling trees on multiprocessors with unit communication delays, Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni, Lake Como, Italy, June 14\u201318, 1993"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB12","unstructured":"B. Veltman, Multiprocessor scheduling with communication delays, Ph.D. Thesis, University of Technology of Eindhoven, Department of Operations Research, Amsterdam, The Netherland, 1993"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB13","unstructured":"M. Veldhorst, A Linear Time Algorithm for Scheduling Trees with Communication Delays Optimally on two Machines, Technical Report RUU-CS-93-04, Department of Computer Sciences, Utrecht, 1993"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB14","series-title":"Scheduling Theory and its Applications","article-title":"Scheduling with communication delays: a survey","author":"Chr\u00e9tienne","year":"1994"},{"issue":"55","key":"10.1016\/S0167-8191(03)00091-7_BIB15","article-title":"Sensitivity analysis of list scheduling heuristics","volume":"2","author":"Kolen","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB16","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/S0377-2217(00)00281-2","article-title":"Sensitivity analysis of scheduling algorithms","volume":"134","author":"Penz","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB17","unstructured":"P. Brucker, T.C.E. Cheng, S. Knust, N.V. Shakhlevich, Complexity Results for Shop Problems with Transportation Delays, Osnabr\u00fccker Schriften zur Mathematik, Reihe P, No. 228, 2001. Available from: <http:\/\/www.mathematik.uni-osnabruck.de\/staff\/phpages\/bruckerp.rdf.html>"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB18","series-title":"Parallel Algorithms for Irregular Problems: State-of-the-Art","first-page":"245","article-title":"Applications of graph scheduling techniques in parallelizing irregular scientific computations","author":"Gerasoulis","year":"1995"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1996.0007","article-title":"The complexity of scheduling trees with communication delays","volume":"20","author":"Lenstra","year":"1996","journal-title":"Journal of Algorithms"},{"issue":"10","key":"10.1016\/S0167-8191(03)00091-7_BIB20","doi-asserted-by":"crossref","DOI":"10.1109\/71.539738","article-title":"Scheduling in and out forests in the presence of communication delays","volume":"7","author":"Varvarigou","year":"1996","journal-title":"IEEE Transaction on Parallel and Distributed Systems"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB21","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48311-X_45","article-title":"Scheduling with communication delays and on-line disturbances","volume":"1685","author":"Moukrim","year":"1999","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB22","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1051\/ro:2000101","article-title":"Optimal scheduling of UECT trees on two processors","volume":"34","author":"Guinand","year":"2000","journal-title":"RAIRO Operation Research"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB23","unstructured":"F. Guinand, A. Moukrim, E. Sanlaville, Sensitivity Analysis of Tree-Scheduling Algorithms, Technical Report 2002, Universit\u00e9 de Technologie de Compi\u00e8gne, 2002"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB24","doi-asserted-by":"crossref","unstructured":"D. Anderson, J. Cobb, E. Korpela, M. Lebofsky, D. Werthimer, Seti@Home: an experiment in public resource computing, Communication of the ACM 45(11) (2002) 56\u201361","DOI":"10.1145\/581571.581573"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB25","unstructured":"The European DataGrid: Project Overview and Testbed Experience, 2nd ApGrid Workshop, Taipei, Taiwan, May 2002"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB26","doi-asserted-by":"crossref","unstructured":"I. Foster, C. Kesselman, Globus: A Metacomputing Infrastructure Toolkit. International Journal of Supercomputer Applications, 11(2), 115\u2013128, 1997. Web: http:\/\/www.globus.org","DOI":"10.1177\/109434209701100205"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB27","doi-asserted-by":"crossref","unstructured":"G. Fedak, C. Germain, V. N\u00e9ri, F. Cappello, XtremWeb: a generic global computing system, Proceedings of CCGrid 2001, may 2001","DOI":"10.1109\/CCGRID.2001.923246"},{"key":"10.1016\/S0167-8191(03)00091-7_BIB28","unstructured":"D. Arnold, S. Agrawal, S. Blackford, J. Dongarra, M. Miller, K. Seymour, K. Sagi, Z. Shi, S. Vadhiyar, User\u2019s guide to Netsolve v 1.4.1, Technical Report No ICL-UT-02-05. University of Tennessee, Knoxville, 2002"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000917?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000917?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T07:25:06Z","timestamp":1550993106000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0167819103000917"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00091-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}