The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates

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

Volumn 2081, Issue , 2001, Pages 45-59

  Chou, Cheng Feng Mabel ^a   Queyranne, Maurice ^b   Simchi Levi, David ^c  

^a NORTHWESTERN UNIVERSITY   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; SCHEDULING ALGORITHMS;

ASYMPTOTIC PERFORMANCE RATIO; ASYMPTOTICALLY OPTIMAL; ON-LINE ALGORITHMS; ONLINE ENVIRONMENTS; OPTIMAL SOLUTIONS; PROBABILISTIC ASSUMPTIONS; SINGLE MACHINE PROBLEMS; UNIFORM PARALLEL MACHINE SCHEDULING;

JOB SHOP SCHEDULING;

EID: 84947273794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_4     Document Type: Conference Paper

References (12)

1. Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: (1997). Approximation Techniques for Average Completion Time Scheduling. Proceedings of the Eight Annual ACM-SIAM Symposium on Discrete Algorithms (1997) 609-618
2. Eastman, W. L., Even, S., Isaacs, I. M.: Bounds for the Optimal Scheduling of n Jobs on m Processors. Management Science 11 (1964) 268-279
3. Goemans, M. X.: Improved Approximation Algorithms for Scheduling with Release Dates. Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms (1997) 591-598
4. Goemans, M. X., Queyranne, M., Schulz, A. S., Skutella, M., Wang, Y.: Single Machine Scheduling with Release Dates. Report 654, Fachbereich Mathematik (1999), Technische Universitat Berlin, Germany. Available at URL: http://www.mathtu-berlin.de/coga/publications/techreports/1999/Report-654-1999.html
5. Graham, R.L., Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
6. Kaminsky, P., Simchi-Levi, D.: Probabilistic Analysis of an On-Line Algorithm for the Single Machine Completion Time Problem With Release Dates. Under review (1997)
7. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: Sequencing and Scheduling: Algorithms and Complexity. In: S. C. Graves, A. H. G. Rinnooy Kan and P. H. Zipkin (eds.), Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4 (1993), North-Holland, Amsterdam.
8. Lenstra, J. K., Rinnooy Kan, A. H. G., Brucker, P.: Complexity of Machine Scheduling Problems. Annals of Discrete Math 1 (1977) 343-362
9. Queyranne, M., Sviridenko, M.: Approximation algorithms for shop scheduling problems with minsum objective. Faculty of Commerce, University of British Columbia (1999)
10. Sgall, J.: On-line scheduling — a survey. In: A. Fiat and G.J. Woeginger (eds.), Online Algorithms: The State of the Art, Lecture Notes in Computer Science 1442 (1998) 196-231, Springer, Berlin.
11. Smith, W.: Various optimizers for single-stage production. Naval Res. Logist. Quart. 3 (1956) 59-66
12. Uma, R. N., Wein, J.: On the Relationship between Combinatorial and LP-Based Approaches to NP-hard Scheduling Problems. In: R. E. Bixby, E. A. Boyd and R. Z. Rios-Mercado (eds.), Integer Programming and Combinatorial Optimization. Proceedings of the Sixth International IPCO Conference, Lecture Notes in Computer Science 1412 (1998) 394-408, Springer, Berlin.