.png){kind=icon}
返回
Progress payments in project scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00452-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we study the unconstrained project scheduling problem with discounted cash flows where the net cash flows are assumed to be dependent on the completion times of the corresponding activities. Cash outflows occur when an activity is completed whereas cash inflows are incurred as progress payments at the end of some time period. The objective is to schedule the activities in order to maximize the net present value of the project subject to the precedence constraints and a fixed deadline. This paper extends the ever-growing amount of research concerning the financial aspects in project scheduling in which cash flows are time-dependent. We introduce a branch-and-bound algorithm which computes upper bounds by making piecewise linear overestimations. In doing so, the algorithm transforms the problem into a weighted earliness-tardiness project scheduling problem. The algorithm is extended with two new rules in order to reduce the size of the branch-and-bound tree. Computational results are reported. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
branch and bound
project scheduling
net present value
progress payments
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Mechanism of binding of multivalent immune complexes to Fc receptors. 1. Equilibrium binding.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏A Compact Ionic Polymer Metal Composite (IPMC) System with Inductive Sensor for Closed Loop FeedbackActuators
OAAI
ActuatorsIF0
OAAI分享收藏分享收藏
查看更多内容