Network resource allocation with support of a fuzzy expert system

Journal of Construction Engineering and Management

Volumn 116, Issue 2, 1990, Pages 239-260

  Chang, T C ^a   William, C ^a   Crandall, Keith C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; DATA PROCESSING - CRITICAL PATH ANALYSIS; EXPERT SYSTEMS; MANAGEMENT - RESEARCH AND DEVELOPMENT APPLICATION;

FUZZY EXPERT SYSTEMS; HEURISTIC APPROACHES; NETWORK RESOURCE ALLOCATION; PRACTICAL ALGORITHMS;

ENGINEERING;

EID: 0025448002     PISSN: 07339364     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)0733-9364(1990)116:2(239)     Document Type: Article

References (31)

1. Agin, N. (1966). “Optimum seeking with branch and bound.” Mgmt. Sci., 4(13), 176–185.
2. Chang, T. C. (1987). “Network resource allocation using an expert system with fuzzy logic reasoning,” thesis presented to the University of California, at Berkeley, Calif., in partial fulfillment of the requirements for the degree of Doctor of Philosophy.
3. Chang, T. C., and Crandall, K. C. (1990). “An algorithm for solving expected possibility and its application in construction resource allocation.” Fuzzy Sets and Systems.
4. Chang, T. C., and Ibbs, C. W. (1989). “Priority ranking—A fuzzy expert system for priority decision making in building construction resource scheduling.” Build. Envir.
5. Chang, T. C., Ibbs, C. W., and Crandall, K. C. (1989). “A fuzzy logic system for expert systems.” Artif. Intell. for Engrg. Design, Anal, and Manufacturing (AI EDAM), 2(3), 83–193.
6. Crandall, K. C. (1985),. “Resource allocation with project manager control.” Construction research applied to practice, C. W. Ibbs, ed., ASCE, 1–17.
7. Davis, E. W. (1973). “Project scheduling under resource constraints: Historical review and categorization of procedures.” AIIE Trans., 5(4), 297–313.
8. Davis, E. W. (1974). “Networks: Resource allocation.” J. Ind. Engrg., 6(4), 117–120.
9. Davis, E. W. (1975). “Project network summary measures and constrained resource scheduling.” AIIE Trans., 7(2), 132–142.
10. Davis, E. W., and Heidom, G. E. (1971). “An algorithm for optimal project scheduling under multiple resource constraints.” Mgmt. Sci., 17(12), 803–816.
11. Davis, E. W., and Patterson, J. H. (1975a). “A comparison of heuristic and optimum solutions in resource-constrained project scheduling.” Mgmt. Sci., 21(8), 944–955.
12. Davis, E. W., and Patterson, J. H. (1975b). “Resource-based project scheduling: Which rules perform best?” Project Mgmt. Q., 6(4), 25–31.
13. Dubios, D., and Prade, H. (1988). Possibility theory—Approach to computerized processing of uncertainty. Plenum Press, New York, N.Y.
14. Fendley, L. G. (1968). “Toward the development of a complete multi-project scheduling system.” Ind. Engrg., Oct.
15. Johnson, T. J. R. (1967). “An algorithm for the resource constrained project scheduling problem,” thesis presented to the Massachusetts Institute of Technology, at Cambridge, Mass., in partial fulfillment of the requirements for the degree of Doctor of Philosophy.
16. Patton, G. T. (1968). “Optimal scheduling of resource constrained projects,” thesis presented to Stanford University, at Stanford, Calif., in partial fulfillment of the requirements for the degree of Doctor of Philosophy.
17. Schrage, L. (1970). “Solving resource-constrained network problems by impact enumeration-non-preemptive case.” Oper. Res., 18(2), 263–278.
18. Stinson, J. P. (1976). “A branch and bound algorithm for a general class of multiple resource-constrained scheduling problems,” thesis presented to the University of North Carolina, in partial fulfillment of the requirements for the degree of Doctor of Philosophy.
19. Stinson, J. P., Davis, E. W., and Khumawala, B. M. (1978). “Multiple resource-constrained scheduling using branch and bound.” AIIE Trans., 10(3), 252–259.
20. Talbot, F. B. (1980). “Project scheduling with resource-duration interactions: The nonpreemptive case.” Working Paper No. 200, Grad. School of Business Administration, Univ. of Michigan, Ann Arbor, Mich.
21. 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(11), 1163–1174.
22. Talbot, F. B., and Patterson, J. H. (1979). “Optimal methods for scheduling project under resource constraints.” Project Mgmt. Q., 10(4), 26–33.
23. Thesen, A. (1978). “Heuristic project scheduling.” Project Mgmt. Q., 9(1), 23–29.
24. Weist, J. D. (1967). “A heuristic model for scheduling large projects with limited resources.” Mgmt. Sci., 13(6), 337–359.
25. Woodgate, H. S. (1968). “Planning networks and resource allocation.” DATAMATION, Jan., 36–43.
26. Woodworth, B. M., and Willie, C. J. (1975). “A heuristic algorithm for resource levelling in multi-project, multi-resource scheduling.” Decision Sci., 6(3), 525–540.
27. Woodworth, B. M., and Willie, C. J. (1976). “A time constrained approach to resource levelling in multi-project scheduling.” Project Mgmt. Q., 7(2), 26–33.
28. Zadeh, L. A. (1965). “Fuzzy sets.” Inf. Control, 8(3), 338–353.
29. Zadeh, L. A. (1975). “Fuzzy logic and approximate reasoning.” Synthese, 30(3/4), 407–428.
30. Zadeh, L. A. (1981). “Possibility theory and soft data analysis.” Mathematical frontiers of the social and policy sciences, L. Cobb and R. M. Thrall, eds., Westview Press, Inc., Boulder, Colo., 69–129.
31. Zadeh, L. A. (1983). “The role of fuzzy logic in the management of uncertainty in expert systems.” Fuzzy Sets and Systems, 11(3), 199–227.