Hybrid generic algorithm solving flexible process Job-Shop scheduling problem

To deal with the problem that many products in discrete manufacturing factories had flexible process design which had increased the complexity of scheduling, this paper proposed the FPJSP as an extension of JSP, and built the mathematical model for the new scheduling problem to shorten the productio...

Full description

Saved in:
Bibliographic Details
Published inJi suan ji ying yong yan jiu Vol. 31; no. 5; pp. 1353 - 1357
Main Authors Ma, Xue-Li, Cao, De-Bi, Liu, Xiao-Bing
Format Journal Article
LanguageChinese
Published 01.05.2014
Subjects
Algorithms
Encoding
Genetic algorithms
Java (programming language)
Manufacturing engineering
Mathematical models
Scheduling
Searching
Online AccessGet full text
ISSN1001-3695
DOI10.3969/j.issn.1001-3695.2014.05.016

Cover

More Information
Summary:To deal with the problem that many products in discrete manufacturing factories had flexible process design which had increased the complexity of scheduling, this paper proposed the FPJSP as an extension of JSP, and built the mathematical model for the new scheduling problem to shorten the production cycle. It proposed the hybrid genetic algorithm (HGA) to solve the model. According to the characteristics of FPJSP, it designed the genetic algorithm (GA) with improved chromosome encoding schema and genetic operators. In combination with the variable neighborhood search algorithm (VNS), it designed four neighborhood structures to enable dynamic neighborhood search and improve the neighborhood search performance of GA. The experiment shows the effectiveness and optimize performance of the proposed HGA for solving FPJSP.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1001-3695
DOI:10.3969/j.issn.1001-3695.2014.05.016