{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T02:27:26Z","timestamp":1767839246728,"version":"3.49.0"},"reference-count":14,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1051\/ro\/2013028","type":"journal-article","created":{"date-parts":[[2013,3,7]],"date-time":"2013-03-07T07:41:59Z","timestamp":1362642119000},"page":"73-87","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling an interval ordered precedence graph with communication delays and a limited number of processors"],"prefix":"10.1051","volume":"47","author":[{"given":"Alix Munier","family":"Kordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fadi","family":"Kacem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Dupont de Dinechin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucian","family":"Finta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2013,3,7]]},"reference":[{"key":"R1","unstructured":"Ali H.H. and El.-Rewini H.H., An optimal algorithm for scheduling interval ordered tasks with communication on processors.J. Comput. Syst. Sci.2(1995) 301\u2013307."},{"key":"R2","unstructured":"P. Chr\u00e9tienne and C. Picouleau, Scheduling with communication delays : a survey. inScheduling Theory and its Applications,edited P. Chr\u00e9tienne, E.G. Coffman, J.K. Lenstra and Z. Liu. John Wiley Ltd (1995) 65\u201389."},{"key":"R3","unstructured":"B. Dupont de Dinechin, Scheduling monotone interval orders on typed task systems. InPLANSIG 2007, 26th Worshop of the UK Planning and Scheduling Special Interest Group(2007) 25\u201331."},{"key":"R4","unstructured":"Giroudeau R., Konig J.-C., Moulai F.K. and Palaysi J., Complexity and approximation for precedence constrained scheduling problems with large communication delays.Theor. Comput. Sci.401(2008) 107\u2013119."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Horn W., Some simple scheduling algorithms.Naval Research Logistics Quarterly21(1974) 177\u2013185.","DOI":"10.1002\/nav.3800210113"},{"key":"R6","unstructured":"Hwang J., Chow Y., Anger F. and Lee C., Scheduling precedence graphs in systems with interprocessor communication times.SIAM J. Comput.18(1989) 244\u2013257."},{"key":"R7","unstructured":"Jansen K., Analysis of Scheduling Problems with Typed Task Systems.Discrete Appl. Math.52(1994) 223\u2013232."},{"key":"R8","unstructured":"Leung A., Palem K.V. and Pnueli A., Scheduling Time-Constrained Instructions on Pipelined Processors.ACM Transact. Program. Languages Syst.23(2001) 73\u2013103."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Palem K. and Simons B., Scheduling time-critical instructions on risc machines.ACM Transactions on Programming Languages and Systems4(1993) 632\u2013658.","DOI":"10.1145\/155183.155190"},{"key":"R10","unstructured":"Papadimitriou C.H and Yannakakis M., Scheduling interval-ordered tasks.SIAM J. Comput.8(1979) 405\u2013409."},{"key":"R11","unstructured":"Veltman B., Lageweg B.J. and Lenstra J.K., Multiprocessor scheduling with communication delays.Parallel Comput.16(1990) 173\u2013182."},{"key":"R12","unstructured":"J. Verriet, The complexity of scheduling typed task systems with and without communication delays. External Report 1998-26, UU-CS (1998)."},{"key":"R13","unstructured":"Verriet J., Scheduling interval-ordered tasks with non-uniform deadlines subject to non-zero communication delays.Parallel Comput.25(1999) 3\u201321."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Yu W., Hoogeveen H. and Lenstra J.K., Minimizing makespan in a two-machine flow shop with delays and unit-time operations is np-hard.J. Scheduling7(2004) 333\u2013348.","DOI":"10.1023\/B:JOSH.0000036858.59787.c2"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2013028\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T11:59:09Z","timestamp":1562759949000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2013028"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":14,"journal-issue":{"issue":"1"},"alternative-id":["ro130028"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2013028","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}