Economic optimization of resource-constrained project scheduling： a two-phase metaheuristic approach

This paper deals with the problem of project scheduling subject to multiple execution modes with non-renewable resources, and a model that handles some of monetary issues in real world applications. The objective is to schedule the activities to maximize the expected net present value （NPV） of the p...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers of information technology & electronic engineering 2010-06, Vol.11 (6), p.481-494
Main Authors: Chen, Angela H. L., Chyu, Chiuh-Cheng
Format: Article
Language:English
Subjects:
Algorithms
Combinatorial analysis
Communications Engineering
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Electrical Engineering
Electronics and Microelectronics
Heuristic methods
Instrumentation
Networks
Nonrenewable resources
Optimization
Resource scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper deals with the problem of project scheduling subject to multiple execution modes with non-renewable resources, and a model that handles some of monetary issues in real world applications. The objective is to schedule the activities to maximize the expected net present value （NPV） of the project, taking into account the activity costs, the activity durations, and the cash flows generated by successfully completing an activity. Owing to the combinatorial nature of this problem, the current study develops a hybrid of branch-and-bound procedure and memetic algorithm to enhance both mode assignment and activity scheduling. Modifications for the makespan minimization problem have been made through a set of benchmark problem instances. Algorithmic performance is rated on the maximization of the project NPV and computational results show that the two-phase hybrid metaheuristic performs competitively for all instances of different problem sizes.
ISSN:1869-1951
2095-9184
1869-196X
2095-9230
DOI:10.1631/jzus.C0910633