Scheduling chains on uniform processors with communication delays

Journal of Scheduling

Volumn 5, Issue 6, 2002, Pages 459-476

  Kubiak, Wieslaw ^a   Penz, Bernard ^b   Trystram, Denis ^c  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b INP Grenoble ENSGI   (France)

^c INP Grenoble ENSIMAG   (France)

Author keywords

Chains; Communication delays; Scheduling; Uniform processors

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; OPTIMIZATION;

COMMUNICATION DELAYS; LINEAR TIME OPTIMIZATION; UNIFORM PROCESSORS;

SCHEDULING;

EID: 0345982865     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.121     Document Type: Article

References (10)

1. Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. Freeman: New York, 1979.
2. Brucker P, Hurink J, Kubiak W. Scheduling jobs with unit processing requirements and chain precedences on two uniform machines. Mathematical Methods of OR 1999; 49(2):211-219.
3. Gonzalez T, Sahni S. Preemptive scheduling of uniform processor systems. Journal of the Association for Computing Machinery 1978; 25:766-780.
4. McNaughton R. Scheduling with deadlines and loss functions. Management Science 1959; 6:1-12.
5. An overview of the Apache project, http://www-apache.imag.fr.
6. Lawler EL. Preemptive scheduling of precedence-constrained jobs on parallel machines. In Deterministic and Stochastic Scheduling, Dempster MAH, Lenstra JK, Rinnooy Kan AHG (eds). Reidel: Dordrecht, 1982.
7. Kubiak W. Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints. Zeitschrifts für Operations Research 1989; 33:423-437.
8. Gabow HN. An almost-linear algorithm for two-processor scheduling. Journal of the Association for Computing Machinery 1982; 29:766-780.
9. Blażewicz J, Guinand F, Penz B, Trystram D. Scheduling complete trees on two uniform processors with arbitrary speed ratios and communication delays. Parallel Processing Letters 2000; 10(4):267-277.
10. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin P (eds). Hand book in operations research and management science, Volume 4: Logistics of production and inventory, North-Holland, pp. 445-522.