Saputra, Victor (2018) Network compression proyek repetitif dengan metode linear programming. Masters thesis, Universitas Tarumanagara.
Text
ABSTRAK TESIS MTS Victor Saputra.pdf Download (52kB) |
Abstract
Repetitive projects are construction projects that job is done repeatedly. In general, repetitive project scheduling uses the method of repetitive scheduling. But the shortcomings of repetitive scheduling method is that it does not produce the optimum scheduling (minimum cost). In order to get the maximum duration, it usually uses the network compression method for scheduling. Therefore, the two scheduling methods are combined to obtain the optimum scheduling of the repetitive project. In this study, analysis is conducted on a housing project in Madiun, East Java with house type 51/80 which amounted to 28 units. In the analysis, there are several things that affect the duration and total cost of the project include work-break time and compression duration. This research is aimed at the minimum cost which is the result of scheduling with project cost. The research analysis uses linear programming analysis method with LINGO program. Compression network analysis on the repetitive project results in scheduling with optimum duration and shows the duration of activities between units may vary.
Item Type: | Thesis (Masters) |
---|---|
Subjects: | Tesis Tesis > Pascasarjana |
Divisions: | Fakultas Teknik > Teknik Sipil |
Depositing User: | Puskom untar untar |
Date Deposited: | 06 Dec 2018 06:59 |
Last Modified: | 09 May 2021 09:39 |
URI: | http://repository.untar.ac.id/id/eprint/9415 |
Actions (login required)
View Item |