Resource-constrained project scheduling with renewable and non-renewable resources and time-resource tradeoffs

Computers and Industrial Engineering

Volumn 32, Issue 1, 1997, Pages 227-242

  Nudtasomboon, Nudtapon ^a   Randhawa, Sabah U ^b  

^a Thailand Ministry of Industry   (Thailand)

^b OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; RESOURCE ALLOCATION;

GOAL PROGRAMMING MODEL; RESOURCE CONSTRAINT PROJECT SCHEDULING;

SCHEDULING;

EID: 0030830501     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0360-8352(96)00212-4     Document Type: Article

References (43)

1. H. Ahuja. Construction Performance Control by Networks. Wiley, New York (1976).
2. J. M. Antill and R. W. Woodhead. Critical Path Methods in Construction Practice. Wiley, New York (1970).
3. D. S. Barrie and B. Paulson. Professional Construction Management: Including C.M., Design Construction, and General Contracting. McGraw-Hill, New York (1992).
4. J. D. Brand, W. L. Meyer and L. R. Shaffer. The resource scheduling problem in construction. Civil Engineering Studies Report No. 5, Department of Civil Engineering, University of Illinois, Urbana (1964).
5. A. R. Burgess and J. B. Killebrew. Variation in activity level on a cyclic arrow diagram. J. Ind. Engng 13, 76-83 (1962).
6. E. W. Davis. An exact algorithm for the multiple constrained-resource project scheduling problem. Ph.D. dissertation, Department of Administrative Sciences, Yale University, New Haven, CT (1968).
7. E. W. Davis. Project scheduling under resource constraints - historical review and categorization of procedures. AIIE Trans. 5, 297-313 (1973).
8. E. W. Davis and G. E. Heidorn. An algorithm for optimal project scheduling under multiple resource constraints. Mgmt Sci. 17, B803-B816 (1971).
9. E. W. Davis and J. H. Patterson. A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Mgmt Sci. 21, 944-955 (1975).
10. S. M. Easa. Resource leveling in construction by optimization. J. Construction Engng Mgmt 115, 302-316 (1989).
11. S. E. Elmaghraby. The sequencing of N jobs on M parallel processors. Unpublished paper, North Carolina State University, Raleigh, NC (1967).
12. S. E. Elmaghraby. The sequencing of N jobs on M parallel processors with extensions to the scarce resources problem of activity networks. Proc. of the Inaugral Conf. of the Scientific Computation Center and Institute of Statistical Studies and Research, Cairo, Egypt, pp. 230-255 (1969).
13. S. E. Elmaghraby. Activity Networks: Project Planning and Control by Network Model. Wiley, New York (1977).
14. R. Galbreath. Computer program for leveling resource usage. J. Construction Div. ASCE 91, 107-124 (1965).
15. G. Hadley. Project planning and manpower scheduling. Nonlinear and Dynamic Programming (Sec. 8.8). Addison-Wesley, Reading, MA (1964).
16. J. R. Hall Jr. (Ed.). Management science update column: multiproject scheduling through zero-one programming. Mgmt Sci. 26, 228-229 (1980).
17. E. L. Hannan. The application of goal programming techniques to the CPM problem. Socio-Econ. Planning Sci. 12, 267-270 (1978).
18. R. B. Harris. Precedence and Arrow Networking Techniques for Construction. Wiley, New York (1978).
19. T. J. R. Johnson. An algorithm for the resource-constrained project scheduling problem. Unpublished Ph.D. dissertation, School of Management, Massachusetts Institute of Technology, Cambridge, MA (1967).
20. I. S. Kurtulus and S. C. Narula. Multi-project scheduling: analysis of project performance. LIE Trans. 17, 58-66 (1985).
21. S. M. Lee. Goal Programming Methods for Multiple Objective Integer Programs. Monograph, Operations Research Division, American Institute of Industrial Engineers (1979).
22. S. M. Lee, L. J. Moore and E. R. Clayton. Analysis of multi-objective project crashing models. Proc. 8th Annual Conf. American Institute for Decision Sciences, San Francisco, CA, 10-12 Nov., pp. 114-115 (1976).
23. S. M. Lee and D. L. Olson, A zero-one goal programming approach to multi-project scheduling. Project Mgmt J. 15, 61-71 (1984).
24. D. W. Mandeville. The development of network analysis resource balancing methods from assembly line balancing techniques. MS thesis, Purdue University, Lafayette, IN (1965).
25. R. P. Mohanty and M. K. Siddiq. Multiple projects-multiple resources-constrained scheduling: some studies. Int. J. Prod. Res. 27, 261-280 (1989).
26. C. L. Moodie and D. W. Mandeville. Project resource balancing by assembly line balancing techniques. J. Ind. Engng XVII, 377-383 (1966).
27. M. I. Norbis and J. M. Smith. A multiobjective, multi-level heuristic for dynamic resource constrained scheduling problems. Eur. J. Opl Res. 33, 30-41 (1988).
28. N. Nudtasomboon. A methodology for multi-objective, resource-constrained project scheduling problem. Ph.D. dissertation, Oregon State University, Corvallis, OR (1993).
29. J. H. Patterson. A comparison of exact approaches for solving the multi constrained resource, project scheduling problem. Mgmt Sci. 30, 854-867 (1984).
30. J. H. Patterson. Alternate methods of project scheduling with limited resources. Naval Res. Logistics Q. 20, 767-784 (1973).
31. J. H. Patterson and W. D. Huber. A horizon-varying, zero-one approach to project scheduling. Mgmt Sci. 20, 990-998 (1974).
32. J. H. Patterson and G. W. Roth. Scheduling a project under multiple resource constraints: a zero-one programming approach. AIIE Trans. 8, 449-455 (1976).
33. A. A. B. Pritsker, L. J. Watters and P. M. Wolfe. Multiproject scheduling with limited resources: a zero-one programming approach. Mgmt Sci. 16, 93-108 (1969).
34. L. Shaffer, J. Ritter and W. Mayer. The Critical Path Method. McGraw-Hill, New York (1965).
35. R. Slowinski. Multiobjective network scheduling with efficient use of renewable and non-renewable resources. Eur. J. Opl Res. 7, 265-273 (1981).
36. J. P. Stinson. A branch and bound algorithm for a general class of resource-constrained scheduling problems. Ph.D. dissertation, The University of North Carolina at Chapel Hill, Chapel Hill, NC (1976).
37. J. P. Stinson, E. W. Davis and B. M. Khumawala. Multiple resource-constrained scheduling using branch and bound. AIIE Trans. 10, 252-259 (1978).
38. F. B. Talbot. An integer programming algorithm for the resource-constrained project scheduling problem. Ph.D. dissertation, Pennsylvania State University, State College, PA (1976).
39. F. B. Talbot. Resource-constrained project scheduling with time-resource tradeoffs: the non-preemptive case. Mgmt Sci. 28, 1197-1210 (1982).
40. F. B. Talbot and J. H. Patterson. An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems. Mgmt Sci. 24, 1163-1174 (1978).
41. J. D. Wiest and F. K. Levy. A Management Guide to PERT/CPM. Prentice-Hall, Englewood Cliffs (1977).
42. C. D. Wieters. Allocation of resources among competing projects using CPM and integer goal programming. Proc. 11th Annual Meeting, American Institute for Decision Sciences, 19-21 November, New Orleans Hilton, New Orleans, LA, pp. 371-373 (1979).
43. B. M. Woodworth and C. J. Willie. A heuristic algorithm for resource leveling in multi-resource scheduling. Decis. Sci. 6, 525-540 (1975).