Scheduling projects to maximize net present value - The case of time-dependent, contingent cash flows

European Journal of Operational Research

Volumn 96, Issue 1, 1997, Pages 90-96

  Etgar, Ran ^a   Shtub, Avraham ^a   Leblanc, Larry J ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BUDGET CONTROL; COMPUTER SIMULATION; INDUSTRIAL ECONOMICS; LINEAR PROGRAMMING; OPTIMIZATION; PERT; RESOURCE ALLOCATION;

CONTINGENT CASH FLOWS; NET PRESENT VALUE (NPV); TIME DEPENDENT;

SCHEDULING;

EID: 0030784381     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00382-7     Document Type: Article

References (21)

1. Aarts, E. and Korst, J., 1989. Simulated Annealing and Boltzmann Machines, Chichester, U.K., John Wiley.
2. Abramson, D., 1991. Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms. Management Science, 37(1), 98-113.
3. Ahmade, R.H. and Tang, C., 1991. An Operation Portioning Problem for Automated Assembly System Design. Operations Research, 39(5), 824-835.
4. Chen, C., Racine, R. and Swift, F., 1992. A Practical Approach to the Apparel Production and Scheduling Problem. Journal of Clothing Science and Technology, 4(2), 9-17.
5. Dantzig, G.B., 1963. Linear Programming and Extensions, Princeton University Press, Princeton, NY.
6. Doersch, R.H. and Patterson, J.H., 1977. Scheduling a Project to Maximize Its Present Value: A Zero-one Programming Approach. Management Science 23(8) 882-889.
7. Elmaghraby, S.E., 1977. Activity Networks: Project Planning and Control by Network Models, Wiley, New York.
8. Elmaghraby, S.E. and Herroelen, W.S., 1990. The Scheduling of Activities to Maximize the Net Present Value of Projects. European Journal of Operational Research, 49, 35-49.
9. Fetterolf, P. and Anandalingam, G., 1991. Optimizing Interconnection of Local Area Networks: A Simulated Annealing Approach. ORSA Journal on Computing, 3, 275-287.
10. Friesz, T.L., Cho, H.J., Mehta, N.J., Tobin, R.L. and Anandalingam, G., 1993. A Simulated Annealing Approach to the Network Design Problem With Variational Inequality Constraints. Transportation Science, 26(1), 18-26.
11. Grinold, R.C., 1972. The Payment Scheduling Problem. Naval Research Logistics Quarterly 19(1), 123-136.
12. Herroelen, W.S., and Gallens, E., 1993. Computational Experience with an Optimal Procedure for the Scheduling of Activities to Maximize the Net Present Value of Projects. European Journal of Operational Research, 65, 274-277.
13. Johnson, D.S., Aragon, C.A., McGeoch, L.A. and Schevon, C., 1989. Optimization by Simulated Annealing: An Experimental Evaluation; Part 1, Graph Partitioning. Operations Research, 37(6), 865-892.
14. Kirkpatrick, S., Gelatt, C. and Vecchi, M., 1983. Optimization by Simulated Annealing. Science, 220, 671-680.
15. Pearl, J., 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving, Reading, MA: Addison-Wesley.
16. Russell, A.H., 1970. Cash Flows in Networks. Management Science, 16(5), 357-373.
17. Russell, R.A., 1986. A Comparison of Heuristics for Scheduling Projects With Cash Flows and Resource Restrictions. Management Science, 32(10), 1291-1300.
18. Sepil, C., 1994. Comment on Elmaghraby and Herroelen's The Scheduling of Activities to Maximize The Net Present Value of Projects. European Journal of Operational Research, 73, 185-187.
19. Smith-Daniels, D.E. and Aquilano, N.J., 1987. Using a Late-start Resource-Constrained Project Schedule to Improve Project Net Present Value. Decision Sciences, 18, 617-630.
20. Sofianopoulos, S., 1992. Simulated Annealing Applied to the Processor Allocation Problem. European Journal of Operational Research, 60(3), 327-334.
21. Van Laarhoven, P.J.M., Aarts, E.H.L. and Lenstra, J.K., 1992. Job Shop Scheduling By Simulated Annealing. Operations Research, 40(1), 113-125.