Skip to main content
SpringerLink
Log in

Dynamic Windows Scheduling with Reallocation 

  • Conference paper
Experimental Algorithms (SEA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8504))

Included in the following conference series:

Abstract

We consider the Windows Scheduling problem. The problem is a restricted version of Unit-Fractions Bin Packing, and it is also called Inventory Replenishment in the context of Supply Chain. In brief, the problem is to schedule the use of communication channels that allow at most one transmission per time slot, to clients specified by a maximum delay between consecutive transmissions. We extend previous online models, where decisions are permanent, assuming that clients may be reallocated at some cost. We present three online reallocation algorithms for Windows Scheduling. We analyze one of them and we evaluate experimentally all three showing that, in practice, they achieve constant amortized reallocations with close to optimal channel usage. Our simulations also expose interesting trade-offs between reallocations and channel usage. To the best of our knowledge, this is the first study of Windows Scheduling with reallocation costs.

This work was supported in part by the National Science Foundation (CCF- 0937829, CCF-1114930) and Kean University UFRI grant.

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. Balogh, J., Békési, J.: Semi-on-line bin packing: A short overview and a new lower bound. Central European Journal of Operations Research, 1–14 (2012)

    Google Scholar 

  2. Balogh, J., Békési, J., Galambos, G., Reinelt, G.: On-line bin packing with restricted repacking. Journal of Combinatorial Optimization, 1–17 (2012)

    Google Scholar 

  3. Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing service and operation costs of periodic scheduling. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11–20 (1998)

    Google Scholar 

  4. Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. SIAM Journal on Computing 32(4), 1091–1113 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. ACM Transactions on Algorithms (TALG) 3(3), 28 (2007)

    Article  MathSciNet  Google Scholar 

  6. Bender, M.A., Farach-Colton, M., Fekete, S.P., Fineman, J.T., Gilbert, S.: Reallocation problems in scheduling. In: 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2013, pp. 271–279 (2013)

    Google Scholar 

  7. Chan, J.W.-T., Lam, T.-W., Wong, P.W.H.: Dynamic bin packing of unit fractions items. Theoretical Computer Science 409(3), 521–529 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Chan, W.-T., Wong, P.W.H.: On-line windows scheduling of temporary items. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 259–270. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. M. Farach-Colton, K. Leal, M.A. Mosteiro, C. Thraves. Dynamic windows scheduling with reallocation. arXiv:1404.1087 (April 2014)

    Google Scholar 

  10. Han, X., Peng, C., Ye, D., Zhang, D., Lan, Y.: Dynamic bin packing with unit fraction items revisited. Information Processing Letters 110(23), 1049–1054 (2010)

    Article  MathSciNet  Google Scholar 

  11. Heydari, M., Sadjadi, S.J., Mohammadi, E.: Minimizing total flow time subject to preemption penalties in online scheduling. The International Journal of Advanced Manufacturing Technology 47(1-4), 227–236 (2010)

    Article  Google Scholar 

  12. Ivkovic, Z., Lloyd, E.L.: Fully dynamic algorithms for bin packing: Being (mostly) myopic helps. SIAM Journal on Computing 28(2), 574–611 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Liu, Z., Edwin Cheng, T.C.: Minimizing total completion time subject to job release dates and preemption penalties. Journal of Scheduling 7(4), 313–327 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1111–1122. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Shachnai, H., Tamir, T., Woeginger, G.J.: Minimizing makespan and preemption costs on a system of uniform machines. Algorithmica 42(3-4), 309–334 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. SimJava (2006), http://www.icsa.inf.ed.ac.uk/research/groups/hase/simjava/

  17. WestBrook, J.: Load balancing for response time. Journal of Algorithms 35(1), 1–16 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  18. Yu, H., Xu, Y., Wu, T.: Online inventory replenishment scheduling of temporary orders. Information Processing Letters 113(5), 188–192 (2013)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Rutgers University, Piscataway, NJ, USA

    Martín Farach-Colton

  2. Tokutek Inc., USA

    Martín Farach-Colton

  3. GSyC, Universidad Rey Juan Carlos, Madrid, Spain

    Katia Leal & Christopher Thraves

  4. Dept. of Computer Science, Kean University, Union, NJ, USA

    Miguel A. Mosteiro

Authors
  1. Martín Farach-Colton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katia Leal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Miguel A. Mosteiro
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christopher Thraves
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of IT, University of Sydney, Building J12, 2006, Sydney, NSW, Australia

    Joachim Gudmundsson

  2. Department of Computer Science, University of Copenhagen, Universitetsparken 5, 2100, Copenhagen East, Denmark

    Jyrki Katajainen

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Farach-Colton, M., Leal, K., Mosteiro, M.A., Thraves, C. (2014). Dynamic Windows Scheduling with Reallocation . In: Gudmundsson, J., Katajainen, J. (eds) Experimental Algorithms. SEA 2014. Lecture Notes in Computer Science, vol 8504. Springer, Cham. https://doi.org/10.1007/978-3-319-07959-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07959-2_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07958-5

  • Online ISBN: 978-3-319-07959-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation