Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization

被引:14
|
作者
Qi, Jian-Jun [1 ]
Liu, Ya-Jie [1 ]
Jiang, Ping [1 ]
Guo, Bo [1 ]
机构
[1] Natl Univ Def Technol, Coll Informat Syst & Management, Changsha 410073, Hunan, Peoples R China
基金
中国国家自然科学基金;
关键词
Project scheduling; Multi-mode resource availability cost problem; Schedule generation; Forward activity list; Modified particle swarm optimization; GENETIC ALGORITHM; SCATTER SEARCH; PROJECT;
D O I
10.1007/s10951-014-0374-0
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The resource availability cost problem (RACP) (Mohring, Operations Research, 32:89-120, 1984) is commonly encountered in project scheduling. RACP aims to minimize the resource availability cost of a project by a given project deadline. In this study, RACP is extended from a single mode to a multi-mode called multi-mode RACP (MMRACP), which is more complicated than RACP but more convenient in practice. To solve MMRACP efficiently, forward activity list (FAL), a schedule generation scheme, is proposed. Heuristic algorithms are designed according to the characteristics of FAL to repair infeasible solutions and to improve the fitness of the solution. Modified particle swarm optimization (MPSO), which combines the advantages of particle swarm optimization and scatter search, is proposed to make the search for the best solution efficient. Computational experiments involving 180 instances are performed to validate the performance of the proposed algorithm. The results reveal that MPSO using FAL is a very effective method to solve MMRACP.
引用
收藏
页码:285 / 298
页数:14
相关论文
共 34 条
  • [1] Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization
    Jian-Jun Qi
    Ya-Jie Liu
    Ping Jiang
    Bo Guo
    Journal of Scheduling, 2015, 18 : 285 - 298
  • [2] Solving the Multi-Mode Resource Availability Cost Problem in Project Scheduling Based on Modified Particle Swarm Optimization
    Qi, Jian-Jun
    Liu, Ya-Jie
    Lei, Hong-Tao
    Guo, Bo
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2014, 39 (06) : 5279 - 5288
  • [3] Solving the Multi-Mode Resource Availability Cost Problem in Project Scheduling Based on Modified Particle Swarm Optimization
    Jian-Jun Qi
    Ya-Jie Liu
    Hong-Tao Lei
    Bo Guo
    Arabian Journal for Science and Engineering, 2014, 39 : 5279 - 5288
  • [4] Solving resource availability cost problem in project scheduling by pseudo particle swarm optimization
    Qi, Jianjun
    Guo, Bo
    Lei, Hongtao
    Zhang, Tao
    JOURNAL OF SYSTEMS ENGINEERING AND ELECTRONICS, 2014, 25 (01) : 69 - 76
  • [5] Solving resource availability cost problem in project scheduling by pseudo particle swarm optimization
    Jianjun Qi
    Bo Guo
    Hongtao Lei
    Tao Zhang
    Journal of Systems Engineering and Electronics, 2014, 25 (01) : 69 - 76
  • [6] An Efficient Discrete Particle Swarm Optimization for Solving Multi-mode Resource-constrained Project Scheduling Problem
    Cui, Jianshuang
    Yu, Liruoyang
    2014 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2014, : 858 - 862
  • [7] Multi-mode resource availability cost problem with recruitment and release dates for resources
    Afshar-Nadjafi, Behrouz
    APPLIED MATHEMATICAL MODELLING, 2014, 38 (21-22) : 5347 - 5355
  • [8] Heuristic approaches for a multi-mode resource availability cost problem in aircraft manufacturing
    Bierbuesse, Jan
    Moench, Lars
    Biele, Alexander
    COMPUTERS & OPERATIONS RESEARCH, 2025, 176
  • [9] Solving multi-mode resource-constrained scheduling problem of prefabricated construction using genetic algorithm
    Xie, Lin-lin
    Li, Denghe
    Wu, Sisi
    Chang, Rui-Dong
    ENGINEERING CONSTRUCTION AND ARCHITECTURAL MANAGEMENT, 2025,
  • [10] Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP)
    Pinto, Gaby
    Ben-Dov, Yariv T.
    Rabinowitz, Gad
    ANNALS OF OPERATIONS RESEARCH, 2013, 206 (01) : 311 - 339