A Genetic Algorithm for the Flexible Job-Shop Scheduling Problem
Scheduling for the flexible job-shop problem (FJSP) is very important. However, it is quite difficult to achieve an optimal solution to the FJSP with traditional optimization approaches. This paper examines the development and application of a genetic algorithm (GA) to the FJSP. A algorithm is proposed based on a basic genetic algorithm, an improved chromosome representation is represented, different strategies for crossover and mutation operator are adopted. The algorithm is tested on instances of 7 jobs and 7 machines. The results obtained from the computational study have shown that the proposed algorithm is a viable and effective approach for the FJSP.
KeywordsFJSP genetic algorithm crossover mutation
Unable to display preview. Download preview PDF.
- 1.Li, Y., Chen, Y.: A Genetic Algorithm for Job-Shop Scheduling. Journal of Software 5(3), 269–275 (2010)Google Scholar
- 4.Xi, W.-d., Qiao, B., Zhu, J.-y.: A genetic algorithm for flexible job shop scheduling based on two-substring gene coding method. Journal of Harb in Insitute of Technology 39(7), 1151–1153 (2007)Google Scholar
- 6.Zhang, G., Gao, L., Shi, Y.: An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications (2010), doi:10.1016/j.eswa.2010.08Google Scholar