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

Journal of Operations Management

Volumn 14, Issue 3, 1996, Pages 255-275

  Icmeli, Oya ^a   Erenguc, S Selcuk ^b  

^a CLEVELAND STATE UNIVERSITY   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; HEURISTIC PROGRAMMING; OPTIMIZATION; PROJECT MANAGEMENT; RANDOM PROCESSES; RESOURCE ALLOCATION;

COST TRADEOFF PROJECT SCHEDULING; DISCOUNTED CASH FLOWS; NET PRESENT VALUE; PRIORITY RULES; RESOURCE CONSTRAINED TIME;

SCHEDULING;

EID: 0030233586     PISSN: 02726963     EISSN: None     Source Type: Journal    
DOI: 10.1016/0272-6963(95)00025-9     Document Type: Article

References (23)

1. Baroum, S.M. and J.H. Patterson, 1993. A comparative evaluation of cash flow weight heuristics for maximizing the net present value of a project. Working Paper, Indiana University, Bloomington, Indiana.
2. Bazaraa, M.S. and C.M. Shetty, 1979. Nonlinear Programming Theory and Algorithms, Wiley, New York.
3. Bey, R.P., R.H. Doersch and J.H. Patterson, 1981. "The net present value criterion: Its impact on project scheduling", Project Management Quarterly, vol. 12, no. 2, pp. 35-45.
4. Dayanand, N. and R. Padman, 1993a. The payment scheduling problem in project networks. Working Paper 93-31, The Heinz School of Public Policy and Management, Carnegie Mellon University, Pittsburgh, PA 15213, June.
5. Dayanand, N. and R. Padman, 1993b. On modeling payments in project networks, Working Paper 93-36, The Heinz School of Public Policy and Management, Carnegie Mellon University, Pittsburgh, PA 15213, June.
6. Doersch, R.H. and J.H. Patterson, 1977. "Scheduling a project to maximize its net present value: A zero-one programming approach", Management Science, vol. 23, no. 8, pp. 882-889.
7. Elmaghraby, S.E. and W.S. Herroelen, 1990. "The scheduling of activities to maximize the net present value of projects", European Journal of Operations Research, vol. 49, pp. 35-49.
8. Erenguc, S.S., S. Tufekci and C.J. Zappe, 1993. "Solving time/cost tradeoff problems with discounted cash flows using generalized Benders decomposition", Naval Research Logistics, vol. 40, pp. 20-25.
9. Fisher, M.L., 1973. "Optimal solution of scheduling problems using Lagrange multipliers: Part 1", Oper. Res., vol. 2, no. 15, pp. 1114-1127.
10. Geoffrion, A.M., 1972. "Generalized Benders decomposition", Journal of Optimization Theory and Applications, vol. 10, pp. 260-273.
11. Grinold, R.C., 1972. "Payment scheduling problem", Naval Research Logistics Quarterly, vol. 19, no. 1, pp. 123-136.
12. Icmeli, O. and S.S. Erenguc, 1994a. "A Tabu search procedure for resource constrained project scheduling problems with discounted cash flows", Computers and Operations Research, vol. 21, no. 8, pp. 841-853.
13. Icmeli, O. and S.S. Erenguc, 1994b. Solving the constrained NPV project scheduling problems with time/cost tradeoffs, Working Paper, Cleveland State University, Cleveland, Ohio.
14. Icmeli, O., S.S. Erenguc and J.C. Zappe, 1993. "Project scheduling problems: A survey", International Journal of Operations and Production Management, vol. 13, no. 11.
15. Leachman, R.C., A. Dincerler and S. Kim, 1990. "Resource-constrained scheduling of projects with variable-intensity activities", IIE Transactions, vol. 22, no. 1, pp. 31-39.
16. Leorch, A.C. and J.A. Muckstadt, 1994. "An approach to production planing and scheduling in cyclically scheduled manufacturing systems", International Journal Product Research, vol. 32, no. 4, pp. 851-871.
17. Padman, R. and D.E. Smith-Daniels, 1993. "Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization guided heuristic approach", European Journal of Operational Research, vol. 64, pp. 295-311.
18. Patterson, J.H., F.B. Talbot, R. Slowinski and J. Weglarz, 1990. "Computational experience with a backtracking algorithm for solving a general class of precedence and resource constrained scheduling problems", European Journal of Operational Research, vol. 49, pp. 68-79.
19. Polyak, B.T., 1967. "A general method for solving extremal problems", Sov. Math. Dokl., vol. 8, pp. 592-597.
20. Russell, R.A., 1986. "A comparison of heuristics for scheduling projects with cash flows and resource restrictions", Management Science, vol. 32, no. 10, pp. 1291-1300.
21. Smith-Daniels, D.E. and V.L. Smith-Daniels, 1987. "Maximizing the net present value of a project subject to material and capital constraints", Journal of Operations Management, vol. 7, no. 1, pp. 33-45.
22. Talbot, B.F., 1982. "Resource constrained project scheduling with time-resource tradeoffs: The nonpreemtive case", Management Science, vol. 28, no. 10, pp. 1197-1210.
23. Yang, K.K., F.B. Talbot and J.H. Patterson, 1992. "Scheduling a project to maximize its net present value: An integer programming approach", European Journal of Operational Research, vol. 64, pp. 188-198.