Dual population algorithm for distributed permutation flow shop with variable processing speed
DOI:
Author:
Affiliation:

Hubei University of Technology

Clc Number:

Fund Project:

National key research and development program(2018YFC0116100);Key Project of Science and Technology Research Program of Hubei Educational Committee (D20211402);Key Research and Development Project of Hubei Province(2020BAB114、2023BAB094);

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Aiming at the distributed permutation flow shop scheduling problem with variable processing speed, a double population algorithm is proposed to optimize the maximum completion time and the total energy consumption of the machine. Firstly, an initialization method that mixes four strategies is used to generate a high-quality initial population. Secondly, specific evolution methods are designed according to the characteristics of the two pop-ulations, and the dynamic guide factor is introduced to adjust the evolution mode of the population. At the same time, an energy-saving strategy for speed regulation is proposed to further optimize energy consumption. Finally, a dynamic population strategy is proposed to balance the resources of the two populations. The effectiveness of each strategy is proved by simulation experiments, and compared with other algorithms, the results show that the proposed algorithm has obvious advantages.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:September 05,2023
  • Revised:October 09,2023
  • Adopted:October 11,2023
  • Online:
  • Published:

Address:No. 219, Ningliu Road, Nanjing, Jiangsu Province

Postcode:210044

Phone:025-58731025