A Pareto-Based Discrete Jaya Algorithm for Multiobjective Carbon-Efficient Distributed Blocking Flow Shop Scheduling Problem

Carbon peaking and carbon neutrality, which are significant strategies for national sustainable development, have attracted enormous attention from researchers in the manufacturing domain. A Pareto-based discrete Jaya algorithm (PDJaya) is proposed to solve the carbon-efficient distributed blocking...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on industrial informatics Ročník 19; číslo 8; s. 1 - 10
Hlavní autori: Zhao, Fuqing, Zhang, Hui, Wang, Ling
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 01.08.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
ISSN:1551-3203, 1941-0050
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Carbon peaking and carbon neutrality, which are significant strategies for national sustainable development, have attracted enormous attention from researchers in the manufacturing domain. A Pareto-based discrete Jaya algorithm (PDJaya) is proposed to solve the carbon-efficient distributed blocking flow shop scheduling problem (CEDBFSP) with the criteria of total tardiness and total carbon emission in this paper. The mixed-integer linear programming model is presented for the CEDBFSP. An effective constructive heuristic is produced to generate the initial population. The new individual is generated by the update mechanism of PDJaya. The self-adaptive operator local search strategy is designed to enhance the exploitation capability of PDJaya. A critical-path-based carbon saving strategy is introduced to further reduce carbon emissions. The effectiveness of each strategy in the PDJaya is verified and compared with the state-of-the-art algorithms in the benchmark suite. The numerical results demonstrate that the PDJaya is the efficient optimizer for solving the CEDBFSP.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1551-3203
1941-0050
DOI:10.1109/TII.2022.3220860