A Heuristic Method For The Multi-Skill Project Scheduling Problem With Partial Preemption
ICORES: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS(2019)
摘要
In this article we consider a new scheduling problem known as the Multi-Skill Project Scheduling Problem with Partial Preemption. The main characteristic of this problem is the way we handle the resources release during the preemption periods: only a subset of resources are released. Since this problem is NP-hard, we propose a greedy algorithm based on priority rules, modeling the subproblem of technicians allocation as a Minimum-Cost Maximum-Flow problem. In order to improve the performance of the greedy algorithm, we propose a randomized tree-based local search algorithm. Computational tests are carried out and analyzed.
更多查看译文
关键词
Project Scheduling, Multi-skill, Partial Preemption, Nuclear Research Facility
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络