检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Yan Shangyao Wang Sin-Siang Chen Miawjane Liu Jzu-Chun
机构地区:[1]National Central University, Chungli, Taiwan [2]National United University, Miaoli, Taiwan
出 处:《Journal of Modern Accounting and Auditing》2014年第12期1187-1200,共14页现代会计与审计(英文版)
摘 要:This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows (MRCPSPDCF), individually including the progress payment (PP) and the payment at an equal time interval (ETI). The objective of each model is to maximize the net present value (NPV) for all cash flows in the project, subject to the related operational constraints. The models are characterized as NP-hard. A heuristic algorithm, coupled with two upper bound solutions, is proposed to efficiently solve the models and evaluate the heuristic algorithm performance which was not performed in past studies. The results show that the performance of proposed models and heuristic algorithm is good.
关 键 词:project scheduling problem multi-mode resource constrained project scheduling problem with discountedcash flows (MRCPSPDCF) progress payment (PP) payment at an equal time interval (ETI) time-precedence network
分 类 号:O224[理学—运筹学与控制论] TV697.11[理学—数学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.60