IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i3p376-d1325585.html
   My bibliography  Save this article

An Energy-Efficient Unrelated Parallel Machine Scheduling Problem with Batch Processing and Time-of-Use Electricity Prices

Author

Listed:
  • Liman Feng

    (School of Automation, Central South University, Changsha 410083, China)

  • Guo Chen

    (School of Automation, Central South University, Changsha 410083, China)

  • Shengchao Zhou

    (School of Automation, Central South University, Changsha 410083, China)

  • Xiaojun Zhou

    (School of Automation, Central South University, Changsha 410083, China)

  • Mingzhou Jin

    (Department of Industrial and Systems Engineering, University of Tennessee, Knoxville, TN 37996, USA)

Abstract

The extensive consumption of energy in manufacturing has led to a large amount of greenhouse gas emissions that have caused an enormous effect on the environment. Therefore, investigating how to reduce energy consumption in manufacturing is of great significance to cleaner production. This paper considers an energy-conscious unrelated parallel batch processing machine scheduling problem under time-of-use (TOU) electricity prices. Under TOU, electricity prices vary for different periods of a day. This problem is grouping jobs into batches, assigning the batches to machines and allocating time to the batches so as to minimize the total electricity cost. A mixed-integer linear programming model and two groups of heuristics are proposed to solve this problem. The first group of heuristics first forms batches, assigns the batches to machines and finally allocates time to the batches, while the second group of heuristics first assigns jobs to machines, batches the jobs on each machine and finally allocates time to each batch. The computational results show that the SPT-FBLPT-P1 heuristic in the second group can provide high-quality solutions for large-scaled instances in a short time, in which the jobs are assigned to the machines based on the shortest processing time rule, the jobs on each machine are batched following the full-batch longest processing time algorithm, and the time is allocated to each batch following an integer programming approach. The MDEC-FBLPT-P1 heuristic that uses the minimum difference of the power consumption algorithm to assign the jobs also performed well.

Suggested Citation

  • Liman Feng & Guo Chen & Shengchao Zhou & Xiaojun Zhou & Mingzhou Jin, 2024. "An Energy-Efficient Unrelated Parallel Machine Scheduling Problem with Batch Processing and Time-of-Use Electricity Prices," Mathematics, MDPI, vol. 12(3), pages 1-14, January.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:3:p:376-:d:1325585
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/3/376/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/3/376/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Peng Wu & Junheng Cheng & Feng Chu, 2021. "Large-scale energy-conscious bi-objective single-machine batch scheduling under time-of-use electricity tariffs via effective iterative heuristics," Annals of Operations Research, Springer, vol. 296(1), pages 471-494, January.
    2. Zhou, Shengchao & Xie, Jianhui & Du, Ni & Pang, Yan, 2018. "A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 254-268.
    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. 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. Husseinzadeh Kashan, Ali & Ozturk, Onur, 2022. "Improved MILP formulation equipped with valid inequalities for scheduling a batch processing machine with non-identical job sizes," Omega, Elsevier, vol. 112(C).
    4. Lotfi Hidri & Ali Alqahtani & Achraf Gazdar & Belgacem Ben Youssef, 2021. "Green Scheduling of Identical Parallel Machines with Release Date, Delivery Time and No-Idle Machine Constraints," Sustainability, MDPI, vol. 13(16), pages 1-30, August.
    5. 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.
    6. Jae Won Jang & Yong Jae Kim & Byung Soo Kim, 2022. "A Three-Stage ACO-Based Algorithm for Parallel Batch Loading and Scheduling Problem with Batch Deterioration and Rate-Modifying Activities," Mathematics, MDPI, vol. 10(4), pages 1-26, February.
    7. Wei Jiang & Yilan Shen & Lingxuan Liu & Xiancong Zhao & Leyuan Shi, 2022. "A new method for a class of parallel batch machine scheduling problem," Flexible Services and Manufacturing Journal, Springer, vol. 34(2), pages 518-550, June.
    8. Zhang, Han & Li, Kai & Jia, Zhao-hong & Chu, Chengbin, 2023. "Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1024-1046.

    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:gam:jmathe:v:12:y:2024:i:3:p:376-:d:1325585. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.