Dynamic flexible job shop scheduling method based on improved gene expression programming
Author(s) -
Chunjiang Zhang,
Yin Zhou,
Kunkun Peng,
Xinyu Li,
Kunlei Lian,
Suyan Zhang
Publication year - 2020
Publication title -
measurement and control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.286
H-Index - 21
eISSN - 2051-8730
pISSN - 0020-2940
DOI - 10.1177/0020294020946352
Subject(s) - computer science , gene expression programming , job shop scheduling , dynamic priority scheduling , dynamic programming , flow shop scheduling , scheduling (production processes) , job shop , fair share scheduling , mathematical optimization , algorithm , artificial intelligence , mathematics , schedule , operating system
Dynamic scheduling is one of the most important key technologies in production and flexible job shop is widespread. Therefore, this paper considers a dynamic flexible job shop scheduling problem considering setup time and random job arrival. To solve this problem, a dynamic scheduling framework based on the improved gene expression programming algorithm is proposed to construct scheduling rules. In this framework, the variable neighborhood search using four efficient neighborhood structures is combined with gene expression programming algorithm. And, an adaptive method adjusting recombination rate and transposition rate in the evolutionary progress is proposed. The test results on 24 groups of instances with different scales show that the improved gene expression programming performs better than the standard gene expression programming, genetic programming, and scheduling rules.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom