Skip to main content
SpringerLink
Log in

Optimally Competitive List Batching

  • Conference paper
Algorithm Theory - SWAT 2004 (SWAT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3111))

Included in the following conference series:

Abstract

Batching has been studied extensively in the offline case, but many applications such as manufacturing or TCP acknowledgement require online solutions.

We consider online batching problems, where the order of jobs to be batched is fixed and where we seek to minimize average flow time. We present optimally competitive algorithms for s-batch (competitive ratio 2) and p-batch problems (competitive ratio of 4). We also derive results for naturally occurring special cases. In particular, we consider the case of unit processing times.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albers, S., Bals, H.: Dynamic TCP acknowledgement: Penalizing long delays. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 47–55 (2003)

    Google Scholar 

  2. Baptiste, P.: Batching identical jobs. Mathematical Methods of Operation Research 52, 355–367 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  4. Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M., Potts, C., Tautenhahn, T., van de Velde, S.: Scheduling a batch processing machine. Journal of Scheduling 1(1), 31–54 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dooly, D.R., Goldman, S.A., Scott, S.D.: On-line analysis of the TCP acknowledgement delay problem. Journal of the ACM 48(2), 243–273 (2001)

    Article  MathSciNet  Google Scholar 

  6. Epstein, L., Kesselman, A.: On the remote server problem or more about TCP acknowledgments (2003)(manuscript)

    Google Scholar 

  7. Epstein, L., Noga, J., Woeginger, G.J.: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time. Operations Research Letters 30(6), 415–420 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fiat, A., Woeginger, G.J.: On-line scheduling on a single machine: Minimizing the total completion time. Acta Informatica 36, 287–293 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Frederiksen, J.S., Larsen, K.S., Noga, J., Uthaisombut, P.: Dynamic TCP acknowledgment in the logP model. Journal of Algorithms 48(2), 407–428 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hoogeveen, J.A., Vestjens, A.P.A.: Optimal on-line algorithms for singlemachine scheduling. In: Proc. 5th Conf. Integer Programming and Combinatorial (IPCO), pp. 404–414 (1996)

    Google Scholar 

  11. Lu, X., Sitters, R., Stougie, L.: A class of on-line scheduling algorithms to minimize total completion time. Operations Research Letters (2003) (to appear)

    Google Scholar 

  12. Phillips, C.A., Stein, C., Wein, J.: Scheduling jobs that arrive over time. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 86–97. Springer, Heidelberg (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, University of Nevada, Las Vegas, Nevada, 89154, USA

    Wolfgang W. Bein & Lawrence L. Larmore

  2. School of Computer Science, The Interdisciplinary Center, Herzliya, Israel

    Leah Epstein

  3. Department of Computer Science, California State University Northridge, Northridge, CA, 91330, USA

    John Noga

Authors
  1. Wolfgang W. Bein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leah Epstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lawrence L. Larmore
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. John Noga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Augsburg, 86135, Augsburg, Germany

    Torben Hagerup

  2. Department of Computing, University of Copenhagen, Denmark

    Jyrki Katajainen

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bein, W.W., Epstein, L., Larmore, L.L., Noga, J. (2004). Optimally Competitive List Batching. In: Hagerup, T., Katajainen, J. (eds) Algorithm Theory - SWAT 2004. SWAT 2004. Lecture Notes in Computer Science, vol 3111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27810-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27810-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22339-9

  • Online ISBN: 978-3-540-27810-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation