• DocumentCode
    511698
  • Title

    A Symbiotic Evolutionary Algorithm for Flexible Job Scheduling Problem

  • Author

    Yan, Zhang ; Hongze, Qiu

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Shandong Univ., Jinan, China
  • Volume
    1
  • fYear
    2009
  • fDate
    28-30 Oct. 2009
  • Firstpage
    79
  • Lastpage
    83
  • Abstract
    Flexible job scheduling problem (FJSP) is an extension of classical job scheduling problem (JSP) and also a problem faced by flexible manufacture system (FMS). In this paper, FJSP is decomposed into two sub different problems which are process planning and job scheduling, and two representations are designed for the two sub problems respectively. A symbiotic evolutionary algorithm is proposed to solve FJSP by putting the two sub problems together. To strengthen the search ability, a neighbourhood multi-parent crossover operator and a neighbour-based fitness function are developed and utilized in this paper. The experimental results show the proposed symbiotic evolutionary algorithm can solve FJSP well.
  • Keywords
    evolutionary computation; job shop scheduling; manufacturing systems; process planning; flexible job scheduling problem; flexible manufacture system; neighbour-based fitness function; neighbourhood multiparent crossover operator; process planning; symbiotic evolutionary algorithm; Computer aided manufacturing; Computer science; Decoding; Evolutionary computation; Flexible manufacturing systems; Genetic algorithms; Job shop scheduling; Process planning; Processor scheduling; Symbiosis; flexible; job scheduling; neighbourhood multi-parent crossover; process planning; symbiotic evolutionary algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Engineering, 2009. WCSE '09. Second International Workshop on
  • Conference_Location
    Qingdao
  • Print_ISBN
    978-0-7695-3881-5
  • Type

    conf

  • DOI
    10.1109/WCSE.2009.626
  • Filename
    5403443