迭代局部搜索
数学优化
元启发式
迭代函数
计算机科学
水准点(测量)
局部搜索(优化)
作业车间调度
调度(生产过程)
随机规划
资源限制
数学
地铁列车时刻表
分布式计算
数学分析
操作系统
地理
大地测量学
作者
Alfredo S. Ramos,Pablo A. Miranda-González,Samuel Nucamendi-Guillén,Elìas Olivares-Benítez
出处
期刊:Mathematics
[MDPI AG]
日期:2023-01-09
卷期号:11 (2): 337-337
被引量:2
摘要
This research introduces a stochastic version of the multi-mode resource-constrained project scheduling problem (MRCPSP) and its mathematical model. In addition, an efficient multi-start iterated local search (MS-ILS) algorithm, capable of solving the deterministic MRCPSP, is adapted to deal with the proposed stochastic version of the problem. For its deterministic version, the MRCPSP is an NP-hard optimization problem that has been widely studied. The problem deals with a trade-off between the amount of resources that each project activity requires and its duration. In the case of the proposed stochastic formulation, the execution times of the activities are uncertain. Benchmark instances of projects with 10, 20, 30, and 50 activities from well-known public libraries were adapted to create test instances. The adapted algorithm proved to be capable and efficient for solving the proposed stochastic problem.
科研通智能强力驱动
Strongly Powered by AbleSci AI