Skip to main content

Advertisement

SpringerLink
Log in

Offline first-fit decreasing height scheduling of power loads

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In this paper, we consider the problem of scheduling energy consumption loads in the setting of smart electric grids. Each load is characterized as a “job” by a start (arrival) time and a deadline by which a certain amount of electric energy must be delivered to the load. A job may be preemptable, i. e. it can be interrupted or non-preemptable. Specifically, we focus on scheduling a mixture of preemptable and non-preemptable jobs with the same arrival time and deadline with the goal of minimizing the peak power. We study and modify the first-fit decreasing height algorithm of the strip packing problem for this purpose. We prove its asymptotic performance bound: \(1.7 OPT + 1\) and its tightness. The heuristic results in at most one preemption per job, and it can be implemented with \(O(n \log n + nq)\) time complexity where q is the number of \(non-preemptable\) jobs.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. As noted in Observation 3.4, some rectangles appear twice in the RHS. When adding the widths of rectangles in the RHS, each rectangle is counted only once.

References

  • Alamdari, S., Biedl, T., Chan, T., Grant, E., Jampani, K., Keshav, S., et al. (2013). Smart-grid electricity allocation via strip packing with slicing. In F. Dehne, R. Solis-Oba, & J. R. Sack (Eds.), Algorithms and data structures (Vol. 8037, pp. 25–36)., Lecture notes in computer science Berlin Heidelberg: Springer.

    Chapter  Google Scholar 

  • Bakken, D., Bose, A., Chandy, K., Khargonekar, P., Kuh, A., Low, S., von Meier, A., Poolla, K., Varaiya, P. & Wu, F. (2011). Grip-grids with intelligent periphery: Control architectures for grid2050. In 2011 IEEE international conference on smart grid communications (SmartGridComm), pp 7–12.

  • Coffman, E, Jr., Garey, M., Johnson, D., & Tarjan, R. (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4), 808–826.

    Article  Google Scholar 

  • Garey, M., Graham, R., Johnson, D., & Yao, A. C. C. (1976). Resource constrained scheduling as generalized bin packing. Journal of Combinatorial Theory, Series A, 21(3), 257–298.

    Article  Google Scholar 

  • Giudice P (2011) Our energy future and smart grid communications. testimony before the fcc field hearing on energy and environment URL http://www.broadband.gov/fieldevents/fh_energy_environment/giudice.pdf.

  • Harren, R. & Stee, R. (2009). Improved absolute approximation ratios for two-dimensional packing problems. In I. Dinur, K. Jansen, J. Naor, J. Rolim (Eds.) Approximation, randomization, and combinatorial optimization. Algorithms and techniques, Lecture notes in computer science (Vol. 5687, pp 177–189). Berlin Heidelberg: Springer.

  • Johnson, D., Demers, A., Ullman, J., Garey, M., & Graham, R. (1974). Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3(4), 299–325.

    Article  Google Scholar 

  • Koutsopoulos, I. & Tassiulas, L. (2011). Control and optimization meet the smart power grid: Scheduling of power demands for optimal energy management. In: Proceedings of the 2nd international conference on energy-efficient computing and networking, ACM, e-Energy ’11, pp 41–50.

  • Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241–252.

    Article  Google Scholar 

  • Ranjan, A., Khargonekar, P. & Sahni, S. (2014). Offline preemptive scheduling of power demands to minimize peak power in smart grids. In 2014 IEEE symposium on computers and communication (ISCC), pp 1–6.

  • Tang, S., Huang, Q., Li, X.Y. & Wu, D. (2013). Smoothing the energy consumption: Peak demand reduction in smart grid. In 2013 Proceedings IEEE INFOCOM, pp 1133–1141.

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, 32608, USA

    Anshu Ranjan & Sartaj Sahni

  2. Department of Electrical and Computer Engineering, University of Florida, Gainesville, FL, 32608, USA

    Pramod Khargonekar

Authors
  1. Anshu Ranjan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pramod Khargonekar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sartaj Sahni
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anshu Ranjan.

Additional information

A preliminary version was published in the Proceedings of the 21th IEEE Symposium on Computers and Communications (ISCC), 2015, pp. 758-763.

This research was supported, in part, by the National Science Foundation under Grants CNS0905308 and CNS-1239274.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ranjan, A., Khargonekar, P. & Sahni, S. Offline first-fit decreasing height scheduling of power loads. J Sched 20, 527–542 (2017). https://doi.org/10.1007/s10951-017-0528-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-017-0528-y

Keywords

Search

Navigation