论文信息 - Scheduling UET, UCT dags with release dates and deadlines

Scheduling UET, UCT dags with release dates and deadlines

The problem of scheduling precedence graphs for which every task has to be executed in a non-uniform interval is considered, with interprocessor communication delays. For the following classes of graphs we will present a polynomial time algorithm that nds minimumlateness schedules. 1. Outforests on two processors. 2. Series-parallel graphs and opposing forests with the least urgent parent property (to be de ned) on two processors. 3. Inforests with the least urgent parent property on m processors.

Jacques Verriet

[1] Jan Karel Lenstra,et al. The Complexity of Scheduling Trees with Communication Delays , 1996, J. Algorithms.

[2] Mihalis Yannakakis,et al. Scheduling Interval-Ordered Tasks , 1979, SIAM J. Comput..

[3] David S. Johnson,et al. Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness , 1977, Math. Oper. Res..

[4] T. C. Hu. Parallel Sequencing and Assembly Line Problems , 1961 .

[5] Hesham H. Ali,et al. The Time complexity of Scheduling Interval Orders with Communication Is Polynomial , 1993, Parallel Process. Lett..

[6] Václav Koubek,et al. A Reduct-and-Closure Algorithm for Graphs , 1979, MFCS.

[7] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.

[8] David S. Johnson,et al. Scheduling Tasks with Nonuniform Deadlines on Two Processors , 1976, J. ACM.

[9] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[10] David S. Johnson,et al. Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[11] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..