Integrated Planning and Scheduling of Multiple Manufacturing Projects Under Resource Constraints Using Raccoon Family Optimization Algorithm

被引:24
作者
Rauf, Mudassar [1 ]
Guan, Zailin [1 ]
Yue, Lei [1 ]
Guo, Ziteng [1 ]
Mumtaz, Jabir [1 ]
Ullah, Saif [1 ,2 ]
机构
[1] Huazhong Univ Sci & Technol, SANY Joint Lab Adv Mfg, State Key Lab Digital Mfg Equipment & Technol, Wuhan 430074, Peoples R China
[2] Univ Engn & Technol Taxila, Dept Ind Engn, Taxila 47080, Pakistan
来源
IEEE ACCESS | 2020年 / 8卷 / 08期
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Planning; Job shop scheduling; Optimization; Delays; Genetic algorithms; Companies; Project planning and scheduling; multiple projects; resource constraint; execution modes; Raccoon family optimization algorithm; NET-BASED APPROACH; GENETIC ALGORITHM; PRIORITY RULES; MULTIMODE; PERFORMANCE;
D O I
10.1109/ACCESS.2020.2971650
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Today's dynamic environment and increasing demand for highly customized products have significantly increased the number of companies operating in the project environment. Project planning and scheduling are one of the major problems faced by managers due to resource constraints. Enterprises have to execute several projects simultaneously while sharing limited resources (i.e., human resources, equipment, and budget) among the projects to effectively meet the deadlines. Therefore, this work investigates the integrated planning and scheduling problem of multiple projects with different release dates and execution modes while considering the renewable and non-renewable resource constraints. Moreover, the raccoon family optimization (RFO) algorithm is proposed to maximize the net profit while considering the early completion bonus, penalty cost, and resource costs. In the proposed RFO algorithm, greedy search and modified genetic operators are introduced to enhance the performance and efficiency. Effectiveness of the proposed RFO algorithm is compared with the genetic algorithm (GA), raccoon optimization algorithm (ROA), and artificial bee colonial (ABC) algorithm on test cases as well as an industrial case study. The results indicate that the proposed RFO algorithm outperforms the other compared algorithms, both in terms of effectiveness and efficiency.
引用
收藏
页码:151279 / 151295
页数:17
相关论文
共 58 条
  • [21] A PETRI-NET BASED APPROACH FOR SCHEDULING AND RESCHEDULING RESOURCE-CONSTRAINED MULTIPLE PROJECTS
    Kao, Hsing-Pei
    Hsieh, Ben
    Yeh, Yingchieh
    [J]. JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2006, 23 (06) : 468 - 477
  • [22] Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling
    Kim, KW
    Yun, YS
    Yoon, JM
    Gen, M
    Yamazaki, G
    [J]. COMPUTERS IN INDUSTRY, 2005, 56 (02) : 143 - 160
  • [23] MULTI-PROJECT SCHEDULING WITH EXPLICIT LATENESS COSTS
    KIM, SY
    LEACHMAN, RC
    [J]. IIE TRANSACTIONS, 1993, 25 (02) : 34 - 44
  • [24] Kolisch R, 1996, EUR J OPER RES, V90, P320, DOI [10.1016/0377-2217(95)00357-6, 10.1016/S0377-2217(96)00170-1]
  • [25] Raccoon Optimization Algorithm
    Koohi, Sina Zangbari
    Hamid, Nor Asilah Wati Abdul
    Othman, Mohamed
    Ibragimov, Gafurjan
    [J]. IEEE ACCESS, 2019, 7 : 5383 - 5399
  • [26] Managing and modelling general resource transfers in (multi-)project scheduling
    Krueger, Doreen
    Scholl, Armin
    [J]. OR SPECTRUM, 2010, 32 (02) : 369 - 394
  • [27] A heuristic solution framework for the resource constrained (multi-)project scheduling problem with sequence-dependent transfer times
    Krueger, Doreen
    Scholl, Armin
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (02) : 492 - 508
  • [28] Kucuksayacigil F., 2018, 36791 SAB U
  • [29] Multi-project scheduling using an heuristic and a genetic algorithm
    Kumanan, S.
    Jose, G. Jegan
    Raja, K.
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 31 (3-4) : 360 - 366
  • [30] Probability of project completion using stochastic project scheduling simulation
    Lee, DE
    [J]. JOURNAL OF CONSTRUCTION ENGINEERING AND MANAGEMENT, 2005, 131 (03) : 310 - 318