An Improved Mayfly Method to Solve Distributed Flexible Job Shop Scheduling Problem under Dual Resource Constraints

Aiming at the distributed flexible job shop scheduling problem under dual resource constraints considering the influence of workpiece transportation time between factories and machines, a distributed flexible job shop scheduling problem (DFJSP) model with the optimization goal of minimizing completi...

Full description

Saved in:
Bibliographic Details
Published inSustainability Vol. 14; no. 19; p. 12120
Main Authors Zhang, Shoujing, Hou, Tiantian, Qu, Qing, Glowacz, Adam, Alqhtani, Samar M, Irfan, Muhammad, Królczyk, Grzegorz, Li, Zhixiong
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.09.2022
Subjects
Algorithms
Analysis
Collaboration
Completion time
Decoding
Energy consumption
Factories
Genetic algorithms
Globalization
Industrial plants
Isomorphism
Job shops
Local optimization
Manufacturing
Methods
Optimization
Scheduling
Workers
Workpieces
Online AccessGet full text

Cover

More Information
Summary:Aiming at the distributed flexible job shop scheduling problem under dual resource constraints considering the influence of workpiece transportation time between factories and machines, a distributed flexible job shop scheduling problem (DFJSP) model with the optimization goal of minimizing completion time is established, and an improved mayfly algorithm (IMA) is proposed to solve it. Firstly, the mayfly position vector is discrete mapped to make it applicable to the scheduling problem. Secondly, three-layer coding rules of process, worker, and machine is adopted, in which the factory selection is reflected by machine number according to the characteristics of the model, and a hybrid initialization strategy is designed to improve the population quality and diversity. Thirdly, an active time window decoding strategy considering transportation time is designed for the worker–machine idle time window to improve the local optimization performance of the algorithm. In addition, the improved crossover and mutation operators is designed to expand the global search range of the algorithm. Finally, through simulation experiments, the results of various algorithms are compared to verify the effectiveness of the proposed algorithm for isomorphism and isomerism factories instances.
ISSN:2071-1050
2071-1050
DOI:10.3390/su141912120