Project selection, scheduling and resource allocation with time dependent returns

被引:85
作者
Chen, Jiaqiong [2 ]
Askin, Ronald G. [1 ]
机构
[1] Arizona State Univ, Dept Ind Engn, Tempe, AZ 85287 USA
[2] FedEx World Headquarters, Memphis, TN 38125 USA
关键词
Project management; Project selection; Integer programming; Heuristics; Implicit enumeration; NET PRESENT VALUE; TRADE-OFF PROBLEM; BOUND PROCEDURE; EXACT ALGORITHM; LOCAL SEARCH; HEURISTICS; MODELS; GENERATION; MINIMUM;
D O I
10.1016/j.ejor.2007.10.040
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper we formulate and analyze the joint problem of project selection and task scheduling. We study the situation where a manager has many alternative projects to pursue such as developing new product platforms or technologies, incremental product upgrades, or continuing education of human resources. Project return is assumed to be a known function of project completion time. Resources are limited and renewable. The objective is to maximize present worth of profit. A general mathematical formulation that can address several versions of the problem is presented. An implicit enumeration procedure is then developed and tested to provide good solutions based on project ordering and a prioritization rule for resource allocation. The algorithm uses an imbedded module for solving the resource-con strained project scheduling problem at each stage. The importance of integrating the impact of resource constraints into the selection of projects is demonstrated. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:23 / 34
页数:12
相关论文
共 75 条
[1]   Network decomposition-based benchmark results for the discrete time-cost tradeoff problem [J].
Akkan, C ;
Drexl, A ;
Kimms, A .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (02) :339-358
[2]   Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms [J].
Alcaraz, J ;
Maroto, C ;
Ruiz, R .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (06) :614-626
[3]  
Alcaraz J., 2004, Proceedings of the ninth international workshop on project management and scheduling, P40
[4]  
[Anonymous], 2003, P 3 INT WORKSH COMP
[5]   Project scheduling under partially renewable resource constraints [J].
Böttcher, J ;
Drexl, A ;
Kolisch, R ;
Salewski, F .
MANAGEMENT SCIENCE, 1999, 45 (04) :543-559
[6]   A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version [J].
Bouleimen, K ;
Lecocq, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (02) :268-281
[7]  
Bounds G, 1998, IIE SOLUTIONS, V30, P41
[8]   A branch and bound algorithm for the resource-constrained project scheduling problem [J].
Brucker, P ;
Knust, S ;
Schoo, A ;
Thiele, O .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (02) :272-288
[9]  
Brucker P, 2006, GOR-PUBL, P1, DOI 10.1007/3-540-29546-1
[10]   Lower bounds for resource-constrained project scheduling problems [J].
Brucker, P ;
Knust, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (02) :302-313