On-line scheduling to minimize average completion time revisited

Operations Research Letters

Volumn 32, Issue 5, 2004, Pages 485-490

  Megow, Nicole ^a   Schulz, Andreas S ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithm; Competitive analysis; On line algorithm; Scheduling

Indexed keywords

ALGORITHMIC LANGUAGES; APPROXIMATION THEORY; COMPUTER AIDED ANALYSIS; DATA ACQUISITION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

COMPETITIVE ANALYSIS; COMPLETION TIME; ON-LINE ALGORITHM; PARALLEL MACHINES;

SCHEDULING;

EID: 2342628519     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2003.11.008     Document Type: Article

References (18)

1. F.N. Afrati, E. Bampis, C. Chekuri, D.R. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), New York, 1999, pp. 32-43.
2. E.J. Anderson, C.N. Potts, On-line scheduling of a single machine to minimize total weighted completion time, in: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, 2002, pp. 548-557.
3. Chekuri C., Motwani R., Natarajan B., Stein C. Approximation techniques for average completion time scheduling. SIAM J. Comput. 31:2001;146-166.
4. Eastman W.L., Even S., Isaacs I.M. Bounds for the optimal scheduling of. n jobs on m processors Management Sci. 11:1964;268-279.
5. Goemans M.X., Queyranne M., Schulz A.S., Skutella M., Wang Y. Single machine scheduling with release dates. SIAM J. Discrete Math. 15:2002;165-192.
6. Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling. a survey Ann. Discrete Math. 5:1979;287-326.
7. Hall L.A., Schulz A.S., Shmoys D.B., Wein J. Scheduling to minimize average completion time. off-line and on-line approximation algorithms Math. Oper. Res. 22:1997;513-544.
8. Hoogeveen J.A., Vestjens A.P.A. Optimal on-line algorithms for single-machine scheduling. Cunningham W.H., McCormick S.T., Queyranne M. Proceedings of the Fifth Conference on Integer Programming and Combinatorial Optimization (IPCO). Lecture Notes in Computer Science. Vol. 1084:1996;404-414 Springer, Berlin.
9. Labetoulle J., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Preemptive scheduling of uniform machines subject to release dates. Pulleyblank W.R. Progress in Combinatorial Optimization. 1984;245-261 Academic Press, New York.
10. Lenstra J.K., Rinnooy Kan A.H.G., Brucker P. Complexity of machine scheduling problems. Ann. Discrete Math. 1:1977;343-362.
11. Lu X., Sitters R.A., Stougie L. A class of on-line scheduling algorithms to minimize total completion time. Oper. Res. Lett. 31:2003;232-236.
12. Phillips C.A., Stein C., Wein J. Minimizing average completion time in the presence of release dates. Math. Program. 82:1998;199-223.
13. Schrage L. A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16:1968;687-690.
14. Schulz A.S., Skutella M. The power of. α -points in preemptive single machine scheduling J. Sched. 5:2002;121-133.
15. Schulz A.S., Skutella M. Scheduling unrelated machines by randomized rounding. SIAM J. Discrete Math. 15:2002;450-469.
16. Sleator D.D., Tarjan R.E. Amortized efficiency of list update and paging rules. Comm. ACM. 28:1985;202-208.
17. Smith W.E. Various optimizers for single-stage production. Naval Res. Logist. Quart. 3:1956;59-66.
18. A.P.A. Vestjens, On-line machine scheduling, Ph.D. Thesis, Eindhoven University of Technology, Netherlands, 1997.