A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling

  • Authors:

  • Yeo Keun Kim;Kitae Park;Jesuk Ko

  • Affiliations:

  • Department of Industrial Engineering, Chonnam National University, 300 Yongbongdong, Pukku, Kwangju 500-757, Republic of Korea;Department of Industrial Engineering, Chonnam National University, 300 Yongbongdong, Pukku, Kwangju 500-757, Republic of Korea;Department of Industrial & Information Engineering, Kwangju University, 592 Chinwoldong, Namku, Kwangju 502-703, Republic of Korea

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2003

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper addresses the integrated problem of process planning and scheduling in job shop flexible manufacturing systems. Due to production flexibility, it is possible to generate many feasible process plans for each job. The two functions of process planning and scheduling are tightly interwoven with each other. The optimality of scheduling depends on the result of process planning. The integration of process planning and scheduling is therefore important for an efficient utilization of manufacturing resources. In this paper, a new method using an artificial intelligent search technique, called symbiotic evolutionary algorithm, is presented to handle the two functions at the same time. For the performance improvement of the algorithm, it is important to enhance population diversity and search efficiency. We adopt the strategies of localized interactions, steady-state reproduction, and random symbiotic partner selection. Efficient genetic representations and operator schemes are also considered. While designing the schemes, we take into account the features specific to each of process planning and scheduling problems. The performance of the proposed algorithm is compared with those of a traditional hierarchical approach and an existing cooperative coevolutionary algorithm. The experimental results show that the proposed algorithm outperforms the compared algorithms.