MIP models for resource-constrained project scheduling with flexible resource profiles

被引:93
作者
Naber, Anulark [1 ]
Kolisch, Rainer [1 ]
机构
[1] Tech Univ Munich, TUM Sch Management, D-80333 Munich, Germany
关键词
Project scheduling; Flexible profiles; Principal resources; Dependent resources; Discrete-time models; TRADE-OFF PROBLEM; LIMITED RESOURCES; BOUND APPROACH; NETWORKS; BRANCH; ALGORITHM; SEARCH;
D O I
10.1016/j.ejor.2014.05.036
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper addresses the resource-constrained project scheduling problem with flexible resource profiles (FRCPSP). Such a problem often arises in many real-world applications, in which the resource usage of an activity is not merely constant, but can be adjusted from period to period. The FRCPSP is, therefore, to simultaneously determine the start time, the resource profile, and the duration of each activity in order to minimize the makespan, subject to precedence relationships, limited availability of multiple resources, and restrictions on resource profiles. We propose four discrete-time model formulations and compare their model efficiency in terms of solution quality and computational times. Both preprocessing and priority-based heuristic methods are also applied to compute both upper and lower bounds of the makespan. Our comparative results show significant dominance of one of the models, the so-called "variable-intensity-based" model, in both solution quality and runtimes. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:335 / 348
页数:14
相关论文
共 29 条
[1]  
Baumann P., 2013, P IEEE INT C IND ENG
[2]   A new formulation for the project scheduling problem under limited resources [J].
Bianco, Lucio ;
Caramia, Massimiliano .
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2013, 25 (1-2) :6-24
[3]   Resource-constrained project scheduling: Notation, classification, models, and methods [J].
Brucker, P ;
Drexl, A ;
Mohring, R ;
Neumann, K ;
Pesch, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) :3-41
[4]   PROJECT SCHEDULING WITH RESOURCE CONSTRAINTS - A BRANCH AND BOUND APPROACH [J].
CHRISTOFIDES, N ;
ALVAREZVALDES, R ;
TAMARIT, JM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 29 (03) :262-273
[5]  
De Reyck B, 1998, NAV RES LOG, V45, P553, DOI 10.1002/(SICI)1520-6750(199809)45:6<553::AID-NAV2>3.0.CO
[6]  
2-1
[7]   The discrete time/resource trade-off problem in project networks: a branch-and-bound approach [J].
Demeulemeester, E ;
De Reyck, B ;
Herroelen, W .
IIE TRANSACTIONS, 2000, 32 (11) :1059-1069
[8]  
Elmaghraby SE., 1977, ACTIVITY NETWORKS PR
[9]  
Fageth J., 2011, THESIS TUM
[10]   A priority-rule method for project scheduling with work-content constraints [J].
Fuendeling, C.-U. ;
Trautmann, N. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 203 (03) :568-574