Technical Papers
Apr 1, 2014

Two-Stage Scheduling Model for Resource Leveling of Linear Projects

Publication: Journal of Construction Engineering and Management
Volume 140, Issue 7

Abstract

In recent times, linear project resource leveling based on the linear scheduling method (LSM) has attracted considerable interest owing to the unique advantages of applying the LSM to linear projects. In the research reported in this paper, the linear project resource leveling problem was described as a constraint satisfaction problem based on analyses conducted in previous studies and a two-stage scheduling model for resource leveling of linear projects based on the LSM was proposed. The optimization process was reasonably set so as to fully utilize the rate float of the activity to obtain a more optimal schedule. The constraint programming (CP) technique was used for solving this problem. Based on the proposed scheduling model and algorithm, a two-stage scheduling system for resource leveling of linear projects was developed for automatically establishing a linear schedule for resource leveling. The effectiveness of the proposed model and algorithm was verified for a highway construction project reported previously.

Get full access to this article

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

Acknowledgments

The research reported in this paper was funded by the State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, China, under grant RCS2009ZT007 and by the National Key Technology Research and Development Program under grant 2009BAG12A10.

References

Ammar, M. A., and Elbeltagi, E. (2001). “Algorithm for determining controlling path considering resource continuity.” J. Comput. Civ. Eng., 292–298.
Apt, K. R. (2003). Principles of constraint programming, 1st Ed., Cambridge University Press, Cambridge, U.K.
Brailsford, S. C., Potts, C. N., and Smith, B. M. (1999). “Constraint satisfaction problem: 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. Struct. Eng., 513–521.
Christodoulou, S. (2005). “Ant colony optimization in construction scheduling.” Proc., Int. Conf. on Computing in Civil Engineering, ASCE, Reston, VA, 11–17.
Galloway, P. D. (2006). “Survey of the construction industry relative to the use of CPM scheduling for construction projects.” J. Struct. Eng., 697–711.
Georgy, M. E. (2008). “Evolutionary resource scheduler for linear projects.” Automat. Constr., 17(5), 573–583.
Halpin, D. W., and Woodhead, R. W. (1998). Construction management, 2nd Ed., Wiley, Hoboken, NJ.
Harmelink, D. J. (1995). “Linear scheduling model: The development of a linear scheduling model with microcomputer applications for highway construction control.” Ph.D. thesis, Iowa State Univ., Ames, IA.
Harmelink, D. J. (2001). “Linear scheduling model: Float characteristics.” J. Struct. Eng., 255–260.
Harmelink, D. J., and Rowings, J. E. (1998). “Linear scheduling model: Development of controlling activity path.” J. Struct. Eng., 263–268.
Harris, R. B., and Ioannou, P. G. (1998). “Scheduling projects with repeating activities.” J. Constr. Eng. Manage., 269–278.
Hegazy, T. (1999). “Optimization of resource allocation and leveling using genetic algorithms.” J. Struct. Eng., 167–175.
Heipcke, S. (1999). “Comparing constraint programming and mathematical programming approaches to discrete optimization–The change problem.” J. Oper. Res. Soc., 50(6), 581–595.
IBM ILOG CPLEX Optimization Studio V12.2 [Computer software]. IBM, Armonk, NY.
Jain, V., and Grossmann, I. E. (2001). “Algorithms for hybrid MILP/CP models for a class of optimization problems.” Informs J. Comput., 13(4), 258–276.
Johnston, D. W. (1981). “Linear scheduling method for highway construction.” J. Constr. Div., 107(CO2), 247–261.
Kallantzis, A., and Lambropoulos, S. (2004). “Critical path determination by incorporating minimum and maximum time and distance constraints into linear scheduling.” Eng. Construct. Architect. Manage., 11(3), 211–222.
Kallantzis, A., Soldatos, J., and Lambropoulos, S. (2007). “Linear versus network scheduling: A critical path comparison.” J. Struct. Eng., 483–491.
Kolisch, R., and Hartmann, S. (2006). “Experimental investigation of heuristics for resource-constrained project scheduling: An update.” Eur. J. Oper. Res., 174(1), 23–37.
Lancaster, J., and Ozbayrak, M. (2007). “Evolutionary algorithms applied to project scheduling problems–A survey of the state-of-the-art.” Int. J. Prod. Res., 45(2), 425–450.
Liu, S. S., and Wang, C. J. (2007). “Optimization model for resource assignment problems of linear construction projects.” Automat. Constr., 16(4), 460–473.
Liu, S. S., and Wang, C. J. (2008). “Resource-constrained construction project scheduling model for profit maximization considering cash flow.” Automat. Constr., 17(8), 966–974.
Liu, S. S., and Wang, C. J. (2012). “Optimizing linear project scheduling with multi-skilled crews.” Automat. Constr., 24(1), 16–23.
MapInfo MapXtreme v7.0 [Computer software]. Pitney Bowes, Stamford, CT.
Marriott, K., and Stucky, P. J. (1998). Programming with constraints: An introduction, MIT Press, Cambridge, MA.
Mattila, K. G., and Abraham, D. M. (1998). “Resource leveling of linear schedules using integer linear programming.” J. Struct. Eng., 232–244.
Mubarak, S. (2010). Construction project scheduling and control, 2nd Ed., Wiley, Hoboken, NJ.
Park, M. (2005). “Model-based dynamic resource management for construction projects.” Automat. Constr., 14(5), 585–598.
Pinedo, M. L. (2008). Scheduling–Theory, algorithms, and systems, 3rd Ed., Springer, New York.
Reda, R. M. (1990). “RPM: Repetitive project modeling.” J. Struct. Eng., 316–330.
Rossi, F., Peter, V. B., and Walsh, T. (2006). Handbook of constraint programming, Elsevier, Oxfordshire, U.K.
Russell, S. J., and Norvig, P. (2009). Artificial intelligence: A modern approach, 3rd Ed., Prentice Hall, Upper Saddle River, NJ.
Schwindt, C. (2005). Resource allocation in project management, K. Rainer, ed., Springer, Berlin.
Son, J., and Skibniewski, M. J. (1999). “Multiheuristic approach for resource leveling problem in construction engineering: Hybrid approach.” J. Struct. Eng., 23–31.
SQL Server 2008 [Computer software]. Microsoft, Redmond, WA.
Microsoft Visual Studio 2010 [Computer software]. Microsoft, Redmond, WA.
Yamín, R. A., and Harmelink, D. J. (2001). “Comparison of linear scheduling model (LSM) and critical path method (CPM).” J. Struct. Eng., 374–381.

Information & Authors

Information

Published In

Go to Journal of Construction Engineering and Management
Journal of Construction Engineering and Management
Volume 140Issue 7July 2014

History

Received: Jun 12, 2013
Accepted: Feb 19, 2014
Published online: Apr 1, 2014
Published in print: Jul 1, 2014
Discussion open until: Sep 1, 2014

Permissions

Request permissions for this article.

Authors

Affiliations

Yuanjie Tang [email protected]
Doctoral Student, State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong Univ., Beijing 100044, P.R. China. E-mail: [email protected]
Rengkui Liu [email protected]
Associate Professor, State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong Univ., Beijing 100044, P.R. China (corresponding author). E-mail: [email protected]
Quanxin Sun [email protected]
Professor, Ministry of Education (MOE) Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong Univ., Beijing 100044, P.R. China. 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