IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v24y2021i1d10.1007_s10951-020-00674-3.html
   My bibliography  Save this article

Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs

Author

Listed:
  • Michal Penn

    (Technion)

  • Tal Raviv

    (Tel Aviv University)

Abstract

Following a recent interest in sustainable scheduling under operational costs that vary over time, we study scheduling problems on a single machine under time-of-use electricity tariffs. We consider two main variants of the problem: cost minimization and profit maximization. In the cost minimization problem, the set of jobs to be processed is given, and the goal is to schedule all jobs within a planning horizon so as to minimize the total cost, while in the profit maximization problem, one needs to select a set of jobs to be processed such that the total profit is maximized. The general cases of the cost minimization and profit maximization problems in which preemptions are forbidden are strongly NP-hard. In this paper, we show that some special cases with identical processing times can be solved by efficient algorithms. In addition, we consider several extensions of the problems, including release times, due dates, and variable energy consumption.

Suggested Citation

  • Michal Penn & Tal Raviv, 2021. "Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs," Journal of Scheduling, Springer, vol. 24(1), pages 83-102, February.
  • Handle: RePEc:spr:jsched:v:24:y:2021:i:1:d:10.1007_s10951-020-00674-3
    DOI: 10.1007/s10951-020-00674-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-020-00674-3
    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-020-00674-3?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. Aghelinejad, MohammadMohsen & Ouazene, Yassine & Yalaoui, Alice, 2019. "Complexity analysis of energy-efficient single machine scheduling problems," Operations Research Perspectives, Elsevier, vol. 6(C).
    2. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    3. Yingchao Zhao & Xiangtong Qi & Minming Li, 2016. "On scheduling with non-increasing time slot cost to minimize total weighted completion time," Journal of Scheduling, Springer, vol. 19(6), pages 759-767, December.
    4. Kan Fang & Nelson A. Uhan & Fu Zhao & John W. Sutherland, 2016. "Scheduling on a single machine under time-of-use electricity tariffs," Annals of Operations Research, Springer, vol. 238(1), pages 199-227, March.
    5. Kan Fang & Nelson Uhan & Fu Zhao & John Sutherland, 2016. "Scheduling on a single machine under time-of-use electricity tariffs," Annals of Operations Research, Springer, vol. 238(1), pages 199-227, March.
    6. Gahm, Christian & Denz, Florian & Dirr, Martin & Tuma, Axel, 2016. "Energy-efficient scheduling in manufacturing companies: A review and research framework," European Journal of Operational Research, Elsevier, vol. 248(3), pages 744-757.
    7. Guohua Wan & Xiangtong Qi, 2010. "Scheduling with variable time slot costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(2), pages 159-171, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2021. "Job Scheduling under Time-of-Use Energy Tariffs for Sustainable Manufacturing: A Survey," LIDAM Discussion Papers CORE 2021019, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1091-1109.

    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. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1091-1109.
    2. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2021. "Job Scheduling under Time-of-Use Energy Tariffs for Sustainable Manufacturing: A Survey," LIDAM Discussion Papers CORE 2021019, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Xiangxin An & Guojin Si & Tangbin Xia & Qinming Liu & Yaping Li & Rui Miao, 2022. "Operation and Maintenance Optimization for Manufacturing Systems with Energy Management," Energies, MDPI, vol. 15(19), pages 1-19, October.
    4. Shen, Liji & Dauzère-Pérès, Stéphane & Maecker, Söhnke, 2023. "Energy cost efficient scheduling in flexible job-shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 310(3), pages 992-1016.
    5. Lin Chen & Nicole Megow & Roman Rischke & Leen Stougie & José Verschae, 2021. "Optimal algorithms for scheduling under time-of-use tariffs," Annals of Operations Research, Springer, vol. 304(1), pages 85-107, September.
    6. Gaggero, Mauro & Paolucci, Massimo & Ronco, Roberto, 2023. "Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 311(3), pages 845-866.
    7. Heydar, Mojtaba & Mardaneh, Elham & Loxton, Ryan, 2022. "Approximate dynamic programming for an energy-efficient parallel machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 302(1), pages 363-380.
    8. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    9. Ghorbanzadeh, Masoumeh & Ranjbar, Mohammad, 2023. "Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints," European Journal of Operational Research, Elsevier, vol. 307(2), pages 519-537.
    10. Seokgi Lee & Mona Issabakhsh & Hyun Woo Jeon & Seong Wook Hwang & Byung Chung, 2020. "Idle time and capacity control for a single machine scheduling problem with dynamic electricity pricing," Operations Management Research, Springer, vol. 13(3), pages 197-217, December.
    11. Tian, Zheng & Zheng, Li, 2024. "Single machine parallel-batch scheduling under time-of-use electricity prices: New formulations and optimisation approaches," European Journal of Operational Research, Elsevier, vol. 312(2), pages 512-524.
    12. Hajo Terbrack & Thorsten Claus & Frank Herrmann, 2021. "Energy-Oriented Production Planning in Industry: A Systematic Literature Review and Classification Scheme," Sustainability, MDPI, vol. 13(23), pages 1-32, December.
    13. Shun Jia & Yang Yang & Shuyu Li & Shang Wang & Anbang Li & Wei Cai & Yang Liu & Jian Hao & Luoke Hu, 2024. "The Green Flexible Job-Shop Scheduling Problem Considering Cost, Carbon Emissions, and Customer Satisfaction under Time-of-Use Electricity Pricing," Sustainability, MDPI, vol. 16(6), pages 1-22, March.
    14. Jules Raymond Kala & Didier Michael Kre & Armelle N’Guessan Gnassou & Jean Robert Kamdjoug Kala & Yves Melaine Akpablin Akpablin & Tiorna Coulibaly, 2022. "Assets management on electrical grid using Faster-RCNN," Annals of Operations Research, Springer, vol. 308(1), pages 307-320, January.
    15. Wu, Xueqi & Che, Ada, 2020. "Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search," Omega, Elsevier, vol. 94(C).
    16. Wu, Xueqi & Che, Ada, 2019. "A memetic differential evolution algorithm for energy-efficient parallel machine scheduling," Omega, Elsevier, vol. 82(C), pages 155-165.
    17. Markó Horváth & Tamás Kis, 2020. "Polyhedral results for position-based scheduling of chains on a single machine," Annals of Operations Research, Springer, vol. 284(1), pages 283-322, January.
    18. Ruilin Pan & Qiong Wang & Zhenghong Li & Jianhua Cao & Yongjin Zhang, 2022. "Steelmaking-continuous casting scheduling problem with multi-position refining furnaces under time-of-use tariffs," Annals of Operations Research, Springer, vol. 310(1), pages 119-151, March.
    19. Aghelinejad, MohammadMohsen & Ouazene, Yassine & Yalaoui, Alice, 2019. "Complexity analysis of energy-efficient single machine scheduling problems," Operations Research Perspectives, Elsevier, vol. 6(C).
    20. Abbas Hamze & Yassine Ouazene & Nazir Chebbo & Imane Maatouk, 2019. "Multisources of Energy Contracting Strategy with an Ecofriendly Factor and Demand Uncertainties," Energies, MDPI, vol. 12(20), pages 1-24, October.

    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:24:y:2021:i:1:d:10.1007_s10951-020-00674-3. 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.