HAO Jinghua, LIU Min, WU Cheng. Particle Swarm Optimization for Parallel MachineScheduling Problem with Machine EligibilityConstraints[J]. Chinese Journal of Electronics, 2010, 19(1): 103-106.
Citation: HAO Jinghua, LIU Min, WU Cheng. Particle Swarm Optimization for Parallel MachineScheduling Problem with Machine EligibilityConstraints[J]. Chinese Journal of Electronics, 2010, 19(1): 103-106.

Particle Swarm Optimization for Parallel MachineScheduling Problem with Machine EligibilityConstraints

  • Received Date: 1900-01-01
  • Rev Recd Date: 1900-01-01
  • Publish Date: 2010-01-05
  • Particle swarm optimization is a popular
    global optimization technology in continuous and discrete
    optimization ¯elds in recent years. This paper presents
    a particle swarm optimization-based scheduling algorithm
    for large-scale parallel machine scheduling problem with
    machine eligibility constraints and the objective of min-
    imizing the total weighted tardiness. In the proposed
    method, we ¯rst design a Machine assignment heuristic
    (MAH) which is used to assign a processing machine of
    each job based on the dynamic load-balancing mechanism,
    and then we propose a particle swarm optimization algo-
    rithm to optimize the sequence of all jobs in which MAH
    is used in the decoding process of each particle, also, the
    mechanisms of particle-moving and velocity-updating are
    devised based on the problem characteristics. Numerical
    computational results show that the proposed algorithm is
    e®ective for large-scale parallel machine scheduling prob-
    lems with machine eligibility constraints.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (1001) PDF downloads(1436) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return