Stochastic machine scheduling with precedence constraints

SIAM Journal on Computing

Volumn 34, Issue 4, 2005, Pages 788-802

  Skutella, Martin ^a   Uetz, Marc ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Approximation algorithms; List scheduling algorithms; LP relaxation; Parallel machines; Precedence constraints; Release dates; Stochastic scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBABILITY; SCHEDULING;

APPROXIMATION ALGORITHMS; LIST SCHEDULING ALGORITHMS; LP-RELAXATION; PARALLEL MACHINES; PRECEDENCE CONSTRAINTS; RELEASE DATES; STOCHASTIC SCHEDULING;

STOCHASTIC CONTROL SYSTEMS;

EID: 24344463067     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702415007     Document Type: Article

References (24)

1. J. L. BRUNO, P. J. DOWNEY, AND G. N. FREDERICKSON, Sequencing tasks with exponential service times to minimize the expected flowtime or makespan, J. ACM, 28 (1981), pp. 100-113.
2. S. CHAKRABARTI AND S. MUTHUKRISHNAN, Resource scheduling for parallel database and scientific applications, in Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, Padua, Italy, 1996, pp. 329-335.
3. K. M. CHANDY AND P. F. REYNOLDS, Scheduling partially ordered tasks with probabilistic execution times, Oper. Syst. Rev., 9 (1975), pp. 169-177.
4. C. CHEKURI, R. JOHNSON, R. MOTWANI, B. NATARAJAN, B. RAU, AND M. SCHLANSKER, An analysis of profile-driven instruction level parallel scheduling with application to super blocks, in Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture, Paris, France, 1996, pp. 58-69.
5. C. CHEKURI, R. MOTWANI, B. NATARAJAN, AND C. STEIN, Approximation techniques for average completion time scheduling, SIAM J. Comput., 31 (2001), pp. 146-166.
6. A. FIAT AND G. J. WOEGINGER, EDS., Online Algorithms: The State of the Art, Lecture Notes in Comput. Sci. 1442, Springer, Berlin, 1998.
7. R. L. GRAHAM, Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45 (1966), pp. 1563-1581.
8. R. L. GRAHAM, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 416-429.
9. R. L. GRAHAM, E. L. LAWLER, J. K. LENSTRA, AND A. H. G. RINNOOY KAN, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann. Discrete Math., 5 (1979), pp. 287-326.
10. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, 2nd ed., Algorithms and Combinatorics 2, Springer, Berlin, 1993.
11. W. J. HALL AND J. A. WELLNER, Mean residual life, in Proceedings of the International Symposium on Statistics and Related Topics, M. Csörgö, D. A. Dawson, J. N. K. Rao, and A. K. Md. E. Saleh, eds., Ottawa, ON, 1981, North-Holland, Amsterdam, pp. 169-184.
12. T. KÄMPKE, On the optimality of static priority policies in stochastic scheduling on parallel machines, J. Appl. Probab., 24 (1987), pp. 430-448.
13. E. KOUTSOUPIAS AND C. H. PAPADIMITRIOU, Beyond competitive analysis, SIAM J. Comput., 30 (2000), pp. 300-317.
14. R. H. MÖHRING, F. J. RADERMACHER, AND G. WEISS, Stochastic scheduling problems I: General strategies, ZOR - Math. Methods Oper. Res., 28 (1984), pp. 193-260.
15. R. H. MÖHRING, A. S. SCHULZ, AND M. UETZ, Approximation in stochastic scheduling: The power of LP-based priority policies, J. ACM, 46 (1999), pp. 924-942.
16. A. MUNIER, M. QUEYRANNE, AND A. S. SCHULZ, Approximation bounds for a general class of precedence constrained parallel machine scheduling problems, in Proceedings of the 6th International Conference on Integer Programming and Combinatorial Optimization, Houston, TX, 1998, R. Bixby, E. A. Boyd, and R. Z. Rios Mercado, eds., Lecture Notes in Comput. Sci. 1412, Springer, Berlin, pp. 367-382.
17. M. SCHARBRODT, T. SCHICKINGER, AND A. STEGER, A new average case analysis for completion time scheduling, in Proceedings of the 34th ACM Symposium on Theory of Computing, Montréal, QB, 2002, pp. 170-178.
18. A. S. SCHULZ, Polytopes and Scheduling, Ph.D. thesis, Institut für Mathematik, Technische Universität Berlin, Germany, 1996.
19. P. SCHUURMAN AND G. J. WOEGINGER, Polynomial time approximation algorithms for machine scheduling: Ten open problems, J. Scheduling, 2 (1999), pp. 203-213.
20. M. SKUTELLA AND M. UETZ, Scheduling precedence-constrained jobs with stochastic processing times on parallel machines, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, ACM, New York, 2001, pp. 589-590.
21. M. UETZ, Algorithms for Deterministic and Stochastic Scheduling, Cuvillier Verlag, Göttingen, Germany, 2002.
22. M. UETZ, When greediness fails: Examples from stochastic scheduling, Oper. Res. Lett., 31 (2003), pp. 413-419.
23. G. WEISS, Turnpike optimality of Smith's rule in parallel machines stochastic scheduling, Math. Oper. Res., 17 (1992), pp. 255-270.
24. G. WEISS AND M. PINEDO, Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions, J. Appl. Probab., 17 (1980), pp. 187-202.