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

Liman Feng, Guo Chen, Shengchao Zhou (), Xiaojun Zhou and Mingzhou Jin
Additional contact information
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

Mathematics, 2024, vol. 12, issue 3, 1-14

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.

Keywords: scheduling; energy efficiency; unrelated parallel batch processing machines; mixed-integer linear programming; heuristics; time-of-use tariffs (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/3/376/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/3/376/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:3:p:376-:d:1325585

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().