Resource Scheduling Using Neural Dynamics Model of Adeli and Park
Publication: Journal of Construction Engineering and Management
Volume 127, Issue 1
Abstract
This paper presents a mathematical model for resource scheduling considering project scheduling characteristics generally ignored in prior research, including precedence relationships, multiple crew-strategies, and time cost trade-off. Previous resource scheduling formulations have traditionally focused on project duration minimization. The proposed model considers the total project cost minimization. Furthermore, resource leveling and resource-constrained scheduling have traditionally been solved independently. In the new formulation, resource leveling and resource-constrained scheduling are performed simultaneously. The proposed model is solved using the patented neural dynamics model of Adeli and Park. A case study is presented to demonstrate the performance of the method under various resource availability profiles.
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Adeli, H., and Hung, S. L. ( 1995). Machine learning—Neural networks, genetic algorithms, and fuzzy systems, Wiley, New York.
2.
Adeli, H., and Karim, A. (1997). “Scheduling/cost optimization and neural dynamics model for construction projects.”J. Constr. Engrg. and Mgmt., ASCE, 123(4), 450–458.
3.
Adeli, H., and Park, H. S. ( 1995). “Optimization of space structures by neural dynamics.” Neural Networks, 8(2), 769–781.
4.
Adeli, H., and Park, H. S. ( 1996). “Hybrid CPN—Neural dynamics model for discrete optimization of steel structures.” Microcomp. in Civ. Engrg., 11(5), 355–366.
5.
Adeli, H., and Park, H. S. ( 1998). Neurocomputing for design automation, CRC, Boca Raton, Fla.
6.
Antill, J. M., and Woodhead, R. W. ( 1982). Critical path methods in construction practice, 3rd Ed., Wiley-Interscience, New York.
7.
Boctor, F. F. ( 1990). “Some efficient multi-heuristic procedures for resource-constrained project scheduling.” Eur. J. Operational Res., 9, 3–13.
8.
Chan, W. T., Chua, D. K. H., and Kannan, G. (1996). “Construction resource scheduling with genetic algorithms.”J. Constr. Engrg. and Mgmt., ASCE, 122(2), 125–132.
9.
Christofides, N., Alvarez-Valdes, R., and Tamarit, J. M. ( 1987). “Project scheduling with resource constraints: A branch and bound approach.” Comp. and Industrial Engrg., 12(1), 227–242.
10.
Davis, E. W. ( 1973). “Project scheduling under resource constraints—Historical review and categorization of procedures.” Am. Inst. of Industrial Engrs. Trans., 5, 297–313.
11.
Demeulemeester, E., and Herroelen, W. ( 1992). “A branch-and-bound procedure for the multiple resource-constrained project scheduling problem.” Mgmt. Sci., 38, 1803–1818.
12.
Demeulemeester, E., and Herroelen, W. ( 1997). “New benchmark results for the resource-constrained project scheduling problem.” Mgmt. Sci., 43, 1485–1492.
13.
Easa, S. M. (1989). “Resource leveling in construction by optimization.”J. Constr. Engrg. and Mgmt., ASCE, 115(2), 302–316.
14.
Harris, R. B. (1990). “Packing method for resource leveling (PACK).”J. Constr. Engrg. and Mgmt., ASCE, 116(2), 331–350.
15.
Karaa, F. A., and Nasr, A. Y. (1986). “Resource management in construction.”J. Constr. Engrg. and Mgmt., ASCE, 112(3), 346–357.
16.
Moder, J., Phillips, C., and Davis, E. ( 1983). Project management with CPM, PERT, and precedence diagramming, 3rd Ed., Van Nostrand Reinhold, New York.
17.
Nudtasomboon, N., and Randhawa, S. ( 1996). “Resource-constrained project scheduling with renewable and non-renewable resources and time-resources tradeoffs.” Comp. and Industrial Engrg., 32(1), 227–242.
18.
Padilla, E. M., and Carr, R. I. (1991). “Resource strategies for dynamic project management.”J. Constr. Engrg. and Mgmt., ASCE, 117(2), 279–293.
19.
Patterson, J. H., and Roth, G. W. ( 1976). “Scheduling a project under multiple resource constraints: A zero-one programming approach.” Am. Inst. of Industrial Engrs. Trans., 8, 449–455.
20.
Ramlogan, R. N., and Goulter, I. C. ( 1989). “Mixed integer model for resource allocation in project management.” J. Engrg. Optimization, U.K., 15, 97–111.
21.
Savian, D., Alkass, S., and Fazio, P. ( 1996). “Construction resource leveling using neural networks.” Can. J. Civ. Engrg., Ottawa, 23, 917–925.
22.
Savin, D., Alkass, S., and Fazio, P. (1998). “Calculating weight matrix of neural network for resource leveling.”J. Comp. in Civ. Engrg., ASCE, 12(4), 241–248.
23.
Seibert, J. E., and Evans, G. W. (1991). “Time-constrained resource leveling.”J. Constr. Engrg. and Mgmt., ASCE, 117(3), 503–520.
24.
Stinson, P., Davis, E. W., and Khumawala, B. M. ( 1978). “Multiple resource-constrained scheduling using branch and bound.” Am. Inst. of Industrial Engrs. Trans., 10, 252–259.
25.
Sung, C. S., and Lim, S. K. ( 1996). “A scheduling procedure for a general class of resource-constrained projects.” Comp. and Industrial Engrg., 12(1), 227–242.
26.
Talbot, F. B. ( 1982). “Resource-constrained project scheduling with time-resource tradeoffs: The non-preemptive case.” Mgmt. Sci., 28, 1197–1210.
27.
Talbot, F. B., and Patterson, J. H. ( 1978). “An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems.” Mgmt. Sci., 24, 1163–1174.
28.
Thesen, A. ( 1976). “Heuristic scheduling of activities under resource and precedence restrictions.” Mgmt. Sci., 23, 412–422.
29.
Ulsoy, G., and Zdamar, L. ( 1989). “Heuristic performance and network characteristics in resource-constrained project scheduling.” J. Operations Res. Soc., 40, 1145–1152.
30.
Wiest, J. D., and Levy, F. K. ( 1977). A management guide to PERT/CPM, Prentice-Hall, Englewood Cliffs, N.J.
Information & Authors
Information
Published In
Journal of Construction Engineering and Management
Volume 127 • Issue 1 • February 2001
Pages: 28 - 34
History
Received: Nov 2, 1999
Published online: Feb 1, 2001
Published in print: Feb 2001
Authors
Metrics & Citations
Metrics
Citations
Download citation
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.