Fuzzy-based adaptive sample-sort simulated annealing for resource-constrained project scheduling

被引:0
作者
Sanjay Kumar Shukla
Young Jun Son
M. K. Tiwari
机构
[1] National Institute of Foundry and Forge Technology,Department of Manufacturing Engineering
[2] University of Arizona,Department of Systems and Industrial Engineering
[3] National Institute of Foundry and Forge Technology,Department of Forge Technology
来源
The International Journal of Advanced Manufacturing Technology | 2008年 / 36卷
关键词
Project scheduling; Precedence constraints; Resource constraints; Sample-sort simulated annealing (SSA); Schedule generation scheme (SGS); Fuzzy logic controller (FLC);
D O I
暂无
中图分类号
学科分类号
摘要
This paper deals with the resource-constrained project scheduling problems (RCPSP), where the activities of a project have to be scheduled with the objective of minimizing the makespan subject to both temporal and resource constraints. Being one of the most intractable problems in the operations research area, RCPSP has often been a target and test bed for establishing new optimization tools and techniques. In order to efficiently solve this computationally complex problem in real time, we propose a parallel intelligent search technique named the fuzzy-based adaptive sample-sort simulated annealing (FASSA) heuristic. The basic ingredients of the proposed heuristic are the serial schedule generation scheme (SGS), sample-sort simulated annealing (SSA), and the fuzzy logic controller (FLC). The serial SGS generates the initial schedules following both the precedence and resource constraints. SSA is basically a serial simulated annealing algorithm, artificially extended across an array of samplers operating at statistically monotonically increasing temperatures. The FLC makes the SSA adaptive in nature by regulating the swapping rate of an activity’s priority during an improved schedule generation process. The implementation results of the FASSA heuristic over extremely hard test bed, adopted from the Project Scheduling Problem Library (PSPLIB), reveal its superiority over most of the currently existing approaches.
引用
收藏
页码:982 / 995
页数:13
相关论文
共 50 条
[31]   An updated survey of variants and extensions of the resource-constrained project scheduling problem * [J].
Hartmann, Sonke ;
Briskorn, Dirk .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 297 (01) :1-14
[32]   Note: On semi-active timetabling in resource-constrained project scheduling [J].
Sprecher, A ;
Drexl, A .
MANAGEMENT SCIENCE, 1999, 45 (03) :452-454
[33]   Algorithm for Resource-constrained Project Scheduling Problem With Resource Transfer Time [J].
Lu Z.-Q. ;
Liu X.-Y. .
Lu, Zhi-Qiang (zhiqianglu@tongji.edu.cn), 2018, Science Press (44) :1028-1036
[34]   A hybrid metaheuristic for resource-constrained project scheduling with, flexible resource profiles [J].
Tritschler, Martin ;
Naber, Anulark ;
Kolisch, Rainer .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 262 (01) :262-273
[35]   MIP models for resource-constrained project scheduling with flexible resource profiles [J].
Naber, Anulark ;
Kolisch, Rainer .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 239 (02) :335-348
[36]   Resource-constrained project scheduling with flexible resource profiles in continuous time [J].
Naber, Anulark .
COMPUTERS & OPERATIONS RESEARCH, 2017, 84 :33-45
[37]   A survey in the resource-constrained project and multi-project scheduling problems [J].
Ben Issa, Samer ;
Tu, Yiliu .
JOURNAL OF PROJECT MANAGEMENT, 2020, 5 (02) :117-138
[38]   A reactive scheduling approach for the resource-constrained project scheduling problem with dynamic resource disruption [J].
Xu, Jiaojiao ;
Bai, Sijun .
KYBERNETES, 2024, 53 (06) :2007-2028
[39]   Heuristic Methods for Finance-Based and Resource-Constrained Project Scheduling Problem [J].
Liu, Wanlin ;
Zhang, Jingwen ;
Li, Wanjun .
JOURNAL OF CONSTRUCTION ENGINEERING AND MANAGEMENT, 2021, 147 (11)
[40]   Particle swarm optimization-based schemes for resource-constrained project scheduling [J].
Zhang, H ;
Li, XD ;
Li, H ;
Huang, FL .
AUTOMATION IN CONSTRUCTION, 2005, 14 (03) :393-404