Investigating the Effectiveness of Certain Priority Rules on Resource Scheduling of Housing Estate Projects
Publication: Journal of Construction Engineering and Management
Volume 135, Issue 7
Abstract
The heuristic method is one of the methods used for the scheduling of resource-constrained projects. This method is commonly used in programming the projects with high number of activities and resources such as construction investments. This paper investigates the effectiveness of three heuristic method priority rules applied in the resource scheduling of ten Turkish housing estate projects which were scheduled according to three preselected priority rules [maximum remaining path length (MRPL), latest finish time (LFT), and minimum slack time (MNSLCK)] in resource-constrained conditions. The performance of each priority rule was evaluated in relation to the duration of the project. The results revealed that MRPL priority reduced the project duration to minimum in six projects, whereas LFT priority yielded the best duration results in three projects and MNSLCK priority in only one project.
Get full access to this article
View all available purchase options and get full access to this article.
References
Abbasi, G. Y., and Arabiat, Y. A. (2001). “A heuristic to maximize the net present value for resource-constrained project scheduling problems.” Proj. Manage. J., 32(2), 17–24.
Ahuja, H. N. (1976). Construction performance control by network, Wiley, New York.
Bell, C. E., and Han, J. (1991). “A new heuristic solution method in resource-constrained project scheduling.” Naval Res. Logistics Quart., 38, 315–331.
Boctor, F. F. (1990). “Some efficient multi-heuristic procedures for resource-constrained project scheduling.” Eur. J. Oper. Res., 49(1), 3–13.
Brooks, G. H., and White, C. R. (1965). “An algorithm for finding optimal or near optimal solutions to the production scheduling problem.” J. Indust. Eng., 16(1), 34–40.
Davis, E. W., and Patterson, J. H. (1975). “A comparison of heuristic and optimum solution in rource-constrained project scheduling.” Manage. Sci., 21(8), 944–955.
Demeulemeester, E., and Herroelen, W. (1992). “A branch and bound procedure for the multiple resource-constrained project scheduling problems.” Manage. Sci., 38(12), 1790–1803.
Doersch, R. H., and Patterson, J. H. (1977). “Scheduling a project to maximize its present value: A zero-one programming approach.” Manage. Sci., 23, 882–889.
Hong, Z., Tam, C. M., and Shi, J. J. (2001). “Resource allocation heuristic in construction simulation.” Constr. Manage. Econom., 19(6), 643–651.
Turkish Ministry of Housing and Urban Development (HUD). (1988). Unit price analyses, Ankara, Turkey.
Kanit, R., and Ozkan, O. (2004a). “Priority rules performance in construction investment.” Project Rep. to Gazi Univ., Ankara, Turkey.
Kanit, R., Ozkan, O., and Erdal, M. (2004b). “Study performance of priority rules in programming of road projects with limited resources.” 2nd Int. Traffic and Road Safety Congress and Exhibition.
Klein, R. (2000). “Project scheduling with time-varying resource constraints.” Int. J. Prod. Res., 38(16), 3937–3952.
Kolish, R., and Hartman, S. (1998). “Heuristic algorithm for solving resource constrained project scheduling problem.” Technical Paper No. 469, Kiel Univ.
Ozdamar, L., and Ulusoy, G. (1994). “A local constraint based analysis approach to project scheduling under general resource constraints.” Eur. J. Oper. Res., 79, 287–298.
Ozdamar, L., and Ulusoy, G. (1996a). “An iterative local constraint based analysis for solving the resource constrained project scheduling problem.” J. Operations Manage., 14(3), 193–208.
Ozdamar, L., and Ulusoy, G. (1996b). “A note on iterative forward/backward scheduling technique with reference to a procedure by Li and Willis.” Eur. J. Oper. Res., 89, 400–407.
Padman, R., and Smith-Daniels, D. E. (1993). “Early-tardy cost trade-offs in resource constrained projects with cash flows: An optimization-guided heuristic approach.” Eur. J. Oper. Res., 64, 295–311.
Patterson, J. H., Slowinski, R., Talbot, F. B., and Weglarz, J. (1990). “Computational experience with a backtracking algorithm for solving a general class of precedence and resource constrained scheduling problems.” Eur. J. Oper. Res., 49, 68–79.
Russell, R. A. (1986). “A comparison of heuristics for scheduling projects with cash flows and resource restrictions.” Manage. Sci., 32, 1291–1300.
Schirmer, A. (1999). “Resource constrained project scheduling: An evaluation of adaptive control schemes for parameterized sampling heuristic.” Int. J. Operat. Product. Manage., 39(7), 1343–1365.
Slowinski, R. (1980). “Two approaches to problems of resource allocation among project activities—A comparative study.” J. Oper. Res. Soc., 31, 711–723.
Talbot, F. B. (1982). “Resource constrained project scheduling with time-resource tradeoffs: The non-preemptive case.” Manage. Sci., 8, 1197–1210.
Ulusoy, G., and Ozdamar, L. (1989). “Heuristic performance and network resource characteristics in resource constrained project scheduling.” J. Oper. Res. Soc., 40(12), 1145–1152.
Ulusoy, G., and Ozdamar, L. (1995). “A heuristic scheduling algorithm for improving the duration and net present value of a project.” Int. J. Operat. Product. Manage., 15(1), 89–98.
Wiest, J. D. (1967). “Heuristic model for scheduling large projects with limited resources.” Manage. Sci., 13(6), 359–377.
Yang, K. K., Talbot, F. B., and Patterson, J. H. (1993). “Scheduling a project to maximize its net present value: An integer programming approach.” Eur. J. Oper. Res., 64, 188–198.
Information & Authors
Information
Published In
Journal of Construction Engineering and Management
Volume 135 • Issue 7 • July 2009
Pages: 609 - 613
Copyright
© 2009 ASCE.
History
Received: Mar 18, 2008
Accepted: Nov 18, 2008
Published online: Mar 27, 2009
Published in print: Jul 2009
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.