Technical Papers
Jan 31, 2019

Resource Leveling in Projects with Stochastic Minimum Time Lags

Publication: Journal of Construction Engineering and Management
Volume 145, Issue 4

Abstract

In project management, resources and time are two critical aspects influencing the success of a project. On the one hand, resource leveling, an effective resource optimization technique, is widely adopted to guarantee the efficient use of resources. On the other hand, to deliver a project as soon as possible, it can typically be accelerated by overlapping some activities. In a real-life project environment, uncertainty is inevitable and further complicates resource leveling and activity overlapping. However, existing research tends to study resource leveling and activity overlapping separately and little attention has been paid to level resource usage with uncertain activity overlapping. Therefore, the authors model activity overlaps as minimum time lags and study the resource leveling problem with stochastic minimum time lags (RLP-SMTL), where both the time lags and the activity durations are uncertain. This study aims to obtain a scheduling strategy such that the usage of renewable resources is as smooth as possible over time. The tuple represented by a random key vector, a strategy dynamically schedules activities at each decision point. A simulation-based solution framework for the RLP-SMTL is proposed. Built upon the proposed solution framework, two metaheuristics, an evolutionary algorithm (EA) and a bat algorithm (BA), are designed. Based on 1,080 randomly generated 100-activity instances, extensive computational experiments are performed to evaluate the effectiveness of the proposed algorithms. The results reveal that the EA outperforms the BA in terms of both the objective function’s value and the timely project completion probability. Although the strategies generated by the BA are slightly weaker than the EA, the BA is much faster than the EA. The results obtained by an additional comparison experiment further show that the proposed algorithms outperform the existing best-performing metaheuristic. Additionally, an example project is adopted to illustrate how the proposed approach can be applied to practical resource leveling in construction projects. In conclusion, this paper contributes to the body of knowledge in construction engineering and management by developing effective metaheuristics that equip the project manager with an automated tool to make effective resource leveling decisions under uncertainties.

Get full access to this article

View all available purchase options and get full access to this article.

Data Availability Statement

Data generated or analyzed during the study are available from the corresponding author by request. Information about the Journal’s data-sharing policy can be found here: http://ascelibrary.org/doi/10.1061/(ASCE)CO.1943-7862.0001263.

Acknowledgments

The authors thank the editors and reviewers for their helpful and constructive suggestions that have significantly enhanced the quality of this paper. This research was supported by the National Science Foundation of China (Grant Nos. 71602106 and 71702097) and the Humanities and Social Sciences Foundation of the Ministry of Education of China (Grant No. 15YJCZH077).

References

Abuwarda, Z., and T. Hegazy. 2016. “Flexible activity relations to support optimum schedule acceleration.” J. Constr. Eng. Manage. 142 (11): 06016004. https://doi.org/10.1061/(ASCE)CO.1943-7862.0001193.
Alsayegh, H., and M. Hariga. 2012. “Hybrid meta-heuristic methods for the multi-resource leveling problem with activity splitting.” Autom. Constr. 27: 89–98. https://doi.org/10.1016/j.autcon.2012.04.017.
Ashuri, B., and M. Tavakolan. 2012. “Fuzzy enabled hybrid genetic algorithm-particle swarm optimization approach to solve TCRO problems in construction project planning.” J. Constr. Eng. Manage. 138 (9): 1065–1074. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000513.
Back, T. 1996. Evolutionary algorithms in theory and practice: Evolution strategies, evolutionary programming, genetic algorithms. Oxford: Oxford University Press.
Ballestin, F., and R. Leus. 2009. “Resource-constrained project scheduling for timely project completion with stochastic activity durations.” Prod. Oper. Manage. 18 (4): 459–474. https://doi.org/10.1111/j.1937-5956.2009.01023.x.
Ballestín, F. 2007. “When it is worthwhile to work with the stochastic RCPSP?” J. Scheduling 10 (3): 153–166. https://doi.org/10.1007/s10951-007-0012-1.
Ballestín, F., C. Schwindt, and J. Zimmermann. 2007. “Resource leveling in make-to-order production: Modeling and heuristic solution method.” Int. J. Oper. Res. 4 (1): 50–62.
Bogus, S. M., J. E. Diekmann, K. R. Molenaar, C. Harper, S. Patil, and J. S. Lee. 2011. “Simulation of overlapping design activities in concurrent engineering.” J. Constr. Eng. Manage. 137 (11): 950–957. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000363.
Burgess, A. R., and J. B. Killebrew. 1962. “Variation in activity level on a cyclical arrow diagram.” J. Ind. Eng. 13 (2): 76–83.
Chan, W. T., D. K. Chua, and G. Kannan. 1996. “Construction resource scheduling with genetic algorithms.” J. Constr. Eng. Manage. 122 (2): 125–132. https://doi.org/10.1061/(ASCE)0733-9364(1996)122:2(125).
Chansombat, S., P. Musikapun, P. Pongcharoen, and C. Hicks. 2018. “A hybrid discrete bat algorithm with krill herd-based advanced planning and scheduling tool for the capital goods industry.” Int. J. Prod. Res. 1–22. https://doi.org/10.1080/00207543.2018.1471240.
Coughlan, E. T., M. E. Lübbecke, and J. Schulz. 2015. “A branch-price-and-cut algorithm for multi-mode resource leveling.” Eur. J. Oper. Res. 245 (1): 70–80. https://doi.org/10.1016/j.ejor.2015.02.043.
Deblaere, F., E. Demeulemeester, and W. Herroelen. 2011. “Proactive policies for the stochastic resource-constrained project scheduling problem.” Eur. J. Oper. Res. 214 (2): 308–316. https://doi.org/10.1016/j.ejor.2011.04.019.
Dehghan, R., and J. Y. Ruwnapura. 2013. “Model of trade-off between overlapping and rework of design activities.” J. Constr. Eng. Manage. 140 (2): 04013043. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000786.
Demeulemeester, E., and W. Herroelen. 2002. Project scheduling: A research handbook. New York: Kluwer Academic Publication.
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.
El-Rayes, K., and D. H. Jun. 2009. “Optimizing resource leveling in construction projects.” J. Constr. Eng. Manage. 135 (11): 1172–1180. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000097.
Francis, A. 2016. “Simulating uncertainties in construction projects with chronographical scheduling logic.” J. Constr. Eng. Manage. 143 (1): 04016085. https://doi.org/10.1061/(ASCE)CO.1943-7862.0001212.
Gather, T., J. Zimmermann, and J. H. Bartels. 2011. “Exact methods for the resource levelling problem.” J. Scheduling 14 (6): 557–569. https://doi.org/10.1007/s10951-010-0207-8.
Gwak, H. S., S. H. Son, Y. J. Park, and D. E. Lee. 2016. “Exact time-cost tradeoff analysis in concurrency-based scheduling.” J. Constr. Eng. Manage. 142 (10): 04016054. https://doi.org/10.1061/(ASCE)CO.1943-7862.0001164.
Hariga, M., and S. M. El-Sayegh. 2011. “Cost optimization model for the multiresource leveling problem with allowed activity splitting.” J. Constr. Eng. Manage. 137 (1): 56–64. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000251.
Hartmann, S., and D. Briskorn. 2010. “A survey of variants and extensions of the resource-constrained project scheduling problem.” Eur. J. Oper. Res. 207 (1): 1–14. https://doi.org/10.1016/j.ejor.2009.11.005.
Hegazy, T. 1999. “Optimization of resource allocation and leveling using genetic algorithms.” J. Constr. Eng. Manage. 125 (3): 167–175. https://doi.org/10.1061/(ASCE)0733-9364(1999)125:3(167).
Jun, D., and K. El-Rayes. 2011. “Multiobjective optimization of resource leveling and allocation during construction scheduling.” J. Constr. Eng. Manage. 137 (12): 1080–1088. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000368.
Kolisch, R., and S. Hartmann. 1999. “Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis.” In Project scheduling, 147–178. Boston: Springer.
Labuschagne, C., and A. C. Brent. 2005. “Sustainable project life cycle management: The need to integrate life cycles in the manufacturing sector.” Int. J. Project Manage. 23 (2): 159–168. https://doi.org/1016/j.ijproman.2004.06.003.
Leu, S. S., A. T. Chen, and C. H. Yang. 1999. “A fuzzy optimal model for construction resource leveling scheduling.” Can. J. Civ. Eng. 26 (6): 673–684. https://doi.org/10.1139/l99-028.
Leu, S. S., and T. H. Hung. 2002. “An optimal construction resource leveling scheduling simulation model.” Can. J. Civ. Eng. 29 (2): 267–275. https://doi.org/10.1139/l02-007.
Leu, S. S., C. H. Yang, and J. C. Huang. 2000. “Resource leveling in construction by genetic algorithm-based optimization and its decision support system application.” Autom. Constr. 10 (1): 27–41. https://doi.org/10.1016/S0926-5805(99)00011-4.
Li, H., and E. Demeulemeester. 2016. “A genetic algorithm for the robust resource leveling problem.” J. Scheduling 19 (1): 43–60. https://doi.org/10.1007/s10951-015-0457-6.
Li, H., and X. Dong. 2018. “Multi-mode resource leveling in projects with mode-dependent generalized precedence relations.” Expert Syst. Appl. 97: 193–204. https://doi.org/10.1016/j.eswa.2017.12.030.
Li, H., L. Xiong, Y. Liu, and H. Li. 2018a. “An effective genetic algorithm for the resource levelling problem with generalised precedence relations.” Int. J. Prod. Res. 56 (5): 2054–2075. https://doi.org/10.1080/00207543.2017.1355120.
Li, H., Z. Xu, and E. Demeulemeester. 2015. “Scheduling policies for the stochastic resource leveling problem.” J. Constr. Eng. Manage. 141 (2): 04014072. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000936.
Li, H., Z. Xu, and W. Wei. 2018b. “Bi-objective scheduling optimization for discrete time/cost trade-off in projects.” Sustainability 10 (8): 2802. https://doi.org/10.3390/su10082802.
Liu, J., and M. Lu. 2018. “Constraint programming approach to optimizing project schedules under material logistics and crew availability constraints.” J. Constr. Eng. Manage. 144 (7): 04018049. https://doi.org/10.1061/(ASCE)CO.1943-7862.0001507.
Malcolm, D. G., J. H. Roseboom, C. E. Clark, and W. Fazar. 1959. “Application of a technique for research and development program evaluation.” Oper. Res. 7 (5): 646–669. https://doi.org/10.1287/opre.7.5.646.
Neumann, K., C. Schwindt, and J. Zimmermann. 2003. Project scheduling with time windows and scarce resources: Temporal and resource-constrained project scheduling with regular and nonregular objective functions. New York: Springer.
Neumann, K., and J. Zimmermann. 1999. “Resource levelling for projects with schedule-dependent time windows.” Eur. J. Oper. Res. 117 (3): 591–605. https://doi.org/10.1016/S0377-2217(98)00272-0.
Neumann, K., and J. Zimmermann. 2000. “Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints.” Eur. J. Oper. Res. 127 (2): 425–443. https://doi.org/10.1016/S0377-2217(99)00498-1.
Pena-Mora, F., and M. Li. 2001. “Dynamic planning and control methodology for design/build fast-track construction projects.” J. Constr. Eng. Manage. 127 (1): 1–17. https://doi.org/10.1061/(ASCE)0733-9364(2001)127:1(1).
Ponz-Tienda, J. L., A. Salcedo-Bernal, and E. Pellicer. 2017a. “A parallel branch and bound algorithm for the resource leveling problem with minimal lags.” Comput.-Aided Civ. Infrastruct. Eng. 32 (6): 474–498. https://doi.org/10.1111/mice.12233.
Ponz-Tienda, J. L., A. Salcedo-Bernal, E. Pellicer, and J. Benlloch-Marco. 2017b. “Improved adaptive harmony search algorithm for the resource leveling problem with minimal lags.” Autom. Constr. 77: 82–92. https://doi.org/10.1016/j.autcon.2017.01.018.
Ponz-Tienda, J. L., V. Yepes, E. Pellicer, and J. Moreno-Flores. 2013. “The resource leveling problem with multiple resources using an adaptive genetic algorithm.” Autom. Constr. 29: 161–172. https://doi.org/10.1016/j.autcon.2012.10.003.
Rieck, J., J. Zimmermann, and T. Gather. 2012. “Mixed-integer linear programming for resource leveling problems.” Eur. J. Oper. Res. 221 (1): 27–37. https://doi.org/10.1016/j.ejor.2012.03.003.
Stork, F. 2001. “Stochastic resource-constrained project scheduling.” Ph.D. dissertation, Dept. of Mathematics, Technical Univ. of Berlin.
Tosun, Ö., and M. K. Marichelvam. 2016. “Hybrid bat algorithm for flow shop scheduling problems.” Int. J. Math. Oper. Res. 9 (1): 125–138. https://doi.org/10.1504/IJMOR.2016.077560.
Van de Vonder, S., F. Ballestin, E. Demeulemeester, and W. Herroelen. 2007a. “Heuristic procedures for reactive project scheduling.” Comput. Ind. Eng. 52 (1): 11–28. https://doi.org/10.1016/j.cie.2006.10.002.
Van de Vonder, S., E. Demeulemeester, and W. Herroelen. 2007b. “A classification of predictive-reactive project scheduling procedures.” J. Scheduling 10 (3): 195–207. https://doi.org/10.1007/s10951-007-0011-2.
Van de Vonder, S., E. Demeulemeester, and W. Herroelen. 2008. “Proactive heuristic procedures for robust project scheduling: An experimental analysis.” Eur. J. Oper. Res. 189 (3): 723–733. https://doi.org/10.1016/j.ejor.2006.10.061.
Yang, X. S. 2010. “A new metaheuristic bat-inspired algorithm.” In Nature inspired cooperative strategies for optimization, 65–74. Berlin: Springer.
Yang, X. S. 2013. “Bat algorithm and cuckoo search: A tutorial.” In Artificial intelligence, evolutionary computing and metaheuristics, 421–434. Berlin: Springer.
Zahraie, B., and M. Tavakolan. 2009. “Stochastic time-cost-resource utilization optimization using nondominated sorting genetic algorithm and discrete fuzzy sets.” J. Constr. Eng. Manage. 135 (11): 1162–1171. https://doi.org/10.1061/(ASCE)CO.1943-7862.0000092.

Information & Authors

Information

Published In

Go to Journal of Construction Engineering and Management
Journal of Construction Engineering and Management
Volume 145Issue 4April 2019

History

Received: May 11, 2018
Accepted: Sep 28, 2018
Published online: Jan 31, 2019
Published in print: Apr 1, 2019
Discussion open until: Jun 30, 2019

Permissions

Request permissions for this article.

Authors

Affiliations

Hongbo Li, Ph.D. [email protected]
Associate Professor, School of Management, Shanghai Univ., Shanghai 200444, China. Email: [email protected]; [email protected]
Ph.D. Student, School of Information Management and Engineering, Shanghai Univ. of Finance and Economics, Shanghai 200433, China; Deputy Director, Office of Academic Affairs, Shanghai Lixin Univ. of Accounting and Finance, Shanghai 201209, China. Email: [email protected]
Xuebing Dong, Ph.D. [email protected]
Assistant Professor, School of Management, Shanghai Univ., Shanghai 200444, China (corresponding author). Email: [email protected]

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.

Cited by

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share