Scheduling under uncertainty: Optimizing against a randomizing adversary

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1913, Issue , 2000, Pages 15-26

  Möhring, Rolf H ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; SCHEDULING;

COMBINATORIAL PROPERTIES; COMPLETE INFORMATION; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; DETERMINISTIC MODELS; PERFORMANCE SPACES; PROJECT SCHEDULING; RESOURCE CONSTRAINT; SCHEDULING UNDER UNCERTAINTY;

APPROXIMATION ALGORITHMS;

EID: 84937392030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44436-x_3     Document Type: Conference Paper

References (19)

1. P. Brucker, A. Drexl, R. H. Mohring, K. Neumann, and E. Pesch. Resourceconstrained project scheduling: Notation, classification, models, and methods. European J. Oper. Res., 112(1):3–41, 1999.
2. D. R. Fulkerson. Expected critical path lengths in PERT networks. Oper. Res., 10:808–817, 1962.
3. K. D. Glazebrook and J. Nino-Mora. Schedulingm ulticlass queuing networks on parallel servers: Approximate and heavy-traffic optimality of Klimov’s rule. In R. Burkard and G. Woeginger, editors, Algorithms — ESA’97, 5th Annual European Symposium, pages 232–245. Springer-Verlag, Lecture Notes in Computer Science, vol. 1284, 1997.
4. M. H. Goldwasser and R. Motwani. Complexity measures for assembly sequences. International Journal of Computational Geometry and Applications. To apear.
5. R. L. Graham. Bounds on multiprocessingt iminga nomalies. Bell Systems Tech. Journal, 45:1563–1581, 1968.
6. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Schedulingt o minimize average completion time: off-line and on-line approximation algorithms. Mathematics Oper. Res., 22(3):513–544, 1997.
7. U. Heller. On the shortest overall duration in stochastic project networks. Methods Oper. Res., 42:85–104, 1981.
8. G. Igelmund and F. J. Radermacher. Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks, 13:1–28, 1983.
9. R. H. Mohring and F. J. Radermacher. Introduction to stochastic scheduling problems. In K. Neumann and D. Pallaschke, editors, Contributions to Operations Research, Proceedings of the Oberwolfach Conference on Operations Research, 1984, pages 72–130. Springer-Verlag, Lecture Notes in Economics and Mathematical Systems, vol. 240, 1985.
10. R. H. Mohring, F. J. Radermacher, and G. Weiss. Stochastic scheduling problems II – Set strategies. Z. Oper. Res. Ser. A, 29:65–104, 1985.
11. R. H. Mohring, A. S. Schulz, and M. Uetz. Approximation in stochastic scheduling: the power of LP-based priority policies. J. Assoc. Comp. Mach., 46(6):924–942, 1999.
12. R. H. Möhring, M. Skutella, and F. Stork. Scheduling with AND/OR precedence constraints. Technical Report 646, Technische Universit¨at Berlin, Fachbereich Mathematik, Berlin, Germany, 1999. Revised July 2000.
13. R. H. Möhring, M. Skutella, and F. Stork. Forcing relations for AND/OR precedence constraints. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, pages 235–236, 2000.
14. R. H. Mhring and F. Stork. Linear preselective strategies for stochastic project scheduling. Technical Report 612, Technische Universitat Berlin, Fachbereich Mathematik, Berlin, Germany, 1998. To appear in and Mathematical Methods of Operations Research.
15. F. J. Radermacher. Analytical vs. combinatorial characterizations of well-behaved strategies in stochastic scheduling. Methods Oper. Res., 53:467–475, 1986.
16. J. Sgall. On-line scheduling. In A. Fiat and G. J. Woeginger, editors, Online Algorithms: The State of the Art, pages 196–231. Springer-Verlag, Lecture Notes in Computer Science, vol. 1442, 1998.
17. F. Stork. A branch-and-bound algorithm for minimizing expected makespan in stochastic project networks with resource constraints. Technical Report 613, Technische Universit¨at Berlin, Fachbereich Mathematik, Berlin, Germany, 1998.
18. G. Weiss and M. Pinedo. Schedulingt asks with exponential service times on nonidentical processors to minimize various cost functions. J. Appl. Prob., 17:187–202, 1980.
19. U. Zwick and M. Paterson. The complexity of Mean Payoff Games on graphs. Theor. Comp. Sc., 158:343–359, 1996.