Technical Papers
Apr 3, 2013

Fast and Near-Optimum Schedule Optimization for Large-Scale Projects

Publication: Journal of Construction Engineering and Management
Volume 139, Issue 9

Abstract

Real-life construction projects are large in size and are challenged by many constraints, including strict deadlines and resource limits. In this paper, constraint programming (CP) is used as an advanced mathematical technique that suits schedule optimization problems. A practical CP optimization model has been developed to resolve both deadline and resource constraints simultaneously in large-scale projects. The proposed CP model is much faster than metaheuristic techniques and provides a set of feasible project durations that do not violate resource limits. The paper compares the CP results with several case studies from the literature to prove the practicality and usefulness of the CP approach to both researchers and practitioners. The CP model of this paper could provide solutions within 6.5% deviation from optimum schedules for a large project of 2,000 activities within minutes of processing time. This paper thus contributes to introducing a superior optimization model that is suitable for large-size projects and helps to render schedule optimization a mainstream cost-saving function within commercial scheduling systems.

Get full access to this article

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

References

Ammar, M. (2011). “Optimization of project time-cost trade-off problem with discounted cash flows.” J. Constr. Eng. Manage., 137(1), 65–71.
Beck, J. C., Feng, T. K., and Watson, J. (2011). “Combining constraint programming and local search for job-shop scheduling.” INFORMS J. Comput., 23(1), 1–14.
Brailsford, S. C., Potts, C. N., and Smith, B. M. (1999). “Constraint satisfaction problems: Algorithms and applications.” Eur. J. Oper. Res., 119(3), 557–581.
Chan, W. T., and Hu, H. (2002). “Constraint programming approach to precast production scheduling.” J. Constr. Eng. Manage., 128(6), 513–521.
Chan, W. T., and Zeng, Z. (2003). “Coordinated production scheduling of prefabricated building components.” Proc., Construction Research Congress, ASCE, Reston, VA, 1–8.
Chassiakos, A. P., and Sakellaropoulos, S. P. (2005). “Time-cost optimization of construction projects with generalized activity constraints.” J. Constr. Eng. Manage., 131(10), 1115–1124.
Chen, P. H., and Weng, H. (2009). “A two-phase GA model for resource constrained project scheduling.” Automat. Constr., 18(4), 485–498.
Christodoulou, S. E., Ellinas, G., and Michaelidou-Kamenou, A. (2010). “Minimum moment method for resource leveling using entropy maximization.” J. Constr. Eng. Manage., 136(5), 518–527.
Elazouni, A., and Metwally, F. (2007). “Expanding finance-based scheduling to devise overall-optimized project schedules.” J. Constr. Eng. Manage., 133(1), 86–90.
Elmaghraby, S. (1993). “Resource allocation via dynamic programming in activity networks.” Eur. J. Oper. Res., 64(2), 199–215.
Eshtehardian, E., Afshr, A., and Abbasnia, R. (2008). “Time–cost optimization: Using GA and fuzzy sets theory for uncertainties in cost.” Constr. Manage. Econ., 26(7), 679–691.
Gorman, M., and Kanet, J. (2010). “Formulation and solution approaches to the rail maintenance production gang scheduling problem.” J. Transp. Eng., 136(8), 701–708.
Harris, R. B. (1990). “Packing method for resource leveling (pack).” J. Constr. Eng. Manage., 116(2), 331–350.
Hegazy, T. (1999). “Optimization of resource allocation and leveling using genetic algorithms.” J. Constr. Eng. Manage., 125(3), 167–175.
Hegazy, T. (2006). “Simplified project management for construction practitioners.” Cost Eng. J., 48(11), 20–28.
Hegazy, T., and Menesi, W. (2012). “Heuristic method for satisfying both deadlines and resource constraints.” J. Constr. Eng. Manage., 138(6), 1–9.
Heipcke, S. (1999). “Comparing constraint programming and mathematical programming approaches to discrete optimization–The change problem.” J. Oper. Res. Soc. Jpn., 50(6), 581–595.
Hiyassat, M. A. S. (2001). “Applying modified minimum moment method to multiple resource leveling.” J. Constr. Eng. Manage., 127(3), 192–198.
IBM ILOG CPLEX Optimization Studio V12.3. (2012). [Computer software]. IBM, Armonk, NY.
Jiang, G., and Shi, J. (2005). “Exact algorithm for solving project scheduling problems under multiple resource constraints.” J. Constr. Eng. Manage., 131(9), 986–992.
Kandil, A., and El-Rayes, K. (2005). “Parallel computing framework for optimizing construction planning in large-scale projects.” J. Comput. Civ. Eng., 19(3), 304–312.
Kastor, A., and Sirakoulis, K. (2009). “The effectiveness of resource levelling tools for resource constraint project scheduling problem.” Int. J. Proj. Manage., 27(5), 493–500.
Leu, S., and Yang, C. (1999). “GA-based multicriteria optimal model for construction scheduling.” J. Constr. Eng. Manage., 125(6), 420–427.
Lucko, G. (2011). “Integrating efficient resource optimization and linear schedule analysis with singularity functions.” J. Constr. Eng. Manage., 137(1), 45–55.
Moselhi, O. (1993). “Schedule compression using the direct stiffness method.” Can. J. Civ. Eng., 20(1), 65–72.
Peteghem, V. V., and Vanhoucke, M. (2010). “A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem.” Eur. J. Oper. Res., 201(2), 409–418.
Rogalska, M., Bożejko, W., and Hejducki, Z. (2008). “Time/cost optimization using hybrid evolutionary algorithm in construction project scheduling.” Automat. Constr., 18(1), 24–31.
Senouci, A., and Eldin, N. (2004). “Use of genetic algorithms in resource scheduling of construction projects.” J. Constr. Eng. Manage., 130(6), 869–877.
Son, J., and Mattila, K. (2004). “Binary resource leveling model: Activity splitting allowed.” J. Constr. Eng. Manage., 130(6), 887–894.
Son, J., and Skibniewski, M. (1999). “Multiheuristic approach for resource leveling problem in construction engineering: Hybrid approach.” J. Constr. Eng. Manage., 125(1), 23–31.
Vanhoucke, M., and Debels, D. (2007). “The discrete time/cost trade-off problem: Extensions and heuristic procedures.” J. Schedul., 10(4–5), 311–326.
Wuliang, P., and Chengen, W. (2009). “A multi-mode resource-constrained discrete time–cost tradeoff problem and its genetic algorithm based solution.” Int. J. Proj. Manage., 27(6), 600–609.
Zahraie, B., and Tavakolan, M. (2009). “Stochastic time-cost-resource utilization optimization using nondominated sorting genetic algorithm and discrete fuzzy sets.” J. Constr. Eng. Manage., 135(11), 1162–1171.
Zhang, H. (2012). “Ant colony optimization for multimode resource-constrained project scheduling.” J. Manage. Eng., 28(2), 150–159.

Information & Authors

Information

Published In

Go to Journal of Construction Engineering and Management
Journal of Construction Engineering and Management
Volume 139Issue 9September 2013
Pages: 1117 - 1124

History

Received: Jun 8, 2012
Accepted: Mar 29, 2013
Published online: Apr 3, 2013
Published in print: Sep 1, 2013
Discussion open until: Sep 3, 2013

Permissions

Request permissions for this article.

Authors

Affiliations

Wail Menesi [email protected]
Aff.M.ASCE
Postdoctoral Fellow, Civil and Environmental Engineering Dept., Univ. of Waterloo, Waterloo, ON N2L 3G1, Canada. E-mail: [email protected]
Behrooz Golzarpoor [email protected]
Graduate Student, Management Sciences Dept., Univ. of Waterloo, Waterloo, ON N2L 3G1, Canada. E-mail: [email protected]
Tarek Hegazy [email protected]
M.ASCE
Professor, Civil and Environmental Engineering Dept., Univ. of Waterloo, Waterloo, ON N2L 3G1, Canada (corresponding author). E-mail: [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