Improved genetic algorithm for solving the total weight tardiness job shop scheduling problem

Article type: Research Article

Authors: Wang, Hanpeng | Xiong, Hengen^{; *}

Affiliations: Wuhan University of Science and Technology, Wuhan, China

Correspondence: [*] Corresponding author. Hengen Xiong, Wuhan University of Science and Technology, Wuhan, 430080, China. Email: [email protected].

Abstract: An improved genetic algorithm is proposed for the Job Shop Scheduling Problem with Minimum Total Weight Tardiness (JSSP/TWT). In the proposed improved genetic algorithm, a decoding method based on the Minimum Local Tardiness (MLT) rule of the job is proposed by using the commonly used chromosome coding method of job numbering, and a chromosome recombination operator based on the decoding of the MLT rule is added to the basic genetic algorithm flow. As a way to enhance the quality of the initialized population, a non-delay scheduling combined with heuristic rules for population initialization. and a PiMX (Precedence in Machine crossover) crossover operator based on the priority of processing on the machine is designed. Comparison experiments of simulation scheduling under different algorithm configurations are conducted for randomly generated larger scale JSSP/TWT. Statistical analysis of the experimental evidence indicates that the genetic algorithm based on the above three improvements exhibits significantly superior performance for JSSP/TWT solving: faster convergence and better scheduling solutions can be obtained.

Keywords: Improved genetic algorithm, total weight tardiness, minimum local tardiness, PiMX

DOI: 10.3233/JIFS-236712

Journal: Journal of Intelligent & Fuzzy Systems, vol. Pre-press, no. Pre-press, pp. 1-16, 2024