Performance of Resource-Constrained Scheduling Heuristics
Publication: Journal of Construction Engineering and Management
Volume 146, Issue 4
Abstract
Over the years, the study of resource-constrained scheduling heuristics has focused on testing different sets of priority rules without paying attention to the conditions under which each heuristic produces better results. Although some authors have recommended the use of specific heuristics over any other rule, these recommendations are general and do not encompass all possible project characteristics in terms of resources and network topology. Without a guidance system, schedulers must try several combinations of rules until they find one that compares favorably (shortest duration) with the results of the other priority rules. This study proposes a new tiebreaker (priority number) that enhances the performance of an existing heuristic and classifies the heuristics’ performance based on specific project characteristics. The results show that, as a tiebreaker of the late finish rule, the priority number leads to obtain schedules with lower deviations from the critical path method (CPM) duration and a higher number of shortest schedules than with traditional tiebreakers. The proposed classification system indicates the two heuristics with the best performance for specific resource network characteristics. This classification will help practitioners to decide which heuristic applies when mitigating the resource supply–demand problem given the project characteristics.
Get full access to this article
View all available purchase options and get full access to this article.
Data Availability Statement
Data generated by the authors have been published by Franco-Duran (2019).
References
Abeyasinghe, M. C. L., D. J. Greenwood, and D. E. Johansen. 2001. “An efficient method for scheduling construction projects with resource constraints.” Int. J. Project Manage. 19 (1): 29–45. https://doi.org/10.1016/S0263-7863(00)00024-7.
Alvarez-Valdes, R., and J. M. Tamarit. 1989. “Algoritmos heuristicos deterministas y aleatorios en secuenciacion de proyectos con recursos limitados.” Questiio 13 (1–3): 173–191.
Boctor, F. F. 1993. “Heuristics for scheduling projects with resource restrictions and several resource-duration modes.” Int. J. Prod. Res. 31 (11): 2547–2558. https://doi.org/10.1080/00207549308956882.
Boctor, F. F. 1996. “A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes.” Eur. J. Oper. Res. 90 (2): 349–361. https://doi.org/10.1016/0377-2217(95)00359-2.
Chen, Z., E. Demeulemeester, S. Bai, and Y. Guo. 2018. “Efficient priority rules for the stochastic resource-constrained project scheduling problem.” Eur. J. Oper. Res. 270 (3): 957–967. https://doi.org/10.1016/j.ejor.2018.04.025.
Davis, E. W., and J. H. Patterson. 1975. “A comparison of heuristic and optimum solutions in resource-constrained project scheduling.” Manage. Sci. 21 (8): 944–955. https://doi.org/10.1287/mnsc.21.8.944.
Demeulemeester, E., M. Vanhoucke, and W. Herroelen. 2003. “RanGen: A random network generator for activity-on-the-node networks.” J. Scheduling 6 (1): 17–38. https://doi.org/10.1023/A:1022283403119.
Elliott, A. C., and W. A. Woodward. 2007. Statistical analysis quick reference guidebook: With SPSS examples. Thousand Oaks, CA: Sage.
Franco Duran, D. 2019. Primavera P6 schedules. Blacksburg, VA: Univ. Libraries, Virginia Tech.
Gordon, J. H. 1983. “Heuristic methods in resource allocation.” Int. J. Project Manage. 1 (3): 163–168. https://doi.org/10.1016/0263-7863(83)90022-4.
Kannimuthu, M., P. Ekambaram, B. Raphael, and A. Kuppuswamy. 2018. “Resource unconstrained and constrained project scheduling problems and practices in a multiproject environment.” Adv. Civ. Eng. 2018: 13. https://doi.org/10.1155/2018/9579273.
Kastor, A., and K. Sirakoulis. 2009. “The effectiveness of resource leveling tools for resource constraint project scheduling problem.” Int. J. Project Manage. 27 (5): 493–500. https://doi.org/10.1016/j.ijproman.2008.08.006.
Kolisch, R. 1995. Project scheduling under resource constraints: Efficient heuristics for several problem classes. Heidelberg, Germany: Physica-Verlag.
Kolisch, R. 1996. “Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation.” Eur. J. Oper. Res. 90 (2): 320–333. https://doi.org/10.1016/0377-2217(95)00357-6.
Moder, J. J., C. R. Phillips, and E. W. Davis. 1983. Project management with CPM, PERT, and precedence diagramming. 3rd ed. New York: Van Nostrand Reinhold.
Patterson, J. H. 1973. “Alternate methods of project scheduling with limited resources.” Nav. Res. Logist. Q. 20 (4): 767–784. https://doi.org/10.1002/nav.3800200415.
Patterson, J. H. 1976. “Project scheduling: The effects of problem structure on heuristic performance.” Nav. Res. Logist. Q. 23 (1): 95–123. https://doi.org/10.1002/nav.3800230110.
Ulusoy, G., and L. Ozdamar. 2017. “Heuristic performance and network/resource characteristics in resource-constrained project scheduling.” J. Oper. Res. Soc. 40 (12): 1145–1152. https://doi.org/10.1057/jors.1989.196.
Zhan, J. 1994. “Heuristics for scheduling resource-constrained projects in MPM networks.” Eur. J. Oper. Res. 76 (1): 192–205. https://doi.org/10.1016/0377-2217(94)90016-7.
Information & Authors
Information
Published In
Copyright
©2020 American Society of Civil Engineers.
History
Received: Apr 24, 2019
Accepted: Sep 25, 2019
Published online: Feb 12, 2020
Published in print: Apr 1, 2020
Discussion open until: Jul 12, 2020
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.