LAPSE:2023.2309v1
Published Article

LAPSE:2023.2309v1
A GAPN Approach for the Flexible Job-Shop Scheduling Problem with Indirect Energy and Time-of-Use Electricity Pricing
February 21, 2023
Abstract
The flexible job-shop scheduling problem with indirect energy and time-of-use (ToU) electricity pricing (FJSP-IT) is investigated. Considering the production cost, which includes the indirect energy cost, direct energy cost and time cost, the cost evaluation model under ToU pricing is built. To minimize the total production cost of the FJSP-IT, an approach based on a genetic algorithm and Petri nets (GAPN) is presented. Under this approach, indirect energy and direct energy are modeled with Petri net (PN) nodes, the operation time is evaluated through PN simulation, and resource allocation is fine-tuned through genetic operations. A group of heuristic operation time policies, especially the exhausting subsection policy and two mixed policies, are presented to adapt to the FJSP-IT with vague cost components. Experiments were performed on a data set generated from the banburying shop of a rubber tire plant, and the results show that the proposed GAPN approach has good convergence. Using the proposed operation time policies makes it possible to save 10.81% on the production cost compared to using the single off-peak first or passive delay policy, and considering indirect energy makes it possible to save at least 2.09% on the production cost compared to ignoring indirect energy.
The flexible job-shop scheduling problem with indirect energy and time-of-use (ToU) electricity pricing (FJSP-IT) is investigated. Considering the production cost, which includes the indirect energy cost, direct energy cost and time cost, the cost evaluation model under ToU pricing is built. To minimize the total production cost of the FJSP-IT, an approach based on a genetic algorithm and Petri nets (GAPN) is presented. Under this approach, indirect energy and direct energy are modeled with Petri net (PN) nodes, the operation time is evaluated through PN simulation, and resource allocation is fine-tuned through genetic operations. A group of heuristic operation time policies, especially the exhausting subsection policy and two mixed policies, are presented to adapt to the FJSP-IT with vague cost components. Experiments were performed on a data set generated from the banburying shop of a rubber tire plant, and the results show that the proposed GAPN approach has good convergence. Using the proposed operation time policies makes it possible to save 10.81% on the production cost compared to using the single off-peak first or passive delay policy, and considering indirect energy makes it possible to save at least 2.09% on the production cost compared to ignoring indirect energy.
Record ID
Keywords
flexible job-shop scheduling, Genetic Algorithm, indirect energy, petri nets, time-of-use pricing
Subject
Suggested Citation
Guo J, Luo Q, Liang P, Ouyang J. A GAPN Approach for the Flexible Job-Shop Scheduling Problem with Indirect Energy and Time-of-Use Electricity Pricing. (2023). LAPSE:2023.2309v1
Author Affiliations
Guo J: School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China [ORCID]
Luo Q: School of Economics and Management, Guangdong Technology College, Zhaoqing 526070, China
Liang P: School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China
Ouyang J: School of Cyber Security, Guangdong Polytechnic Normal University, Guangzhou 510665, China [ORCID]
Luo Q: School of Economics and Management, Guangdong Technology College, Zhaoqing 526070, China
Liang P: School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou 510665, China
Ouyang J: School of Cyber Security, Guangdong Polytechnic Normal University, Guangzhou 510665, China [ORCID]
Journal Name
Processes
Volume
10
Issue
5
First Page
832
Year
2022
Publication Date
2022-04-22
ISSN
2227-9717
Version Comments
Original Submission
Other Meta
PII: pr10050832, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2023.2309v1
This Record
External Link

https://doi.org/10.3390/pr10050832
Publisher Version
Download
Meta
Record Statistics
Record Views
210
Version History
[v1] (Original Submission)
Feb 21, 2023
Verified by curator on
Feb 21, 2023
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2023.2309v1
Record Owner
Auto Uploader for LAPSE
Links to Related Works
