A LINEAR PROGRAMMING ALGORITHM FOR LEAST-COST SCHEDULING

Authors

  • AYMAN H AL-MOMANI Mu'tah University

Keywords:

Linear programming, cost optimization, least cost-scheduling, time-cost trade-off, project compression, expediting

Abstract

In this research, some concepts of linear programming and critical path method are reviewed to describe recent modeling structures that have been of great value in analyzing extended planning horizon project time-cost trade-offs problems.

A simplified representation of a small project and a linear programming model is formulated to represent this system. Procedures to solve these various problems formulations were cited and the final solution is obtained using LINDO program. The model developed represents many restrictions and management considerations of the project. It could be used by construction managers in a planning stage to explore numerous possible opportunities to the contractor and predict the effect of a decision on the construction to facilitate a preferred operating policy given different management objectives.

An implementation using this method is shown to outperform several other techniques and a large class of test problems. Linear programming show that the algorithm is very promising in practice on a wide variety of time-cost trade-offs problems. This method is simple, applicable to a large network, and generates a shorter computational time at low cost, along with an increase in robustness.

Downloads

Download data is not yet available.

Author Biography

AYMAN H AL-MOMANI, Mu'tah University

Civil Angineering Department

References

- Senouci A.B. and Eldin N.N., "A time-cost trade-off algorithm for nonserial linear projects", Canadian J. of Engineering, Vol.23, (1996), pp.134-149.

- Birrell G.S., "Construction Planning-Beyond the Critical Path", J. of the Construction Division, Vol. 106, N° Co3, (1980), pp 389-407.

- Selinger S., "Construction planning for linear projects", ASCE Journal of the Construction Division, Vol. 106, 2, (1980), pp.195-205.

- Russel A.D. and Caselton W.F., "Extensions to linear scheduling optimizarion", ASCE Journal of Construction Engineering and Management,Vol.114, 1, (1988), pp.36-52.

- Reda R.M., "RPM: repetitive project modeling", ASCE Journal of Construction Engineering and Management, 116, 2, (1990), pp. 316-330.

- Elmaghraby S.E. and Pulat P.S., "Optimal Project Compression with Due-Dated Events, "Naval Research Logistics Quaterly, Vol.26, N°2, (1997), pp. 331-348.

- Moore L.J., Taylor III B.W., Clayton E.R., and Lee S.M., "Analysis of a Multi-Criteria Project Crashing Model," American Institute of Industrial Engineering Trams., Vol. 10, N°2, (1998), pp. 163-169.

- Smith L.A., "Comparing Comparing Commercially Available CPM/PERT Computer Programs", Journal of Industrial Engineering, Vol. 10, N°4, (1997).

- Schrage L.E., User's manual for LINDO; Scientific Press, Palo Alto, California, (1981).

- Al Serraj Z.M., "Formal development of line-of-balance technique", ASCE Journal of Construction Engineering and Management, Vol.116, 4, (1990), pp. 689-704.

- Savin D., Alkass S., and Fazio P., "Construction ressource leveling using neural networks", Canadian J. of Engineering, Vol.23, (1996), pp.917-925.

- Siemens N., "A Simple CPM Time-Cost Trade-off Algorithm," Management Science, Vol.17, N°6, (1997), pp.B354-363.

Downloads

Published

1999-12-01

How to Cite

AL-MOMANI, A. H. (1999). A LINEAR PROGRAMMING ALGORITHM FOR LEAST-COST SCHEDULING. Sciences & Technology. A, Exactes Sciences, (12), 71–76. Retrieved from https://revue.umc.edu.dz/a/article/view/1640

Issue

Section

Articles

Similar Articles

1 2 3 4 > >> 

You may also start an advanced similarity search for this article.