Showing 4 results for Present Value
Rabbani, K. Rezaie and N. Seid Foroush Lahiji,
Volume 24, Issue 1 (7-2005)
Abstract
Time-cost trade-off is one of the most important subjects in project management and of interest to contractors. The goal of time-cost trade-off is sensivity analysis of project costs to changes in activity duration in order to obtain the best combination of activity duration decrease, in a way that the sum of project costs is minimized. In the heuristics presented in this area, time crashing is on the base of the minimum cost slope of activities. But since projects are usually performed over
long periods, they can be affected by interest rate. In this paper, a new heuristic algorithm is presented in order to obtain the best combination of activity duration decrease while the monetary value is taken into account, with the goal of minimizing the sum of present value of project costs
Gh. Moslehi and H. Ghahar,
Volume 25, Issue 2 (1-2007)
Abstract
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).
In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have been generated. We have compared both the total time for solving the problem and NPV of the Dif_AOA with those of the recursive search procedure. Computational results show that the Dif_AOA performs very effectively.
Extensive analysis have been performed to evaluate the node number, complexity network coefficients(CNC), and deadline.
M. Rabbani, R. Tavakkoli-Moghaddam, and H. Vahdan,
Volume 27, Issue 2 (1-2009)
Abstract
This paper presents a discounted cash-flow approach to an inventory model for deteriorating items with the
two-parameter Weibull distribution. According to our proposed model, two shortages are considered: back-orders and lost-sales,
in which the back-order rate is a varying function of the time when the shortage happens. In general, the demand rate is a linear function of the selling price. The objective of this model is to determine the optimal pricing policy and the optimal throughput time in such a way that the total net present value of profits is maximized in the given planning horizon. Finally, a numerical example is provided to solve the model presented using our proposed three-stage approach.
G. Moslehi and M. Mahnam,
Volume 27, Issue 2 (1-2009)
Abstract
While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduling problem with NPV criterion. Second, the permutation flow shop scheduling problem is studied with NPV criterion. An efficient Branch & Bound algorithm is accordingly presented using strong lower and upper bounds and dominace rules which are expanded for this problem. Finally, three heuristic methods are presented and compared to find
appropriate solutions over short periods. By generating random problems of different sizes, it has been shown that the Branch & Bound method is efficient in solving small and medium sized problems, and also that the presented heuristic algorithm is efficient in tackling problems of any size.
