Sökning: onr:"swepub:oai:DiVA.org:kth-346821" >
Flexible Job Shop C...
Flexible Job Shop Composite Dispatching Rule Mining Approach Based on an Improved Genetic Programming Algorithm
-
- Li, Xixing (författare)
- Hubei Key Laboratory of Modern Manufacturing and Quality Engineering, School of Mechanical Engineering, Hubei University of Technology, Wuhan 430068, China.
-
- Zhao, Qingqing (författare)
- Hubei Key Laboratory of Modern Manufacturing and Quality Engineering, School of Mechanical Engineering, Hubei University of Technology, Wuhan 430068, China.
-
- Tang, Hongtao (författare)
- Hubei Digital Manufacturing Key Laboratory, School of Mechanical and Electronic Engineering, Wuhan University of Technology, Wuhan 430070, China.
-
visa fler...
-
- Guo, Xing (författare)
- Hubei Key Laboratory of Modern Manufacturing and Quality Engineering, School of Mechanical Engineering, Hubei University of Technology, Wuhan 430068, China.
-
- Zhuang, Mengzhen (författare)
- Hubei Digital Manufacturing Key Laboratory, School of Mechanical and Electronic Engineering, Wuhan University of Technology, Wuhan 430070, China.
-
- Li, Yibing (författare)
- Hubei Digital Manufacturing Key Laboratory, School of Mechanical and Electronic Engineering, Wuhan University of Technology, Wuhan 430070, China.
-
- Wang, Xi Vincent, Dr. 1985- (författare)
- KTH,Produktionsutveckling
-
visa färre...
-
Hubei Key Laboratory of Modern Manufacturing and Quality Engineering, School of Mechanical Engineering, Hubei University of Technology, Wuhan 430068, China Hubei Digital Manufacturing Key Laboratory, School of Mechanical and Electronic Engineering, Wuhan University of Technology, Wuhan 430070, China. (creator_code:org_t)
- Tsinghua University, 2024
- 2024
- Engelska.
-
Ingår i: Tsinghua Science and Technology. - : Tsinghua University. - 1007-0214 .- 1878-7606. ; 29:5, s. 1390-1408
- Relaterad länk:
-
https://doi.org/10.2...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.2...
-
visa färre...
Abstract
Ämnesord
Stäng
- To obtain a suitable scheduling scheme in an effective time range, the minimum completion time is taken as the objective of Flexible Job Shop scheduling Problems (FJSP) with different scales, and Composite Dispatching Rules (CDRs) are applied to generate feasible solutions. Firstly, the binary tree coding method is adopted, and the constructed function set is normalized. Secondly, a CDR mining approach based on an Improved Genetic Programming Algorithm (IGPA) is designed. Two population initialization methods are introduced to enrich the initial population, and a superior and inferior population separation strategy is designed to improve the global search ability of the algorithm. At the same time, two individual mutation methods are introduced to improve the algorithm’s local search ability, to achieve the balance between global search and local search. In addition, the effectiveness of the IGPA and the superiority of CDRs are verified through comparative analysis. Finally, Deep Reinforcement Learning (DRL) is employed to solve the FJSP by incorporating the CDRs as the action set, the selection times are counted to further verify the superiority of CDRs.
Ämnesord
- NATURVETENSKAP -- Matematik -- Beräkningsmatematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Computational Mathematics (hsv//eng)
Nyckelord
- composite dispatching rule
- deep reinforcement learning
- flexible job shop scheduling
- improved genetic programming algorithm
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas