Stochastic scheduling with variable profile and precedence constraints

SIAM Journal on Computing

Volumn 26, Issue 1, 1997, Pages 173-187

  Liu, Zhen ^a   Sanlaville, Eric ^b  

^a INRIA   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

In forest; Interval order; Makespan; Out forest; Precedence constraint; Profile scheduling; Stochastic ordering; Stochastic scheduling; Uniform processors

Indexed keywords

EID: 3142582899     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539791218949     Document Type: Article

References (17)

1. J. BRUNO, On scheduling tasks with exponential service times and in-tree precedence constraints, Acta Inform., 22 (1985), pp. 138-148.
2. K. M. CHANDY AND P. F. REYNOLDS, Scheduling partially ordered tasks with probabilistic execution times, Oper. System Rev., 9 (1975), pp. 169-177.
3. E. G. COFFMAN AND Z. LIU, On the optimal stochastic scheduling of out-forests, Oper. Res., 40 (1992), pp S67-S75.
4. D. DOLEV AND M. K. WARMUTH, Scheduling precedence graphs of bounded height, J. Algorithms, 5 (1984), pp. 48-59.
5. D. DOLEV AND M. K. WARMUTH, Scheduling flat graphs, SIAM J. Comput., 14 (1985), pp. 638-657.
6. D. DOLEV AND M. K. WARMUTH, Profile scheduling of opposing forests and level orders, SIAM J. Algebraic Discrete Meth., 6 (1985), pp. 665-687.
7. E. FROSTIG, A stochastic scheduling problem with intree precedence constraints, Oper. Res., 36 (1988), pp. 937-943.
8. M. R. GAREY, D. S. JOHNSON, R. E. TARJAN, AND M. YANAKAKIS, Scheduling opposite forests, SIAM J. Algebraic Discrete Meth., 4 (1983), pp. 72-93.
9. V. G. KULKARI AND P. F. CHIMENTO, JR., Optimal scheduling of exponential tasks with intree precedence constraints on two parallel processors subject to failure and repair, Oper. Res., 40 (1992), pp. S263-S271.
10. Z. LIU AND E. SANLAVILLE, Stochastic scheduling with variable profile and precedence constraints, Research Report 1525, INRIA, Valbonne, France, 1991.
11. Z. LIU AND E. SANLAVILLE, Preemptive scheduling with variable profile, precedence constraints and due dates, Research Report 1622, INRIA, Valbonne, France, 1992; Discrete Appl. Math., 58 (1996), pp. 253-280.
12. Z. LIU AND E. SANLAVILLE, Preemptive scheduling with variable profile, precedence constraints and due dates, Research Report 1622, INRIA, Valbonne, France, 1992; Discrete Appl. Math., 58 (1996), pp. 253-280.
13. C. H. PAPADIMITRIOU AND J. N. TSITSIKLIS, On stochastic scheduling with in-tree precedence constraints, SIAM J. Comput., 16 (1987), pp. 1-6.
14. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Scheduling interval-ordered tasks, SIAM J. Comput., 8 (1979), pp. 406-409.
15. M. PINEDO AND G. WEISS, Scheduling jobs with exponentially distributed processing times and in-tree precedence constraints of two parallel machines, Oper. Res., 33 (1985), pp. 1381-1388.
16. V. STRASSEN, The existence of probability measures with given marginals, Ann. Mat. Stat., 36 (1965), pp. 423-439.
17. J. D. ULLMAN, NP-complete scheduling problems, J. Comput. System Sci., 10 (1975), pp. 384-393.