The resource constrained time/cost tradeoff project scheduling problem with discounted cash flows

Journal of Operations Management - Tập 14 - Trang 255-275 - 1996
Oya Icmeli1, S.Selcuk Erenguc2
1Cleveland State University, Operations Management and Business Stat. Department, Cleveland, OH 44115, USA
2University of Florida Decision and Information Sciences Department, Gainesville, FL 32611, USA

Tóm tắt

AbstractMany of the recent studies on Project Scheduling focus on maximizing the Net Present Value (NPV) of cash flows that occur during the implementation of a project in the presence of precedence and resource constraints. The literature contains several integer programming formulations, heuristic procedures and their implementations. In most of these formulations, activity durations are assumed to be fixed. In this paper, we study a practical extension of the problem where the activity durations can be reduced from their normal durations by allocating more resources. Costs associated with such reductions are referred to as crashing costs. The problem under consideration involves determining the timing and duration of activities such that the NPV of all cash flows is maximized in the presence of precedence and resource constraints. We suggest a heuristic procedure for obtaining “good” feasible solutions. We compare the performance of three priority rules embedded in the proposed procedure. Two of these priority rules have been shown to be the most effective in the literature, the third is a new rule developed in this paper. Extensive computational experiments with the heuristic procedure on a total of 380 test problems are reported. The heuristic solutions are compared to benchmark solutions obtained from the best of 50‐randomly generated solutions for each test problem. In addition, upper bounds on the optimal values are obtained by performing Subgradient optimization on a Lagrangian Relaxation of the problem. These upper bounds are used to assess the quality of the heuristic solutions. In general, none of the priority rules produced consistently better results for all the test problems. However, all three priority rules provide “good” quality solutions with modest computational effort. The Lagrangian approach is found to provide tight bounds on the optimal values.

Tài liệu tham khảo

Baroum S.M., 1993, A comparative evaluation of cash flow weight heuristics for maximizing the net present value of project Bazaraa M.S., 1979, Nonlinear Programming Theory and Algorithms Bey R.P., 1981, The net present value criterion: Its impact on project scheduling, Project Management Quarterly, 12, 35 Dayanand N., 1993, The payment scheduling problem in project networks Dayanand N., 1993, On modeling payments in project networks 10.1287/mnsc.23.8.882 10.1016/0377-2217(90)90118-U 10.1002/1520-6750(199302)40:1<25::AID-NAV3220400103>3.0.CO;2-2 10.1287/opre.21.5.1114 10.1007/BF00934810 Grinold R.C., 1972, Payment scheduling problem, Naval Research Logistics Quarterly, 19, 122, 10.1002/nav.3800190110 10.1016/0305-0548(94)90014-0 Icmeli O., 1994, Solving the constrained NPV project scheduling problems with time/cost tradeoffs Icmeli O., 1993, Project scheduling problems: A survey, International Journal of Operations and Production Management, 13, 10.1108/01443579310046454 10.1080/07408179008964155 10.1080/00207549408956975 10.1016/0377-2217(93)90184-O 10.1016/0377-2217(90)90121-Q Polyak B.T., 1967, A general method for solving extremal problems, Sov. Math. Dokl., 8, 592 10.1287/mnsc.32.10.1291 10.1016/0272-6963(87)90005-2 10.1287/mnsc.28.10.1197 10.1016/0377-2217(93)90176-N
Thông tin
Thông tin xuất bản

Journal of Operations Management

Tập 14

255-275

Thông tin tác giả