C

A
S A Graphical Based Solution Model for Locating the Position of
E Multiple Spare Part Shops within a Production floor using
Minimax Criteria with Euclidian Distance.

S
T
Supervised by
Md. Mosharraf Hossain
U Professor
Head of IPE, Dean of ME

D
Y
Course No: IPE 3200
Course Title: Case Study
C
A
S
E Problem Statement
S
T
U
D
Y
C
A
S
E

S
T
U
Broken…
D
Y
C
Papers
A
S
E

S
T
U
D
Y
 Summary of review:
C
A
S (Author, year) Findings
Compatible with rectilinear distance. It
E (Morris, 1973)
doesn’t deal with Euclidian distance.
Unable of labeling the already existing
(Drezner & Wesolowsky, 1978)
facilities.

S
Generates a nonlinear objective function
(LOVE, WESOLOWSKY, & KRAEMER, 1973)
which sometimes become hard to solve.

T (CALAMAI & CONN, 1980)

Uses Derivation but cannot cope with
inherent degeneracy.

U
D
Y
C
A
S Reduce response time
E
Minimize Downtime

S Reduce cost
T
U
D
Y
C
A
S
E Spare part shop 1
Spare part shop 2
Existing facility

S
T
U Coverage
D
Y
C
A
S
the logic of
E
’’K-mean Clustering’’
S
T
U
D
Y
C
Also applicable for
A
S
E
Coffee shop location

S
T Hospital storage room

U
& Ambulance service

D Position of Lift
in Industry
Y
C
A
S
E
Methodology
S K-mean Clustering

T
U
D
Y
C K-mean Clustering:
A Assume two critical departments are to be located

S
E Facility 1
Facility 2
Existing facility

S
T
U
D
Y
C Initial Seeding:
A
S
E

S
T
U
D
Y
C Coverage:
A
S Coverage by Critical facility 2
E

S
T Coverage by Critical facility 1
U
D
Y
C 1st Iteration:
A Both facility 1 & 2 are shifted
toward the mean of their cluster

S
E

S
T
U
D
Y
C Coverage:
A
S Coverage by Critical facility 2

S
T
U
Coverage by Critical facility 1

D
Y
C 2nd Iteration:
A Again facility 1 & 2 both are shifted toward

S
the mean of their respective cluster

S
T
U
D
Y
C Final Cluster:
A
S
E

S
T
U
D
Y
C
A
S
E Any Questions !#?
S
T
U
D
Y
C
A
S
E Thank You
S
T
U
D
Y
C
A Attachment:
S
E

S
T
U
D
Y