Show simple item record

dc.contributoren-US
dc.contributorfr-CA
dc.creatorAL-MOMANI, AYMAN H
dc.date1999-12-01
dc.date.accessioned2017-05-28T00:03:25Z
dc.date.available2017-05-28T00:03:25Z
dc.identifierhttp://revue.umc.edu.dz/index.php/a/article/view/1640
dc.identifier.urihttp://hdl.handle.net/123456789/133290
dc.descriptionIn 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.en-US
dc.descriptionfr-CA
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversité des Frères Mentouri Constantine 1fr-CA
dc.relationhttp://revue.umc.edu.dz/index.php/a/article/view/1640/1760
dc.rightsTous droits réservés (c) 2016 Sciences & Technologie Afr-CA
dc.sourceSciences & Technologie A; N° 12 Décembre 1999; 71-76en-US
dc.sourceSciences & Technologie A; N° 12 Décembre 1999; 71-76fr-CA
dc.source1111-5041
dc.source1111-5041
dc.subjecten-US
dc.subjectLinear programming; cost optimization; least cost-scheduling; time-cost trade-off; project compression; expeditingen-US
dc.subjectfr-CA
dc.subjectfr-CA
dc.titleA LINEAR PROGRAMMING ALGORITHM FOR LEAST-COST SCHEDULINGen-US
dc.titlefr-CA
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typefr-CA
dc.coverageen-US
dc.coverageen-US
dc.coverageen-US
dc.coveragefr-CA
dc.coveragefr-CA
dc.coveragefr-CA


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record