Please wait a minute...
FITEE
Front. Inform. Technol. Electron. Eng.  2010, Vol. 11 Issue (6): 481-494    DOI: 10.1631/jzus.C0910633
    
Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach
Angela H. L. Chen*,1,2, Chiuh-Cheng Chyu1
1 Department of Industrial Engineering and Management, Yuan Ze University, Taiwan 320, Taoyuan 2 Department of Finance, Nanya Institute of Technology, Taiwan 320, Taoyuan
Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach
Angela H. L. Chen*,1,2, Chiuh-Cheng Chyu1
1 Department of Industrial Engineering and Management, Yuan Ze University, Taiwan 320, Taoyuan 2 Department of Finance, Nanya Institute of Technology, Taiwan 320, Taoyuan
 全文: PDF(182 KB)  
摘要： 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.
关键词： Memetic algorithm (MA);  Branch and bound (B&B) algorithm;  Net present value (NPV);  Project scheduling problem    
Abstract: 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.
Key words: Memetic algorithm (MA)    Branch and bound (B&B) algorithm    Net present value (NPV)    Project scheduling problem
收稿日期: 2009-10-22 出版日期: 2010-06-02
CLC:  C935  
通讯作者: Angela H. L. CHEN     E-mail: angela@saturn.yzu.edu.tw
服务　　
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章　　
Angela H. L. Chen
Chiuh-Cheng Chyu

引用本文:

Angela H. L. Chen, Chiuh-Cheng Chyu. Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach. Front. Inform. Technol. Electron. Eng., 2010, 11(6): 481-494.

链接本文:

http://www.zjujournals.com/xueshu/fitee/CN/10.1631/jzus.C0910633    或    http://www.zjujournals.com/xueshu/fitee/CN/Y2010/V11/I6/481

No related articles found!