Resource levelling for projects with schedule-dependent time windows

被引：84
作者：
Neumann, K [1 ]
Zimmermann, J [1 ]
机构：
[1] Univ Karlsruhe, Inst Wirtschaftstheorie & Operat Res, D-76128 Karlsruhe, Germany
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1999年 / 117卷 / 03期
关键词：
project management; resource levelling; activity-on-node networks; schedule-dependent time windows;
D O I：
10.1016/S0377-2217(98)00272-0
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The paper presents polynomial heuristic procedures for different types of resource levelling problems for projects with minimum and maximum time lags between project activities. Both problems without and with explicit resource constraints are treated. Thus far, only pseudopolynomial heuristics for special resource levelling problems without maximum time lags and resource constraints have been proposed. An experimental performance analysis shows that the new heuristics approximately solve problem instances with up to 500 activities and five resources within reasonable computing time. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：591 / 605
页数：15
相关论文
共 32 条
  • [1] AHUJA HN, 1976, CONSTRUCTION PERFORM
  • [2] Ahuja R.K., 1993, NETWORK FLOWS THEORY
  • [3] [Anonymous], 1970, PROJECT MANAGEMENT C
  • [4] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
  • [5] [Anonymous], 1996, J DECIS SYST
  • [6] Baker KR., 1974, Introduction to Sequencing and Scheduling
  • [7] OPTIMAL RESOURCE LEVELING USING NON-SERIAL DYNAMIC-PROGRAMMING
    BANDELLONI, M
    TUCCI, M
    RINALDI, R
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 78 (02) : 162 - 177
  • [8] Bartusch M., 1988, Annals of Operations Research, V16, P201
  • [9] Burgess A.R., 1962, J. Ind. Eng, V13, P76
  • [10] CIOBANU G, 1972, EC COMPUTATION EC CY, V3, P61
1234