A bi-objective model for robust resource-constrained project scheduling

A bi-objective model for robust resource-constrained project scheduling
复制标题

DOI:
10.1016/j.ijpe.2004.04.002
复制
发表时间:
2005-05
影响因子:
12
通讯作者:
M. Al-Fawzan;M. Haouari
M. Al-Fawzan;M. Haouari
中科院分区:
工程技术1区
文献类型:
--
作者:
M. Al-Fawzan;M. Haouari

文献摘要

被引文献

相似文献

在项目管理中出现的一个常见问题是,计划的进度经常被几个不可控的因素打乱,比如返工和纠正检测到的缺陷可能需要额外的时间。因此,项目经理往往无法达到承诺的完工日期。因此,在项目进度计划设计阶段必须考虑到这种可能的干扰及其潜在的负面后果。在本文中,我们解决的问题是设计一个项目时间表,不仅时间短,而且不容易受到返工和其他不良条件的干扰。为此,我们引入了进度稳健性的概念,建立了一个双目标资源受限项目调度模型。我们考虑稳健性最大化和最大完工时间最小化的目标。我们开发了一种禁忌搜索算法,以生成一组有效的近似解。该算法的几个变种在一大组基准问题上进行了测试和比较。
A common problem which arises in project management is the fact that the planned schedule is often disrupted by several uncontrollable factors like additional time that might be required for rework and correction of detected defects. As a result, project managers are often unable to meet the promised completion dates. It is therefore vital to take into account such possible disruptions and their potential negative consequences at the project schedule design stage. In this paper, we address the issue of designing a project schedule which is not only short in time, but also less vulnerable to disruptions due to reworks and other undesirable conditions. To that aim, we introduce the concept of schedule robustness and we develop a bi-objective resource-constrained project scheduling model. We consider the objectives of robustness maximization along with makespan minimization. We develop a tabu search algorithm in order to generate an approximate set of efficient solutions. Several variants of the algorithm are tested and compared on a large set of benchmark problems.