• DocumentCode
    1627195
  • Title

    Genetic algorithm approach to an optimal scheduling problem for a large-scale complex manufacturing system

  • Author

    Sannomiya, N. ; Iima, H.

  • Author_Institution
    Dept. of Electron. & Inf. Sci., Kyoto Inst. of Technol., Japan
  • Volume
    3
  • fYear
    1999
  • fDate
    6/21/1905 12:00:00 AM
  • Firstpage
    622
  • Abstract
    A genetic algorithm (GA) is applied to an optimal scheduling problem for a large-scale complex manufacturing system. The system is operated in a job shop mode with additional constraints and during a long scheduling period. In order to obtain a good suboptimal solution, a GA is designed by introducing several ideas and heuristics for constructing the individual description and the genetic operators. In the paper a long-period scheduling problem for a metal mold assembly process is considered as a case study. The effectiveness of the proposed algorithm is examined by a numerical computation carried out on the basis of large-scale real operation data
  • Keywords
    assembling; computational complexity; genetic algorithms; production control; set theory; job shop mode; large-scale complex manufacturing system; long scheduling period; metal mold assembly process; optimal scheduling problem; suboptimal solution; Algorithm design and analysis; Decoding; Genetic algorithms; Information science; Job shop scheduling; Large-scale systems; Manufacturing systems; Optimal scheduling; Processor scheduling; Search methods;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on
  • Conference_Location
    Tokyo
  • ISSN
    1062-922X
  • Print_ISBN
    0-7803-5731-0
  • Type

    conf

  • DOI
    10.1109/ICSMC.1999.823284
  • Filename
    823284