PENYELESAIAN MASALAH TRANSPORTASI BIAYA TETAP MENGGUNAKAN ALGORITMA PERCABANGAN CEPAT DAN SEDERHANA (Studi Kasus pada PT. Semen Indonesia (Persero) Tbk)

HARTONO, EDI (2015) PENYELESAIAN MASALAH TRANSPORTASI BIAYA TETAP MENGGUNAKAN ALGORITMA PERCABANGAN CEPAT DAN SEDERHANA (Studi Kasus pada PT. Semen Indonesia (Persero) Tbk). Undergraduate thesis, UNDIP.

[img]
Preview
PDF
1112Kb
[img]PDF
Restricted to Repository staff only

10Mb
[img]
Preview
PDF
7Kb

Abstract

Fixed Charge Transportation Problem (FCTP) is transportation problem that consider the fixed charge in the object distribution. The solution of fixed charge transportation problem uses Balinski equation by change it become usual transportation problem with no fixed charge and the transportation cost per unit is ̅ = + / . Afterward, find the general solution and place the number of object allocation in the modified transportation problem (MP) and Balinski equation problem ( ). The value of ∗ will be optimal if the upper Z(MP) and the lower value fill the condition of a value ∆. The distribution process of unpacked cement in PT. Semen Indonesia (Persero) Tbk use the ship and harbor t as the main source and packing plant as the goal. The charge that used in the counting process include the ship hire charge, draft survey, and chargingdischarging process. The method of problem solution use the branching method which fast and simple. Keywords : Fixed charge transportation problem, Branching method, Balinski equation

Item Type:Thesis (Undergraduate)
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:84284
Deposited By:INVALID USER
Deposited On:14 Jun 2022 09:27
Last Modified:14 Jun 2022 09:27

Repository Staff Only: item control page