Learning-Based Genetic Algorithm to Schedule an Extended Flexible Job Shop

Document Type

Article

Publication Date

1-1-2024

Abstract

This work considers an extended flexible job-shop scheduling problem from a semiconductor manufacturing environment. To find its high-quality solution in a reasonable time, a learning-based genetic algorithm (LGA) that incorporates a parallel long short-term memory network-embedded autoencoder model is proposed. In it, genetic algorithm is selected as a main optimizer. A novel autoencoder model is trained offline via end-to-end unsupervised learning without relying on labeled data. This model captures the major linkages among decision variables and generates promising solutions in an informative low-dimensional space, striking a balance between computational efficiency and solution quality. To further improve its search ability, a co-evolving framework is designed, which includes both a network-embedded subpopulation and a regular one. The former focuses on its global search while the latter ensures LGA's convergence. An information exchange method between the two subpopulations balances global and local search, improving its overall optimization ability. This work conducts various numerical experiments to compare LGA with the CPLEX optimizer, several classical heuristics, and some popular methods. Results show that LGA outperforms its peers in finding high-quality solutions in a reasonable time.

Identifier

85207877328 (Scopus)

Publication Title

IEEE Transactions on Cybernetics

External Full Text Location

https://doi.org/10.1109/TCYB.2024.3413054

e-ISSN

21682275

ISSN

21682267

PubMed ID

39012747

First Page

6909

Last Page

6920

Issue

11

Volume

54

Grant

52175002

Fund Ref

State Key Laboratory of Robotics and System

This document is currently not available here.

Share

COinS