Stochastic machine scheduling: Performance guarantees for LP-based priority policies: (Extended abstract)

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

Volumn 1671, Issue , 1999, Pages 144-155

  Möhring, Rolf H ^a   Schulz, Andreas S ^b   Uetz, Marc ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUSINESS MACHINES; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SCHEDULING; STOCHASTIC SYSTEMS;

ASYMPTOTIC OPTIMALITY; DETERMINISTIC SCHEDULING; EXTENDED ABSTRACTS; IDENTICAL PARALLEL MACHINES; PERFORMANCE GUARANTEES; SCHEDULING POLICIES; TOTAL WEIGHTED COMPLETION TIME; WORST-CASE PERFORMANCE RATIO;

APPROXIMATION ALGORITHMS;

EID: 22644449438     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48413-4_16     Document Type: Conference Paper

References (25)

1. D. Bertsimas and J. Niño-Mora, Conservation laws, extended polymatroids and multi-armed bandit problems: A polyhedral approach to indexable systems, Mathematics of Operations Research, 21 (1996), pp. 257-306.
2. J. L. Bruno, E. G. Coffman Jr., and R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications of the Association for Computing Machinery, 17 (1974), pp. 382-387.
3. M. Dacre, K. D. Glazebrook, and J. Niño-Mora, The achievable region approach to the optimal control of stochastic systems, to appear in: Journal of the Royal Statistical Society.
4. W. L. Eastman, S. Even, and I. M. Isaacs, Bounds for the optimal scheduling of n jobs on m processors, Management Science, 11 (1964), pp. 268-279.
5. K. D. Glazebrook, Personal communication, January 1999.
6. K. D. Glazebrook and J. Niño-Mora, Scheduling multiclass queueing networks on parallel servers: Approximate and heavy-traffic optimality of Klimov's rule, in Algorithms–ESA'97, R. Burkard and G. Woeginger, eds., vol. 1284 of Lecture Notes in Computer Science, Springer, 1997, pp. 232-245. Proceedings of the 5th Annual European Symposium on Algorithms.
7. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnoy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5 (1979), pp. 287-326.
8. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to minimize average completion time: Off-line and on-line approximation algorithms, Mathematics of Operations Research, 22 (1997), pp. 513-544.
9. W. J. Hall and J. A. Wellner, Mean residual life, in Statistics and Related Topics, 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., North-Holland, 1981, pp. 169-184.
10. T. Kämpke, On the optimality of static priority policies in stochastic scheduling on parallel machines, Journal of Applied Probability, 24 (1987), pp. 430-448.
11. T. Kawaguchi and S. Kyan, Worst case bound on an LRF schedule for the mean weighted ow-time problem, SIAM Journal on Computing, 15 (1986), pp. 1119-1129.
12. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in Logistics of Production and Inventory, vol. 4 of Handbooks in Operations Research and Management Science, North-Holland, Amsterdam, 1993, pp. 445-522.
13. R. H. Möhring, F. J. Radermacher, and G. Weiss, Stochastic scheduling problems I: General strategies, ZOR-Zeitschrift für Operations Research, 28 (1984), pp. 193-260.
14. R. H. Möhring, F. J. Radermacher, and G. Weiss, Stochastic scheduling problems II: Set strategies, ZOR-Zeitschrift für Operations Research, 29 (1985), pp. 65-104.
15. R. H. Möhring, A. S. Schulz, and M. Uetz, Approximation in stochastic scheduling: The power of LP-based priority policies, Tech. Rep. 595/1998, Department of Mathematics, Technical University of Berlin, 1998.
16. C. A. Phillips, C. Stein, and J. Wein, Minimizing average completion time in the presence of release dates, Mathematical Programming, 82 (1998), pp. 199-223. A preliminary version of this paper (Scheduling jobs that arrive over time) appeared in vol. 955 of Lecture Notes in Computer Science, Springer, 1995, pp. 86-97.
17. M. H. Rothkopf, Scheduling with random service times, Management Science, 12 (1966), pp. 703-713.
18. A. S. Schulz, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds, in Integer Programming and Combinatorial Optimization, W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds., vol. 1084 of Lecture Notes in Computer Science, Springer, 1996, pp. 301-315. Proceedings of the 5th International IPCO Conference.
19. J. Sgall, On-line scheduling, in Online Algorithms: The State of the Art, A. Fiat and G. J. Woeginger, eds., vol. 1442 of Lecture Notes in Computer Science, Springer, 1998, pp. 196-231. Proceedings of the Dagstuhl Workshop on On-Line Algorithms.
20. W. E. Smith, Various optimizers for single-stage production, Naval Research and Logistics Quarterly, 3 (1956), pp. 59-66.
21. A. M. Spaccamela, W. S. Rhee, L. Stougie, and S. van de Geer, Probabilistic analysis of the minimum weighted owtime scheduling problem, Operations Research Letters, 11 (1992), pp. 67-71.
22. R. R. Weber, P. Varaiya, and J. Walrand, Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected owtime, Journal of Applied Probability, 23 (1986), pp. 841-847.
23. G. Weiss, Approximation results in parallel machines stochastic scheduling, Annals of Operations Research, 26 (1990), pp. 195-242.
24. G. Weiss, Turnpike optimality of Smith's rule in parallel machines stochastic schedul- ing, Mathematics of Operations Research, 17 (1992), pp. 255-270.
25. G. Weiss, Personal communication, January 1999.