Abstract
We analyze the competitive ratio of algorithms for minimizing (weighted) average completion time on identical parallel machines and prove that the well-known shortest remaining processing time algorithm (SRPT) is 5/4-competitive w.r.t. the average completion time objective. For weighted completion times we give a deterministic algorithm with competitive ratio 1.791 + o(m). This ratio holds for preemptive and non-preemptive scheduling.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: FOCS ’99, pp. 32–44 (1999)
Anderson, E.J., Potts, C.N.: Online scheduling of a single machine to minimize total weighted completion time. Math. Oper. Res. 29, 686–697 (2004)
Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: Approximation techniques for average completion time scheduling. SIAM Journal on Computing 31, 146–166 (2001)
Chou, M.C., Queyranne, M., Simchi-Levi, D.: The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates. Mathematical Programming 106, 137–157 (2006)
Chung, C., Nonner, T., Souza, A.: SRPT is 1.86-competitive for completion time scheduling. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, Texas), pp. 1373–1388 (2010)
Correa, J.R., Wagner, M.R.: LP-based online scheduling: from single to parallel machines. Mathematical Programming 119, 109–136 (2009)
Epstein, L., van Stee, R.: Lower bounds for on-line single-machine scheduling. Theoretical Computer Science 299, 439–450 (2003)
Goemans, M.X.: Improved approximation algorithms for scheduling with release dates. In: Proc. 8th Symp. on Discrete Algorithms, New Orleans, Louisiana, United States, pp. 591–598 (1997)
Goemans, M.X., Queyranne, M., Schulz, A.S., Skutella, M., Wang, Y.: Single machine scheduling with release dates. SIAM Journal on Discrete Mathematics 15, 165–192 (2002)
Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research 22, 513–544 (1997)
Hoogeveen, J.A., Vestjens, A.P.A.: Optimal on-line algorithms for single-machine scheduling. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 404–414. Springer, Heidelberg (1996)
Hussein, M.E., Schwiegelshohn, U.: Utilization of nonclairvoyant online schedules. Theoretical Computer Science 362, 238–247 (2006)
Jalliet, P., Wagner, R.M.: Almost sure asymptotic optimality for online routing and machine scheduling problems. Networks 55, 2–12 (2009)
Liu, P., Lu, X.: On-line scheduling of parallel machines to minimize total completion times. Computers and Operations Research 36, 2647–2652 (2009)
Lu, X., Sitters, R.A., Stougie, L.: A class of on-line scheduling algorithms to minimize total completion time. Operations Research Letters 31, 232–236 (2002)
Megow, N., Schulz, A.S.: On-line scheduling to minimize average completion time revisited. Operations Research Letters 32, 485–490 (2004)
Muthukrishnan, S., Rajaraman, R., Shaheen, A., Gehrke, J.E.: Online scheduling to minimize average stretch. SIAM J. Comput. 34, 433–452 (2005)
Phillips, C., Stein, C., Wein, J.: Minimizing average completion time in the presence of release dates, networks and matroids; sequencing and scheduling. Mathematical Programming 82, 199–223 (1998)
Queyranne, M.: On the Anderson-Potts single machine on-line scheduling algorithm (2001) (unpublished manuscript)
Schrage, L.: A proof of the optimality of the shortest remaining processing time discipline. Operations Research 16(3), 687–690 (1968)
Schulz, A.S., Skutella, M.: The power of α-points in single machine scheduling. Journal of Scheduling 5, 121–133 (2002)
Schulz, A.S., Skutella, M.: Scheduling unrelated machines by randomized rounding. SIAM Journal on Discrete Mathematics 15, 450–469 (2002)
Seiden, S.: A guessing game and randomized online algorithms. In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp. 592–601 (2000)
Sitters, R.A.: Complexity and approximation in routing and scheduling, Ph.D. thesis, Eindhoven Universtity of Technology, the Netherlands (2004)
Sitters, R.A.: Efficient algorithms for average completion time scheduling, Tech. Report 2009-58, FEWEB research memorandum, Free University Amsterdam (2009)
Stougie, L., Vestjens, A.P.A.: Randomized on-line scheduling: How low can’t you go? Operations Research Letters 30, 89–96 (2002)
Vestjens, A.P.A.: On-line machine scheduling, Ph.D. thesis, Department of Mathematics and Computing Science, Technische Universiteit Eindhoven, Eindhoven, the Netherlands (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sitters, R. (2010). Efficient Algorithms for Average Completion Time Scheduling. In: Eisenbrand, F., Shepherd, F.B. (eds) Integer Programming and Combinatorial Optimization. IPCO 2010. Lecture Notes in Computer Science, vol 6080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13036-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-13036-6_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13035-9
Online ISBN: 978-3-642-13036-6
eBook Packages: Computer ScienceComputer Science (R0)