.png){kind=icon}
.png){kind=icon}
Return
Project selection, scheduling and resource allocation with time dependent returns
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2007.10.040.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Project management
Project selection
Integer programming
Heuristics
Implicit enumeration
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W