Abstract
The resource-constrained project scheduling problem (RCPSP) with cash flows investigates the scheduling of activities that are linked by precedence constraints and multiple resource restrictions. Given the presence of cash flows which represent expenses for initiating activities and payments for completed work, maximizing the Net Present Value of the project is a practical problem. This is a complex combinatorial optimization problem which precludes the development of optimal schedules for large projects. Many heuristics exist for the RCPSP, but it has proven difficult to decide in advance which heuristic will provide the best result, given a problem characterization in terms of parameters such as size and complexity. In this paper we discuss the use of genetic programming (GP) for heuristic selection, and compare it directly to alternative methods such as OLS regression and neural networks. The study indicates that the GP approach yields results which are an improvement on earlier methods. The GP solution also gives valuable information about project environments where a given heuristic is inappropriate. In addition, this approach has no problem evolving complex nonlinear functions to capture the relationship between problem parameters and heuristic performance. Thus the results given in this paper shed light on the logical domains of applicability of the various heuristics, while at the same time provide an improved heuristic selection process.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Baroum and J.H. Patterson, “A Heuristic Algorithm for Maximizing the Net Present Value of Cash Flows in Resource Constrained Project Schedule,” Working Paper, 1989, Indiana University.
R. Bey, R.H. Doersch and J.H. Patterson, “The Net Present Value Criterion: Its Impact on Project Scheduling,” Project Management Quarterly, 1981, Vol. 12, No. 2, p. 35–45.
E.W. Davis, “Project Scheduling under Resource Constraints — Historical Review and Categorization of Procedures,” AIIE Transactions, 1973, Vol. 5, No. 4, p. 297–313.
E.W. Davis and J.H. Patterson, “A Comparison of Heuristics and Optimal Solutions in Resource-Constrained Project Scheduling,” Management Science, 1975, Vol. 21, No. 8, p. 944–955.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979, W.H. Freeman and Co., New York.
J.R. Koza, Genetic Programming: On the Programming of Computers by Natural Selection, 1992, The MIT Press, Cambridge, MA.
I.S. Kurtulus and E.W. Davis, “Multi-Project Scheduling: Categorization of Heuristic Rules Performance,” Management Science, 1982, Vol. 28, No. 2, p. 161–172.
R. Padman, “Choosing Solvers in Decision Support Systems: A Neural Network Application in Resource-Constrained Project Scheduling,” Recent Developments in Decision Support Systems, 1993, Springer-Verlag, Berlin, p. 559–574.
R. Padman and D. Smith-Daniels, “Early-Tardy Cost Trade-offs in Resource-Constrained Projects with Cash Flows: An Optimization-Guided Heuristic Approach,” European Journal of Operational Research, 1993, Vol. 64, p. 295–311.
R. Padman, D.E. Smith-Daniels and V. L. Smith-Daniels, “Heuristic Scheduling of Resource-Constrained Projects with Cash Flows: An Optimization-Based Approach,” forthcoming in Naval Research Logistics Quarterly.
R. Padman and D. Zhu, “On Integrating Knowledge Source Using Problem Spaces: An Application in Project Scheduling,” forthcoming in Annals of OR.
J.H. Patterson, “Project Scheduling: The Effects of Problem Structure On Heuristic Performance,” Naval Research Logistics Quarterly, 1976, Vol. 23, No. 1, p. 95–122.
R.A. Russell, “A Comparison of Heuristics for Scheduling Projects with Cash Flows and Resource Restrictions,” Management Science, 1986, Vol. 32, No. 10, p. 1291–1300.
K.K. Yang, B. Talbot and J.H. Patterson, “Scheduling a Project to Maximize its Net Present Value: An Integer Programming Approach,” Proceedings of the Second International Workshop on Project Management and Scheduling, 1990, Compiegne, France, p. 384–397.
D. Zhu and R. Padman, “Neural Networks for Heuristic Selection: An Application in Resource-Constrained Project Scheduling” in Stephen Nash and Ariela Sofer (eds.), The Impact of Emerging Technologies on Computer Science and Operations Research, 1995, Klewer Academic Publishers, Boston.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Padman, R., Roehrig, S.F. (1997). A Genetic Programming Approach for Heuristic Selection in Constrained Project Scheduling. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds) Interfaces in Computer Science and Operations Research. Operations Research/Computer Science Interfaces Series, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4102-8_18
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4102-8_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6837-3
Online ISBN: 978-1-4615-4102-8
eBook Packages: Springer Book Archive