IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v20y2017i5d10.1007_s10951-017-0528-y.html
   My bibliography  Save this article

Offline first-fit decreasing height scheduling of power loads

Author

Listed:
  • Anshu Ranjan

    (University of Florida)

  • Pramod Khargonekar

    (University of Florida)

  • Sartaj Sahni

    (University of Florida)

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$$ 1.7 O P T + 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)$$ O ( n log n + n q ) time complexity where q is the number of $$non-preemptable$$ n o n - p r e e m p t a b l e jobs.

Suggested Citation

  • Anshu Ranjan & Pramod Khargonekar & Sartaj Sahni, 2017. "Offline first-fit decreasing height scheduling of power loads," Journal of Scheduling, Springer, vol. 20(5), pages 527-542, October.
    • Handle: RePEc:spr:jsched:v:20:y:2017:i:5:d:10.1007_s10951-017-0528-y
    DOI: 10.1007/s10951-017-0528-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-017-0528-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-017-0528-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lodi, Andrea & Martello, Silvano & Monaci, Michele, 2002. "Two-dimensional packing problems: A survey," European Journal of Operational Research, Elsevier, vol. 141(2), pages 241-252, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Francisco Trespalacios & Ignacio E. Grossmann, 2017. "Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem," Annals of Operations Research, Springer, vol. 258(2), pages 747-759, November.
    2. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    3. Russo, Mauro & Sforza, Antonio & Sterle, Claudio, 2013. "An improvement of the knapsack function based algorithm of Gilmore and Gomory for the unconstrained two-dimensional guillotine cutting problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 451-462.
    4. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    5. López-Camacho, Eunice & Terashima-Marín, Hugo & Ochoa, Gabriela & Conant-Pablos, Santiago Enrique, 2013. "Understanding the structure of bin packing problems through principal component analysis," International Journal of Production Economics, Elsevier, vol. 145(2), pages 488-499.
    6. W. D. D. Madhavee & N. Saldin & U. C. Vaidyarathna & C. J. Jayawardene, 2018. "A Practical Application of the Generalized Cutting Stock Algorithm," Academic Journal of Applied Mathematical Sciences, Academic Research Publishing Group, vol. 4(3), pages 15-21, 03-2018.
    7. A Ghanmi & R H A D Shaw, 2008. "Modelling and analysis of Canadian Forces strategic lift and pre-positioning options," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1591-1602, December.
    8. Reinaldo Morabito & Vitória Pureza, 2010. "A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem," Annals of Operations Research, Springer, vol. 179(1), pages 297-315, September.
    9. Andrea Lodi & Silvano Martello & Michele Monaci & Claudio Cicconetti & Luciano Lenzini & Enzo Mingozzi & Carl Eklund & Jani Moilanen, 2011. "Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX," Management Science, INFORMS, vol. 57(12), pages 2130-2144, December.
    10. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    11. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    12. Torsten Buchwald & Kirsten Hoffmann & Guntram Scheithauer, 2014. "Relations between capacity utilization, minimal bin size and bin number," Annals of Operations Research, Springer, vol. 217(1), pages 55-76, June.
    13. Galiev, Shamil I. & Lisafina, Maria S., 2013. "Linear models for the approximate solution of the problem of packing equal circles into a given domain," European Journal of Operational Research, Elsevier, vol. 230(3), pages 505-514.
    14. Song, X. & Chu, C.B. & Lewis, R. & Nie, Y.Y. & Thompson, J., 2010. "A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting," European Journal of Operational Research, Elsevier, vol. 202(2), pages 368-378, April.
    15. Morabito, Reinaldo & Belluzzo, Luciano, 2007. "Optimising the cutting of wood fibre plates in the hardboard industry," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1405-1420, December.
    16. Furini, Fabio & Malaguti, Enrico & Medina Durán, Rosa & Persiani, Alfredo & Toth, Paolo, 2012. "A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size," European Journal of Operational Research, Elsevier, vol. 218(1), pages 251-260.
    17. Stéphane Grandcolas & Cyril Pain-Barre, 2022. "A hybrid metaheuristic for the two-dimensional strip packing problem," Annals of Operations Research, Springer, vol. 309(1), pages 79-102, February.
    18. Mehmet Burak Şenol & Ekrem Alper Murat, 2023. "A sequential solution heuristic for continuous facility layout problems," Annals of Operations Research, Springer, vol. 320(1), pages 355-377, January.
    19. Mantovani, Serena & Morganti, Gianluca & Umang, Nitish & Crainic, Teodor Gabriel & Frejinger, Emma & Larsen, Eric, 2018. "The load planning problem for double-stack intermodal trains," European Journal of Operational Research, Elsevier, vol. 267(1), pages 107-119.
    20. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:20:y:2017:i:5:d:10.1007_s10951-017-0528-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.