Metaheuristic scheduling procedure for resource-constrained projects with cash flows

Naval Research Logistics

Volumn 46, Issue 8, 1999, Pages 912-927

  Zhu, Dan ^a   Padman, Rema ^b  

^a IOWA STATE UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC PROGRAMMING; OPTIMIZATION; PLANNING; RESOURCE ALLOCATION;

CONSTRAINED PROJECT SCHEDULING; METAHEURISTIC SCHEDULING PROCEDURE; NET PRESENT VALUE; RESOURCE CONSTRAINED PROJECTS; TABU SEARCH;

SCHEDULING;

EID: 0033350920     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199912)46:8<912::AID-NAV3>3.0.CO;2-C     Document Type: Article

References (19)

1. R. Bey, R.H. Doersch, and J.H. Patterson, The net present value criterion: Its impact on project scheduling, Proj Manage Quart 12(2), 35-45 (1981).
2. S.M. Baroum and J.H. Patterson, The development of cash flow weight procedures for maximizing the net present value of a project, J Oper Manage 14, 209-227 (1996).
3. E.W. Davis and J.H. Patterson, A comparison of heuristic and optimum solutions in resource-constrained project scheduling, Manage Sci 21, 944-955 (1975).
4. H. Fisher and G.L. Thompson, "Probabilistic learning combinations of local job-shop scheduling rules," Industrial scheduling, Prentice-Hall, Englewood Cliffs, NJ, pp. 225-251, 1963.
5. M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, New York, 1979.
6. F. Glover, Tabu search - Part i, ORSA J Comput 1(3), 190-206 (1989).
7. F. Glover, Tabu search - Part ii, ORSA J Comput 2(3), 3-32 (1990).
8. F. Glover and M. Laguna, Tabu search, Kluwer Academic. Boston, MA, 1997.
9. B. Giffler, G.L. Thompson, and V. Van Ness, "Numerical experience with the linear and Monte Carlo algorithms for solving production scheduling problem," Industrial scheduling, Prentice-Hall. Englewood Cliffs, NJ, pp. 300-307, 1963.
10. O. Icmeli and S. Erenguc, A tabu search procedure for resource constrained project scheduling problems with discounted cash flows, Comput Oper Res 21, 841-853 (1994).
11. M. Laguna, J. Wesley-Barnes, and F. Glover, Tabu search methods for a single machine scheduling problem, J Intell Manuf 2, 63-74 (1991).
12. R. Padman and D.E. Smith-Daniels, Early-tardy cost tradeoffs in resource constrained projects with cash flows: An optimization-based approach, Eur J Oper Res 64, 295-311 (1993).
13. R. Padman, D.E. Smith-Daniels, and V.L. Smith-Daniels, Heuristic scheduling of resource-constrained projects with cash flows, Nav Res Logistics 44, 364-381 (1997).
14. J.H. Patterson, A comparison of exact approaches for solving the multiple constrained resource project scheduling problems, Manage Sci 30, 854-867 (1984).
15. R.A. Russell, A comparison of heuristics for scheduling projects with cash flows and resource restrictions, Manage Sci 32, 1291-1300 (1986).
16. D. Zhu, Intelligent decision support strategies for constrained project scheduling, Ph.D. Dissertation, The Heinz School, Carnegie Mellon University, Pittsburgh, PA 15213, 1995.
17. D. Zhu and R. Padman, A cooperative multi-agent approach for constrained project scheduling, Computer science and operations research: Recent advances in the interface, Kluwer Academic, Dordrecht, 367-381, 1996.
18. D. Zhu and R. Padman, Connectionist approaches for solver selection in constrained project scheduling, Ann Oper Res 72, 265-298 (1998).
19. D. Zhu and R. Padman, A heuristic combination model for the constrained project scheduling problem, draft working paper, The Heinz School, Carnegie Mellon University, Pittsburgh, PA 15213, 1999.