Abstract
Solver selection for many complex practical applications is a difficult problem due to the availability of a large number of heuristic procedures and the resulting heavy require-ments on the collection, storage and retrieval of information needed by the solvers. This paper presents the application of connectionist methods to aid the process of heuristic selection, control and management for the resource-constrained project scheduling problem with cash flows (RCPSPCF) which is a difficult combinatorial optimization problem. Many heuristic procedures have been developed for the RCPSPCF, with differing performance characteristics in different problem environments. This makes the task of choosing the most appropriate heuristic or heuristic category for a given instance of the problem a complex task. We apply neural networks to induce the relationship between project parameters and heuristic performance to guide the selection under different project environments. We also compare the results of the neural network approach with those from traditional statistical procedures. An innovative feature of our approach is the integration of statistical and opti-mization methods with neural networks to address data preprocessing, thereby improving the performance of the neural network. We demonstrate that neural network methodology can be employed both to extract information about project conditions as well as to provide predictions for novel cases. Extensive experimentation with network topologies and learn-ing parameters indicate that this approach has significant promise in identifying categories of heuristics that are appropriate for any instance of the problem, rather than selecting a single best heuristic.
Similar content being viewed by others
References
S. Ahmad and G. Tesauro, Scaling and generalization in neural networks: A case study, Connectionist Models Summer School, Carnegie Mellon University, 1988.
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, Indiana University, 1989.
R. Bey, R.H. Doersch and J.H. Patterson, The net present value criterion: Its impact on project scheduling, Project Management Quarterly 12(1981)35–45.
A. Brooke, D. Kendrick and A. Meeraus, GAMS, A User's Guide, The Scientific Press, CA, 1988.
E.W. Davis, Project scheduling under resource constraints — historical review and categorization of procedures, AIIE Transactions 5(1973)297–313.
E.W. Davis and J.H. Patterson, A comparison of heuristics and optimal solutions in resource-constrained project scheduling, Management Science 21(1975)944–955.
S.E. Fahlman, An empirical study of learning speed in cack-propagation networks, Technical Report CMU-CS-88-162, Carnegie Mellon University, 1988.
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, 1979.
K. Hornik, M. Stinchcombe and H. White, Multilayered feedforward neural networks are universal approximators, Neural Networks 2(1989)359–366.
R.A. Johnson and D.W. Wichern, Applied Multivariate Statistical Analysis, Prentice-Hall, NJ, 1988.
N. Kadaba, XROUTE: A knowledge-based routing system using neural networks and genetic algorithms, unpublished Ph.D. Thesis, North Dakota State University, 1990.
J.E. Kelley, Critical path planning and scheduling: Mathematical basis, Operations Research 9 (1961)296–320.
I.S. Kurtulus and E.W. Davis, Multi-project scheduling: Categorization of heuristic rules performance, Management Science 28(1982)161–172.
T. Kohonen, Self-Organization and Associative Memory, Springer, Berlin/Heidelberg/New York, 3rd ed., 1989.
J.L. McClelland and D.E. Rumelhart (eds.), Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Vols. 1 and 2, MIT Press, Cambridge, MA, 1986.
R. Mikkulainen and M. Dyer, Encoding input/output representations in connectionist cognitive systems, Connectionist Models Summer School, Carnegie Mellon University, 1988.
K.E. Nygard, P. Juell and N. Kadaba, Neural networks for selecting vehicle routing heuristics, ORSA Journal on Computing 2(1990)353–364.
E. Oja, A simplified neuron model as a principal component analyzer, Journal of Math. Biology 15(1982)267–273.
R. Padman, Choosing solvers in decision support systems: A neural network application in resource-constrained project scheduling, in: Recent Developments in Decision Support Systems, C. Holsapple and A.B. Whinston, eds., Springer, Berlin, 1993, pp. 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 64(1993)295–311.
R. Padman, D.E. Smith-Daniels and V.L. Smith-Daniels, Heuristic scheduling of resource-constrained projects with cash flows, forthcoming in Naval Research Logistics.
R. Padman and D. Zhu, On integrating knowledge source using problem spaces: An application in project scheduling, Working Paper 94-02, The Heinz School of Public Policy and Management, Carnegie Mellon University, Pittsburgh, PA 15213, 1994.
T.L. Pascoe, An experimental comparison of heuristic methods for sllocating resources, unpublished Ph.D. Thesis, Cambridge University, 1965.
J.H. Patterson, Project scheduling: The effects of problem structure on heuristic performance, Naval Research Logistics Quarterly 23(1976)95–122.
C.R. Rao, The use and interpretation of principal component analysis in applied research, Sankhya A26(1964)329–358.
A.H. Russell, Cash flows in networks, Management Science 16(1970)357–373.
R.A. Russell, A comparison of heuristics for scheduling projects with cash flows and resource restrictions, Management Science 32(1986)1291–1300.
A.W. Shogan, Management Science, Prentice Hall, Englewood Cliffs, NJ, 1988.
K.Y. Tam and M.Y. Kiang, Managerial applications of neural networks: The case of bank failure predictions, Management Science 38(1992)926–947.
E. Wacholder, J. Han and R.C. Mann, A neural network algorithm for the multiple traveling salesman problem, in: Proceedings of the IEEE Annual International Conference on Neural Networks, San Diego, 1988, pp. 305–324
H. White, Learning in artificial neural network: A statistical perspective, Neural Computation 1(1989)425–464.
D. Zhu and R. Padman, Neural networks for heuristic selection: An application in resource-constrained project scheduling — Extended Abstract, in: The Impact of Emerging Technologies on Computer Science and Operations Research, S.G. Nash and A. Sofer, eds., Kluwer Academic, 1995, pp. 297–312.
D. Zhu, Intelligent decision support strategies for constrained project scheduling, unpublished Doctoral Dissertation, The Heinz School of Public Policy and Management, Carnegie Mellon University, Pittsburgh, PA 15213, 1995.
D. Zhu, M. Prietula and W. Hsu, When processes learn: Steps toward crafting an intelligent organization, Working Paper, The University of Iowa, 1996, submitted to Information Systems Research.
D. Zhu and R. Padman, A cooperative multi-agent approach for constrained project scheduling, forthcoming in: Computer Science and Operations Research: Recent Advances in the Interface, Kluwer Academic, 1996.
Rights and permissions
About this article
Cite this article
Zhu, D., Padman, R. Connectionist approaches for solver selection in constrained project scheduling. Annals of Operations Research 72, 265–298 (1997). https://doi.org/10.1023/A:1018952406004
Issue Date:
DOI: https://doi.org/10.1023/A:1018952406004