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

H. L. CHEN; Chiuh-Cheng CHYU

doi:10.1631/jzus.C0910633

Your Location：

Home >

Browse articles >

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

运筹学 | Updated：2022-08-31

- Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach
- Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach
- 信息与电子工程前沿（英文） 2010年11卷第6期页码：481-494
- Affiliations：
  
  1.Department of Industrial Engineering and Management, Yuan Ze University, Taiwan 320, Taoyuan
  2.Department of Finance, Nanya Institute of Technology, Taiwan 320, Taoyuan
- Author bio：
  
  E-mail:angela@saturn.yzu.edu.tw
- Funds：
- DOI：10.1631/jzus.C0910633
  中图分类号：
- 收稿：2009-10-22，
  
  修回：2010-05-14，
  
  录用：2009-12-07，
  
  纸质出版：2010-06
- Accepted：
Scan QR Code
Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach[J]. 信息与电子工程前沿（英文）, 2010,11(6):481-494.

H. L. CHEN, Chiuh-Cheng CHYU. Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach[J]. Frontiers of Information Technology & Electronic Engineering, 2010, 11(6): 481-494.
Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach[J]. 信息与电子工程前沿（英文）, 2010,11(6):481-494. DOI： 10.1631/jzus.C0910633.

H. L. CHEN, Chiuh-Cheng CHYU. Economic optimization of resource-constrained project scheduling: a two-phase metaheuristic approach[J]. Frontiers of Information Technology & Electronic Engineering, 2010, 11(6): 481-494. DOI： 10.1631/jzus.C0910633.

摘要

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.

关键词

Keywords

references

浏览量

Downloads

CSCD

文章被引用时，请邮件提醒。

Submit

工具集

关联资源

暂无数据