WEBREVIEW

A linear programming algorithm for least-cost scheduling

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.


Document joint


Auteur(s)

Al Momamni A.

 
| info visites 3372623

Suivre la vie du site fr  Suivre la vie du site Science et Technologie  Suivre la vie du site Science et Technologie  Suivre la vie du site Numéro 12   ?

Creative Commons License