Case Study Operation Management Operatio
Case Study Operation Management Operatio
CASE STUDY
OPERATIONS MANAGEMENT
Operations
Research O
“Transportation
Transportation Method”
Method
By :
2018
GRADUATE MASTER IN MANAGEMENT PROGRAM
UNIVERSITY OF TECHNOLOGY YOGYAKARTA
INDONESIA
Name: S U P A R N I, S.E
NIM : 617.011.1029
Book Operations Management Page 779-780 (Case Table C.1 s/d C.5)
Course: Operations Management
Lecturer : Dr. Ir. Wahyuni Reksoatmodjo, M.Sc.
“Transportation Method”
Question :
a. Use the Northwest-Corner Method (NCR). What is its total cost ?
b. Use the intuitive lowest-cost approach.Least Cost Method (LCM). What is
it’s total cost ?
c. Using the Stepping-Stone Method (STM), find the optimal solution.Compute
the total cost ?.Px
Demand 50 0 80 30 0 70 40 0 200 0
lowest cost
b. Least Cost Method (LCM)
To (A) (B) (C)
Supply
From Los Angeles Calgary Panama City
$6 $ 18 $8 100
Mexico City
50 50 50
(D)
0
$ 17 $ 13 $ 19 60
Detroit ( E ) 60 0
$ 20 $ 10 $ 24 40
Ottawa( F ) 20 20 0
Demand 50 0 80 20 0 70 20 0 200 0
Demand 50 0 80 40 0 70 20 0 200 0
Destination
Source A B C D E Supply
$ 12 $8 $5 $ 10 $4
1 18
$6 $ 11 $3 $7 $9
2 14
Demand 6 8 12 4 2 32
lowest cost
Total cost of the basic feasible solution using Least Cost Method (LCM) :
From To Units Shipped Per Unit Cost Total Cost
1 A 4 $ 12 $ 48
1 B 8 $ 8 $ 64
1 D 4 $10 $ 40
1 E 2 $ 4 $8
2 A 2 $ 6 $ 12
2 C 12 $ 3 $ 36
Total Cost $ 208
To
From
A B C Supply
X $10 $18 $12 100
Y $17 $13 $9 50
Z $20 $18 $14 75
Demand 50 80 70
Total cost of find the optimal solution using Stepping-Stone Method (STM) :
From To Units Shipped Per Unit Cost Total Cost
X A 50 $ 10 $ 500
X C 50 $ 12 $ 300
Y B 30 $ 13 $ 390
Y C 20 $ 9 $ 180
Z B 50 $ 18 $ 900
Z D 25 $ 0 $ 0
Total Cost $ 2.570
Total cost of initial feasible solution using the Northwest-Corner Method (NCR) :
From To Units Shipped Per Unit Cost Total Cost
X A 50 $ 10 $ 500
X B 50 $ 18 $ 900
Y B 30 $ 13 $ 390
Y C 20 $ 9 $ 180
Z C 50 $ 14 $ 700
Z D 25 $ 0 $ 0
Total Cost $ 2.670
lowest cost
b. Least Cost Method (LCM)
To
Supply
From A B C D
$ 10 $ 18 $ 12 $0 100 50
X 50 30 20 20 30
0
$ 17 $ 13 $9 $0 50
Y 50 0
$ 20 $ 18 $ 14 $0 75
Z 50 25 25
0
Demand 50 0 80 50 0 70 20 0 25 0 200 0
Total cost of initial feasible solution using the Least Cost Method (LCM) :
From To Units Shipped Per Unit Cost Total Cost
X A 50 $ 10 $ 500
X B 30 $ 18 $ 540
X C 20 $ 12 $ 240
Y C 50 $ 9 $ 450
Z B 50 $ 18 $ 900
Z D 25 $ 0 $ 0
Total Cost $ 2.630
$ 20 $ 18 $ 14 $0 75
30 20 25 20
Z
25
0
Demand 50 0 80 30 0 70 20 0 25 0 200 0
Total cost of find the optimal solution using Stepping-Stone Method (STM)
One More :
From To Units Shipped Per Unit Cost Total Cost
X A 50 $ 10 $ 500
X C 50 $ 12 $ 600
Y B 50 $ 13 $ 650
Z B 30 $ 18 $ 540
Z C 20 $ 14 $ 280
Z D 25 $ 0 $ 0
Total Cost $ 2.570
Question :
What is the total cost of the shipping plan that would be obtained by performing
one more iteration of the Stepping-Stone Method (STM) on this problem?
Total cost of find the optimal solution using Stepping-Stone Method (STM) :
From To Units Shipped Per Unit Cost Total Cost
D A 10 $ 2 $ 20
E A 10 $ 4 $ 40
E B 10 $ 5 $ 50
F B 10 $ 3 $ 30
F C 20 $ 2 $ 40
Total Cost $ 180
$ 20 $ 10 $ 25 75
C 30 45 45
0
Demand 40 0 60 30 0 55 45 0 155 0
$ 20 $ 10 $ 25 75
C 60 15 15
0
Demand 40 30 0 60 0 55 15 0 155 0
b.Total cost of the shipping plan that would be obtained by performing one
more iteration of the Stepping-Stone Method (STM) :
From To Units Shipped Per Unit Cost Total Cost
A 1 10 $ 30 $ 300
A 3 40 $ 5 $ 200
B 1 30 $ 10 $ 300
C 2 60 $ 10 $ 600
C 3 15 $ 25 $ 375
Total Cost $ 1.775
Problems example:
PT. Lancar Jaya Tranportasi is planning to allocate owned vehicles to cities A, B,
and C. Here are the transportation tables that have been prepared by managers
of PT. Lancar Jaya Tranportasi. (Cost in IDR, demand and capacity in unit).
Pinalty Request:
Column A: Smallest Cost: 1A-3A (6-4): 2
Column B: Smallest Cost: 1B-3B (8-5): 3
Column C: Smallest Cost: 2C-1C (11-10): 1
Demand
Answer:
The first stage
a. Calculates the opportunity costs of each row & column Penalty fees are
calculated by deducting the 2 smallest charges on each row or column.
b. Choose 1 largest penalty fee from row or column.
c. Allocate as much as possible to the cell at the cheapest cost, according to
capacity and demand.
d. From the calculation results, it is known that demand from city A has been
met as many as 175 units of vehicle warehouse capacity 2.
e. Because the capacity of vehicle warehouse 2 has been exhausted, so the
line of vehicle warehouse 2 can be ignored in the calculation of the next
penalty fee.
Demand
Penalty Fee
Phase Two
a. Recalculate each penalty charge by ignoring the line from the vehicle
warehouse 2.
b. Choose 1 largest penalty fee from row or column.
c. Allocate as much goods as possible to the cell with the cheapest cost in
accordance with the capacity and demand
d. From the calculation, it is known that City B demand has been fulfilled which
is 100 units, and the capacity of vehicle warehouse 3 has been used as
many as 100.
e. City Column B that has been fulfilled its request can be ignored in the
calculation of the next penalty fee
City
Capacity Penalty
Warehouse
Fee
Ignore
18
Demand
Penalty
Fee
City
Capasity Penalty
Warehouse Fee
18
Demand
Penalty
Fee
Phase Four
Calculate shipping transport costs:
Warehouse 1 vehicle to city C: 150 units x Rp. 10 = Rp. 1,500
Vehicle warehouse 2 to city A: 175 units x Rp. 7 = Rp. 1.225
Vehicle warehouse 3 to city A: 25 units x Rp. 4 = Rp. 100
Vehicle warehouse 3 to city B: 100 units x Rp. 5 = Rp. 500
Vehicle warehouse 3 to city C: 150 units x Rp.12 = Rp. 1,800
Total cost = Rp. 1,500 Rp. 1,225 Rp. 100 Rp. 500 Rp. 1,800
Total cost = Rp. 5.125
The total transportation cost obtained in the VAM (Vogel's Approximation
Method) method is not the minimum total cost