迭代局部搜索(Iterated Local Search)算法是一个简单、高效的元启发式算法。提出一种新的求解资源受限项目调度问题(RCPSP)的迭代局部搜索算法。通过对当前解进行迭代交换实现局部搜索过程,再通过扰动多个任务的方式进行有效的扰动,防...迭代局部搜索(Iterated Local Search)算法是一个简单、高效的元启发式算法。提出一种新的求解资源受限项目调度问题(RCPSP)的迭代局部搜索算法。通过对当前解进行迭代交换实现局部搜索过程,再通过扰动多个任务的方式进行有效的扰动,防止陷入局部最优。迭代过程中通过优先对关键链的任务进行局部搜索进一步缩小解空间,通过双对齐技术提高解的质量。最终通过标准问题库求出各项参数并且验证算法的性能。展开更多
Themulti-skill resource-constrained project scheduling problem(MS-RCPSP)is a significantmanagement science problem that extends from the resource-constrained project scheduling problem(RCPSP)and is integrated with a r...Themulti-skill resource-constrained project scheduling problem(MS-RCPSP)is a significantmanagement science problem that extends from the resource-constrained project scheduling problem(RCPSP)and is integrated with a real project and production environment.To solve MS-RCPSP,it is an efficient method to use dispatching rules combined with a parallel scheduling mechanism to generate a scheduling scheme.This paper proposes an improved gene expression programming(IGEP)approach to explore newly dispatching rules that can broadly solve MS-RCPSP.A new backward traversal decoding mechanism,and several neighborhood operators are applied in IGEP.The backward traversal decoding mechanism dramatically reduces the space complexity in the decoding process,and improves the algorithm’s performance.Several neighborhood operators improve the exploration of the potential search space.The experiment takes the intelligent multi-objective project scheduling environment(iMOPSE)benchmark dataset as the training set and testing set of IGEP.Ten newly dispatching rules are discovered and extracted by IGEP,and eight out of ten are superior to other typical dispatching rules.展开更多
In this paper, we present an extension of the classical Resource Constrained Project Scheduling Problem (RCPSP). We present a new type of resource constraints in which staff members are involved. We present a new mode...In this paper, we present an extension of the classical Resource Constrained Project Scheduling Problem (RCPSP). We present a new type of resource constraints in which staff members are involved. We present a new model where staff members can have several skills with different proficiency, i.e., a staff member is able to perform more than one kind of activity as well as the time need is complete the task assign depends on the staff individual skill. We call this model the Weighted-Multi-Skill Project Scheduling Problem (WMSPSP). In our model, an activity has specific skill requirements that must be satisfied. To solve this problem, we propose a lower bound that uses a linear programming scheme for the RCPSP.展开更多
文摘迭代局部搜索(Iterated Local Search)算法是一个简单、高效的元启发式算法。提出一种新的求解资源受限项目调度问题(RCPSP)的迭代局部搜索算法。通过对当前解进行迭代交换实现局部搜索过程,再通过扰动多个任务的方式进行有效的扰动,防止陷入局部最优。迭代过程中通过优先对关键链的任务进行局部搜索进一步缩小解空间,通过双对齐技术提高解的质量。最终通过标准问题库求出各项参数并且验证算法的性能。
基金funded by the National Natural Science Foundation of China(Nos.51875420,51875421,52275504).
文摘Themulti-skill resource-constrained project scheduling problem(MS-RCPSP)is a significantmanagement science problem that extends from the resource-constrained project scheduling problem(RCPSP)and is integrated with a real project and production environment.To solve MS-RCPSP,it is an efficient method to use dispatching rules combined with a parallel scheduling mechanism to generate a scheduling scheme.This paper proposes an improved gene expression programming(IGEP)approach to explore newly dispatching rules that can broadly solve MS-RCPSP.A new backward traversal decoding mechanism,and several neighborhood operators are applied in IGEP.The backward traversal decoding mechanism dramatically reduces the space complexity in the decoding process,and improves the algorithm’s performance.Several neighborhood operators improve the exploration of the potential search space.The experiment takes the intelligent multi-objective project scheduling environment(iMOPSE)benchmark dataset as the training set and testing set of IGEP.Ten newly dispatching rules are discovered and extracted by IGEP,and eight out of ten are superior to other typical dispatching rules.
文摘In this paper, we present an extension of the classical Resource Constrained Project Scheduling Problem (RCPSP). We present a new type of resource constraints in which staff members are involved. We present a new model where staff members can have several skills with different proficiency, i.e., a staff member is able to perform more than one kind of activity as well as the time need is complete the task assign depends on the staff individual skill. We call this model the Weighted-Multi-Skill Project Scheduling Problem (WMSPSP). In our model, an activity has specific skill requirements that must be satisfied. To solve this problem, we propose a lower bound that uses a linear programming scheme for the RCPSP.
