Resource Supply-Demand Matching Scheduling Approach for Construction Workface Planning
Publication: Journal of Construction Engineering and Management
Volume 142, Issue 1
Abstract
This paper discusses a novel approach for resource-based scheduling that builds upon existing analytical models to achieve practical allocation of resources that are constrained by supply and demand. The approach facilitates workface planning to allocate work to individual craft persons. The main contribution of the work is advancement of the current scheduling practice of workface planning by (1) generalizing the resource supply-demand matching problem (RSDMP); and (2) formalizing the RSDMP scheduling approach for planning resource workflows which consists of (a) the mathematical model, (b) a two-stage optimization approach, and (c) innovative use of a resource-activity interaction table. The result is an optimum resource-constrained schedule providing the shortest project duration with the leanest resource supply. The optimum resource requirement is identified between the lower and upper bounds of the resource supply limit, thus ensuring the site’s spatial and safety requirements. The optimum resource workflows of individual craft persons are presented to facilitate the project execution at the workface level. To illustrate the approach, an example adapted from a classic textbook is used. To demonstrate the effectiveness of the approach on a practical level, an oil refinery turnaround project including input data and relevant information prepared for workface planning is used. As a result of the RSDMP analysis, the optimum plan obtained is resource-loaded, practically feasible, and workface executable.
Get full access to this article
View all available purchase options and get full access to this article.
Acknowledgments
This research was substantially funded by National Science and Engineering Research Council (NSERC) and KBR Canada Ltd. The authors would like to acknowledge Vincent Tidder, Dan Pelchat, and Darryl Wilson for sharing knowledge and experience in managing industrial turnaround projects.
References
AbouRizk, S., and Shi, J. (1994). “Automated construction simulation optimization.” J. Constr. Eng. Manage., 374–385.
Ahuja, H. N., Dozzi, S. P., and AbouRizk, S. (1994). Project management: Techniques in planning and controlling construction projects, 2nd Ed., Wiley, New York.
Alcaraz, J., Maroto, C., and Ruiz, R. (2003). “Solving the multi-mode resource constrained project scheduling problem with genetic algorithms.” J. Oper. Res. Soc., 54(6), 614–626.
Ashuri, B., and Tavakolan, M. (2015). “Shuffled frog-leaping model for solving time-cost-resource optimization problems in construction project planning.” J. Comput. Civ. Eng., 04014026.
Blum, C., and Roli, A. (2003). “Metaheuristics in combinatorial optimization: Overview and conceptual comparison.” ACM Comput. Surveys, 35(3), 268–308.
Boctor, F. F. (1990). “Some efficient multi-heuristic procedures for resource-constrained project scheduling.” Eur. J. Oper. Res., 49(1), 3–13.
Brucker, P., Drexl, A., Mohring, R., Neumann, K., and Pesch, E. (1999). “Resource-constrained project scheduling: Notation, classification, models and methods.” Eur. J. Oper. Res., 112(1), 3–41.
Chen, S., Griffis, F., Chen, P., and Chang, L. (2012). “Simulation and analytical techniques for construction resource planning and scheduling.” Autom. Constr., 21, 99–113.
Christodoulou, S., Ellinas, G., and Michaelidou-Kamenou, A. (2010). “Minimum moment method for resource leveling using entropy maximization.” J. Constr. Eng. Manage., 518–527.
CII (Construction Industry Institute). (2013). “Advanced work packaging: Design through workface execution.”, Univ. of Texas at Austin, Austin, TX.
COAA (Construction Owners Association of Alberta). (2014). “COAA workface planning rules.” Edmonton, AB, Canada.
CPLEX version 12.6 [Computer software]. Armonk, NY, IBM Corporation.
De la Garza, J. M., and Kim, K. (2005). “Evaluation of the resource-constrained critical path method algorithms.” J. Constr. Eng. Manage., 522–532.
Demeulemeester, E., De Reyck, B., and Herroelen, W. (2000). “The discrete time/resource trade-off problem in project networks: A branch-and-bound approach.” IIE Trans., 32(11), 1059–1069.
Dorndorf, U., Pesch, E., and Phan-Huy, T. (2000). “A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalized precedence constraints.” Manage. Sci., 46(10), 1365–1384.
Easa, S. (1989). “Resource leveling in construction by optimization.” J. Constr. Eng. Manage., 302–316.
Fayek, A. R., and Peng, J. (2013). “Adaptation of workface planning for construction contexts.” Can. J. Civ. Eng., 40(10), 980–987.
Finke, G. (2008). Operational research and networks, Wiley, New York.
Fondahl, J. W. (1991). “The development of the construction engineer: Past progress and future problems.” J. Constr. Eng. Manage., 380–392.
Ghoddousi, P., Eshtehardian, E., Jooybanpour, S., and Javanmardi, A. (2013). “Multi-mode resource-constrained discrete time-cost-resource optimization in project scheduling using non-dominated sorting genetic algorithm.” Autom. Constr., 30, 216–227.
Gouett, M., Haas, C., Goodrum, P., and Caldas, C. (2011). “Activity analysis for direct-work rate improvement in construction.” J. Constr. Eng. Manage., 1117–1124.
Hall, J. R. (1980). “Multiproject scheduling through zero-one programming.” Manage. Sci., 26(2), 228.
Hariga, M., and El-Sayegh, S. (2011). “Cost optimization model for the multiresource leveling problem with allowed activity splitting.” J. Constr. Eng. Manage., 56–64.
Harris, P. E. (2012). “Project planning and control using oracle primavera p6: Version 8.2 eppm web.” Eastwood Harris, VIC, Australia.
Harris, R. (1990). “Packing method for resource leveling.” J. Constr. Eng. Manage., 331–350.
Harris, R. I. (1978). Precedence and arrow networking techniques for construction, Wiley, New York.
Hartmann, S. (2001). “Project scheduling with multiple modes: A genetic algorithm.” Ann. Oper. Res., 102(1–4), 111–135.
Hegazy, T. (1999). “Optimization of resource allocation and leveling using genetic algorithms.” J. Constr. Eng. Manage., 167–175.
Heon Jun, D., and El-Rayes, K. (2011). “Multiobjective optimization of resource leveling and allocation during construction scheduling.” J. Constr. Eng. Manage., 1080–1088.
Hiyassat, M. (2001). “Applying modified minimum moment method to multiple resource leveling.” J. Constr. Eng. Manage., 192–198.
Hossein Hashemi Doulabi, S., Seifi, A., and Shariat, S. (2011). “Efficient hybrid genetic algorithm for resource leveling via activity splitting.” J. Constr. Eng. Manage., 137–146.
Hu, J., and Flood, I. (2012). “A multi-objective scheduling model for solving the resource-constrained project scheduling and resource leveling problems.” Int. Conf. on Computing in civil engineering, Clearwater Beach, FL, 49–56.
IBM. (2014). “IBM ILOG CPLEX Optimization Studio V12.6.1 documentation.” Armonk, NY.
Kandil, A., El-Rayes, K., and El-Anwar, O. (2010). “Optimization research: Enhancing the robustness of large-scale multiobjective optimization in construction.” J. Constr. Eng. Manage., 17–25.
Karaa, F., and Nasr, A. Y. (1986). “Resource management in construction.” J. Constr. Eng. Manage., 346–357.
Kelley, J. E., and Walker, M. R. (1959). “Critical-path planning and scheduling.” Proc., Eastern Joint Computer Conf., Institute of Radio Engineers, New York, 160–173.
Kim, D., Menches, C., and O’Connor, J. (2015). “Stringing construction planning and execution tasks together for effective project management.” J. Manage. Eng., 04014042.
Kim, J., and Ellis, R., Jr. (2008). “Permutation-based elitist genetic algorithm for optimization of large-sized resource-constrained project scheduling.” J. Constr. Eng. Manage., 904–913.
Kim, J. L. (2009). “Improved genetic algorithm for resource-constrained scheduling of large projects.” Can. J. Civ. Eng., 36(6), 1016–1027.
Kim, K., and De la Garza, J. M. (2003). “Phantom float.” J. Constr. Eng. Manage., 507–517.
Koulinas, G., and Anagnostopoulos, K. (2012). “Construction resource allocation and leveling using a threshold accepting-based hyperheuristic algorithm.” J. Constr. Eng. Manage., 854–863.
Koulinas, G., and Anagnostopoulos, K. (2013). “A new tabu search-based hyper-heuristic algorithm for solving construction leveling problems with limited resource availabilities.” Autom. Constr., 31, 169–175.
Koulinas, G., Kotsikas, L., and Anagnostopoulos, K. (2014). “A particle swarm optimization based hyper-heuristic algorithm for the classic resource constrained project scheduling problem.” Inf. Sci., 277(1), 680–693.
Law, A. M., and Kelton, W. D. (2000). Simulation modeling and analysis, McGraw-Hill, New York.
Lee, D., Yi, C., Lim, T., and Arditi, D. (2010). “Integrated simulation system for construction operation and project scheduling.” J. Comput. Civ. Eng., 557–569.
Lenahan, T. (2006). Turnaround, shutdown and outage management: Effective planning and step-by-step execution of planned maintenance operations, Elsevier/Butterworth-Heinemann, Oxford.
Leu, S. S., and Hung, T. H. (2002). “An optimal construction resource leveling scheduling simulation model.” Can. J. Civ. Eng., 29(2), 267–275.
Leu, S. S., Yang, C. H., and Huang, J. C. (2000). “Resource leveling in construction by genetic algorithm-based optimization and its decision support system application.” Autom. Constr., 10(1), 27–41.
Li, H., and Zhang, H. (2013). “Ant colony optimization-based multi-mode scheduling under renewable and nonrenewable resource constraints.” Autom. Constr., 35, 431–438.
Li, S. (1996). “New approach for optimization of overall construction schedule.” J. Constr. Eng. Manage., 7–13.
Liao, T. W., Egbelu, P. J., Sarker, B. R., and Leu, S. S. (2011). “Metaheuristics for project and construction management—A state-of-the-art review.” Autom. Constr., 20(5), 491–505.
Lova, A., Tormos, P., Cervantes, M., and Barber, F. (2009). “An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes.” Int. J. Prod. Econ., 117(2), 302–316.
Lu, M., Lam, H. C., and Dai, F. (2008). “Resource-constrained critical path analysis based on discrete event simulation and particle swarm optimization.” Autom. Constr., 17(6), 670–681.
Lu, M., and Li, H. (2003). “Resource-activity critical-path method for construction planning.” J. Constr. Eng. Manage., 412–420.
Martínez, J. C., and Ioannou, P. G. (1993). “Resource leveling based on the modified minimum moment heuristic.” Proc., 1993 5th Int. Conf. on Computing in Civil and Building Engineering, L. F. Kohn, ed., ASCE, Reston, VA, 287–294.
MATLAB version 2014 [Computer software]. Natick, MA, Mathworks.
McCahill, D., and Bernold, L. (1993). “Resource-oriented modeling and simulation in construction.” J. Constr. Eng. Manage., 590–606.
Menesi, W., and Hegazy, T. (2014). “Multimode resource-constrained scheduling and leveling for practical-size projects.” J. Manage. Eng., 04014092.
Mingozzi, A., Maniezzo, V., Ricciardelli, S., and Bianco, L. (1998). “An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation.” Manage. Sci., 44(5), 714–729.
Möhring, R. H., Schulz, A. S., Stork, F., and Uetz, M. (2003). “Solving project scheduling problems by minimum cut computations.” Manage. Sci., 49(3), 330–350.
Nemhauser, G. L., and Wolsey, L. A. (1999). Integer and combinatorial optimization, Wiley, New York.
Ng, S., and Zhang, Y. (2008). “Optimizing construction time and cost using ant colony optimization approach.” J. Constr. Eng. Manage., 721–728.
O’Connor, J., and Tucker, R. (1986). “Industrial project constructability improvement.” J. Constr. Eng. Manage., 69–82.
Padilla, E., and Carr, R. (1991). “Resource strategies for dynamic project management.” J. Constr. Eng. Manage., 279–293.
Park, M., Lee, H., Son, B., and Ryu, H. (2005). “Dynamic resource management.” Computing in Civil Engineering, ASCE, Reston, VA, 1–12.
Patterson, J., Slowinski, R., Talbot, F., and Weglarz, J. (1989). “An algorithm for a general class of precedence and resource constrained scheduling problem.” Adv. Project Scheduling, 3–28.
Patterson, J. H. (1984). “A comparison of exact approaches for solving the multiple constrained resource project scheduling problem.” Manage. Sci., 30(7), 854–867.
Patterson, J. H., and Huber, W. D. (1974). “A horizon-varying, zero-one approach to project scheduling.” Manage. Sci., 20(6), 990–998.
Peng, W., and Wang, C. (2009). “A multi-mode resource-constrained discrete time-cost trade-off problem and its genetic algorithm based solution.” Int. J. Project Manage., 27(6), 600–609.
Pidd, M. (2009). Tools for thinking: Modelling in management science, Wiley, New York.
Primavera P6 version 8.0 [Computer software]. Redwood Shores, CA, Oracle Corporation.
Pritsker, A. B., Waiters, L. J., and Wolfe, P. M. (1969). “Multiproject scheduling with limited resources: A zero-one programming approach.” Manage. Sci., 16(1), 93–108.
Rardin, R. L. (1998). Optimization in operations research, Prentice Hall, NJ.
Rieck, J., Zimmermann, J., and Gather, T. (2012). “Mixed-integer linear programming for resource leveling problems.” Eur. J. Oper. Res., 221(1), 27–37.
Savelsbergh, M. W. P. (1994). “Preprocessing and probing techniques for mixed integer programming problems.” J. Comput., 6(4), 445–454.
SDESA version 1.0 [Computer software]. Canada, Univ. of Alberta.
Seibert, J., and Evans, G. (1991). “Time-constrained resource leveling.” J. Constr. Eng. Manage., 503–520.
Siddiqui, M., and Rafiuddin, M. (2012). “Identifying scheduling inefficiencies for industrial projects using the flowline view: A case study.” Computing in civil engineering, ASCE, Reston, VA, 81–88.
Son, J., and Mattila, K. (2004). “Binary resource leveling model: Activity splitting allowed.” J. Constr. Eng. Manage., 887–894.
Son, J., and Skibniewski, M. (1999). “Multiheuristic approach for resource leveling problem in construction engineering: Hybrid approach.” J. Constr. Eng. Manage., 23–31.
Sprecher, A. (2000). “Scheduling resource-constrained projects competitively at modest memory requirements.” Manage. Sci., 46(5), 710–723.
Sprecher, A., and Drexl, A. (1998). “Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm.” Eur. J. Oper. Res., 107(2), 431–450.
Talbot, F. B. (1982). “Resource-constrained project scheduling with time-resource tradeoffs: The non-preemptive case.” Manage. Sci., 28(10), 1197–1210.
Tam, K., and Dissanayake, W. (1998). “Constrained project scheduling by ranked positional weight method.” Can. J. Civ. Eng., 25(3), 424–436.
Tang, S. L. (1999). Linear optimization in applications, Hong Kong University Press, Hong Kong.
Vanhoucke, M., and Debels, D. (2007). “The discrete time/cost trade-off problem: extensions and heuristic procedures.” J. Scheduling, 10(4–5), 311–326.
Winston, W. L. (2003). Operations research: Applications and algorithms, Thomson Brooks/Cole, Pacific Grove, CA.
Wongwai, N., and Malaikrisanachalee, S. (2011). “Augmented heuristic algorithm for multi-skilled resource scheduling.” Autom. Constr., 20(4), 429–445.
Zhang, H., and Li, H. (2004). “Simulation-based optimization for dynamic resource allocation.” Autom. Constr., 13(3), 409–420.
Zhang, H., Li, H., and Tam, C. (2006a). “Particle swarm optimization for preemptive scheduling under break and resource-constraints.” J. Constr. Eng. Manage., 259–267.
Zhang, H., Li, X., Li, H., and Huang, F. (2005). “Particle swarm optimization-based schemes for resource-constrained project scheduling.” Autom. Constr., 14(3), 393–404.
Zhang, H., Tam, C., Li, H., and Shi, J. (2006b). “Particle swarm optimization-supported simulation for construction operations.” J. Constr. Eng. Manage., 1267–1274.
Zhu, G., Bard, J. F., and Yu, G. (2006). “A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem.” J. Comput., 18(3), 377–390.
Information & Authors
Information
Published In
Journal of Construction Engineering and Management
Volume 142 • Issue 1 • January 2016
Copyright
© 2015 American Society of Civil Engineers.
History
Received: Dec 16, 2014
Accepted: May 4, 2015
Published online: Jun 30, 2015
Discussion open until: Nov 30, 2015
Published in print: Jan 1, 2016
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.