CIGI2011: A heuristic method for resource-constrained project scheduling with activity overlapping

被引:0
|
作者
Lucas Grèze
Robert Pellerin
Patrice Leclaire
Nathalie Perrier
机构
[1] École Polytechnique de Montréal,Jarislowsky/SNC
[2] LISMMA,Lavalin Research Chair in the Management of International Projects, Department of mathematics and industrial engineering
[3] SUPMECA,undefined
来源
关键词
Activity overlapping; Concurrent engineering; Project management; Project scheduling;
D O I
暂无
中图分类号
学科分类号
摘要
The overlapping of activities is a common practice to accelerate the execution of engineering projects. This technique consists in executing in parallel two activities, normally executed in a sequential way, by allowing the downstream activity to start before the end of the upstream activity based on preliminary information. In this paper, we propose a constructive heuristic for the resource-constrained project scheduling problem with overlapping modes (RCPSP-OM). Given a set of activities to execute, the RCPSP-OM consists in determining the order of execution in time of a set of activities so as to minimize the total project duration, while respecting precedence relations, resource constraints and overlapping possibilities. The heuristic implies that rework tasks related to overlapping are added to downstream activities and that the consumption of the resources is constant throughout the execution of the project (including rework). The method also considers that the possible overlapping modes for every couple of activities and the duration of rework tasks associated with every mode are known in advance. Results show that, when the objective consists in minimizing the project duration, the consideration of the costs associated to activity overlapping allows to significantly reducing the cost of reworks. On the other hand, when the objective consists in maximizing the gains related to the project execution, the search for the best trade-off between acceleration and increase of project costs enables to avoid losses.
引用
收藏
页码:797 / 811
页数:14
相关论文
共 50 条
  • [41] Heuristic scheduling of resource-constrained, multiplemode and repetitive projects
    Zhang, Hong
    Li, Heng
    Tam, C. M.
    CONSTRUCTION MANAGEMENT AND ECONOMICS, 2006, 24 (02) : 159 - 169
  • [42] A three-dimensional spatial resource-constrained project scheduling problem: Model and heuristic
    Zhang, Jingwen
    Li, Lubo
    Demeulemeester, Erik
    Zhang, Haohua
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 319 (03) : 943 - 966
  • [43] Novel heuristic solutions for Multi-Skill Resource-Constrained Project Scheduling Problem
    Myszkowski, Pawel B.
    Skowronski, Marek E.
    Podlodowski, Lukasz
    2013 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS), 2013, : 159 - 166
  • [44] A priority rule heuristic for the multi-skilled resource-constrained project scheduling problem
    Vermeire, Guillaume
    Vanhoucke, Mario
    APPLIED SOFT COMPUTING, 2025, 171
  • [45] NONPREEMPTIVE MULTIMODE RESOURCE-CONSTRAINED PROJECT SCHEDULING
    DREXL, A
    GRUENEWALD, J
    IIE TRANSACTIONS, 1993, 25 (05) : 74 - 81
  • [46] Resource-constrained project scheduling problem with reworking
    Liao Y.
    Lu Z.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2019, 25 (11): : 2762 - 2774
  • [47] Disruption management for resource-constrained project scheduling
    Zhu, G
    Bard, JF
    Yu, G
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (04) : 365 - 381
  • [48] An Extended CPM for Resource-constrained Project Scheduling
    Ju, C. H.
    Xie, Y.
    ULTRA-PRECISION MACHINING TECHNOLOGIES, 2009, 69-70 : 695 - 699
  • [49] A Practical Approach for Resource-Constrained Project Scheduling
    Manousakis, Konstantinos
    Savva, Giannis
    Papadouri, Nicos
    Mavrovouniotis, Michalis
    Christofides, Athanasios
    Kolokotroni, Nedi
    Ellinas, Georgios
    IEEE ACCESS, 2024, 12 : 12976 - 12991
  • [50] RESOURCE-CONSTRAINED PROJECT SCHEDULING - STATE OF ART
    HERROELEN, WS
    OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (03) : 261 - +