Computer File
MODEL MATEMATIS PENENTUAN DURASI OPTIMUM PADA JARINGAN KERJA: Kasus Hubungan Diskrit Antara Biaya dan Waktu Aktivitas
The developments of mathematical model in determining the optimum duration in a network have already been conducted. However, most of the models were developed by assuming that the relationships between cost and duration were linear. In fact, the relationships are not always occurred. Several models have been developed for more general cases, by the application of dynamic programming, such as Templeman (1982) and Wibowo (1999). Unfortunately, the use of the dynamic programming faced many restraints such as there was no any standard algorithm and its complexity in calculating the divergent networks. Hence, the application was suggested to be used in the ends of the project (Wibowo, 1999). This paper presents another mathematical model, which assumes that the relationships between cost and duration are discrete. The advantages of the model are able to optimize the networks completely (not just the ends of the project) and ease to solve using provided software packages (TOM, Quant System, etc.). The objective function of the model is to determine the optimum duration, which has the minimum of both direct and indirect cost.
Barcode | Tipe Koleksi | Nomor Panggil | Lokasi | Status | |
---|---|---|---|---|---|
art74343 | DIG | Artikel | Gdg9-Lt3 | Tersedia namun tidak untuk dipinjamkan - No Loan |
Tidak tersedia versi lain