An Improved Genetic Algorithm for Flexible Job Shop Scheduling Problem

@article{Liangxiao2015AnIG,
  title={An Improved Genetic Algorithm for Flexible Job Shop Scheduling Problem},
  author={Jiang Liangxiao and Du Zhongjun},
  journal={2015 2nd International Conference on Information Science and Control Engineering},
  year={2015},
  pages={127-131}
}
Based on the analysis of the characteristics of Flexible Job-shop Scheduling Problem (FJSP), an improved genetic algorithm is proposed to minimize the make span. The algorithm adopts a new initialization method to improve the quality of the initial population and to accelerate the speed of the algorithm's convergence. Considering the characteristic of the problem, reasonable chromosome encoding, crossover and mutation operator are given, and then the effectiveness of the improved algorithm is… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Improved Genetic Algorithm for the Flexible Job-shop Scheduling Problem[J

  • Zhang Guohui, Shi Yang
  • Mechanical Science and Technology,2011,30(11…
  • 2011
Highly Influential
2 Excerpts

Bilevel genetic algorithm for the flexible job-shop scheduling problem[J

  • Zhang Chaoyong rao Yunqing Li Peigen
  • Chinese Journal of Mechanical Engineering,
  • 2007
2 Excerpts

Multistage-based genetic algorithm for flexible job-shop scheduling problem

  • H PZhang, M Gen
  • Complexity International,
  • 2005

Application of Genetic Algorithm to Shop Floor Mass Production Planning [ J ]

  • Li Xiu, Wenhuang Liu, Jiang Chengyu, Wang Ningsheng
  • Journal of Nanjing University of Aeronautics…
  • 2001

Genetic algorithm and engineering design[M

  • Xuan Guangnan, Cheng Runwei
  • Beijing: Sciences
  • 2000
1 Excerpt

A comparative analysis of selection schemes used in genetic algorithms[C]//RAWLINS G,ed.Foundations

  • D EGOLDBERG, K DEB
  • Genetic Algorithms,Morgan
  • 1991
1 Excerpt

Similar Papers

Loading similar papers…