• DocumentCode
    1962008
  • Title

    Job scheduling problem of aviation maintenance workshop based on improved Particle Swarm Optimization algorithm

  • Author

    Yan Hui ; Wu Qizong ; Wang Zhongqi ; Zhang Jingjing

  • Author_Institution
    Beijing Inst. of Technol., China Aviation Planning & Constr. Dev. Co., Beijing, China
  • Volume
    3
  • fYear
    2012
  • fDate
    20-21 Oct. 2012
  • Firstpage
    82
  • Lastpage
    85
  • Abstract
    The job scheduling problem of aviation maintenance workshop is researched and analyzed deeply. Based on that, an improved Particle Swarm Optimization (PSO) algorithm is presented to solve job scheduling problem. Mathematics model is established by superior maintenance cost and maintenance time. The encoding scheme based on procedure and maintenance equipment allocation is adopted. Then discrete location update formula is designed, also crossover and mutation mechanism are applied to increase capability of global search. An example of job scheduling problem for metalworking workshop is simulated. Comparison with quality and time of the result indicates the algorithm is more efficient than normal PSO and genetic algorithm. So the proposed algorithm is viable and rational, and this paper is practical to use in reality.
  • Keywords
    job shop scheduling; maintenance engineering; particle swarm optimisation; PSO algorithm; aviation maintenance workshop; crossover mechanism; discrete location update formula; encoding scheme; global search; job scheduling problem; maintenance cost; maintenance equipment allocation; maintenance time; metalworking workshop; mutation mechanism; particle swarm optimization algorithm; Artificial neural networks; Numerical models; aviation maintenance workshop; improved PSO algorithm; job scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Management, Innovation Management and Industrial Engineering (ICIII), 2012 International Conference on
  • Conference_Location
    Sanya
  • Print_ISBN
    978-1-4673-1932-4
  • Type

    conf

  • DOI
    10.1109/ICIII.2012.6339925
  • Filename
    6339925