- Email: [email protected]
A microcomputer database system for facilities design
A MICROCOMPUTER DATABASE SYSTEM FOR FACILITIES DESIGN C o l i n L. Moodie School oF I n d u s t r i a l E n g i n e e r i n g , Purdue U n d i v e r s i t y L i z e t t e Diaz Rodriguez Westinghouse E l e c t r i c C o r p o r a t i o n David gonzalez B a x t e r T r a v e n o l Lab Inc.
ABSTRACT
A data base management system which i s d e d i c a t e d t o p l a n t l a y o u t type d a t a , and should be u s e f u l t o the p r a c t i c i n g i n d u s t r i a l e n g i n e e r , i s presented. The data items u t i l i z e d i n the data base f o r t h i s microcompute~ s o f t w a r e r e p r e s e n t only a minimal subset of the data which one would want f o r the c r e a t i o n oF a proper, i n d u s t r i a l F a c i l i t y design~ however, they were F e l t t o r e p r e s e n t a good s t a r t i n g point for the creation o f a microcomputer data base system which would aid a l a y o u t engineer. The Knowledgeman s o f t w a r e (Micro Data Base Systems, I n c . ) was used For this p r o j e c t i i t c o n s i s t s o f a r e l a t i o n a l database and an e l e c t r o n i c spreadsheet. Two p l a n t l a y o u t examples are presented t o demonstrate the use oF the s o f t w a r e . KEYWORDS Data base; relation~ R e l a t i o n s h i p Chart~ R e l a t i o n s h i p Diagram; attribute~ schemas p l a n t layouts closeness m a t r i x ; closeness ranks l a y o u t e v a l u a t i o n .
INTRODUCTION This p l a n t l a y o u t , d e c i s i o n s u p p o r t s o f t w a r e c o n s i s t s oF two b a s i c p a r t s . Part 1 takes the input oF p a r t s required, process plans, and machine data, and c a l c u l a t e s the space needed i f a process o ~ l e n t e d l a y o u t i s desired. The key calculation here i n v o l v e s the machine F r a c t i o n Formula. P a r t 2 o f t h i s s o f t w a r e r e q u i r e s the a n a l y s t t o c r e a t e an SLP-type R e l a t i o n s h i p Diagram (using the A , E , I , O , U , X d i a l o g ) and then i n p u t t i n g t h i s data t o the computer. The s o f t w a r e w i l l c a l c u l a t e a d e s i r e d department s e l e c t i o n order For c o n s t r u c t i o n oF the layout. The l a y o u t e n g i n e e r could a i d h i s l a y o u t c r e a t i o n process by u t i l i z i n g a Space R e l a t i o n s h i p Diagram. Part 2 oF t h i s software also enables the e v a l u a t i o n oF a l t e r n a t e l a y o u t s .
ABOUT THE DATA BASE The t h r e e basic F i l e s ( r e l a t i o n s , t a b l e s , e t c . ) used in t h i s s o f t w a r e a r e PARTS, MACH1, and FOPER. The below l i s t e d a t t r i b u t e s o f these r e l a t i o n s d e f i n e t h e i r utility
t o the s o f t w a r e :
PARTS Attributes 1. 2. 3. 4.
PID: DESC: OSIZE: LSIZE:
P a r t Number o~ P a r t ID Part Description Order Size L o t Size
Attributes 1. 2. 3. 4.
MID: MDESC: MAREA: SU:
Machine Number oF Machine ID Machine D e s c r i p t i o n Machine A~ea Set Up Time
MACH1
FOPER Attributes: 1. PID: 2 OID: 3. ODESC:
P a r t Number oF P a r t ID O p e r a t i o n Number oF O p e r a t i o n ID Operation Description
78
NOODLE ET AL: A M i c r o c o m p u t e r D a t a b a s e System f o r F a c i l i t i e s
4. 5. 6.
Design
79
STI: O p e r a t i o n Standard Time MID: Machine Number o f Machine ID DEPNO: Department Number
The names o f the r e l a t i o n s PARTS and MAcH1 more or l e s s i n d i c a t e the c o n t e n t s ~ the files; FOPAR, however, does n o t become e v i d e n t unless the f i r s t l e t t e r (F~ i s removed. This f i l e i s concerned w i t h the manufacturing operations. ]'he schema o f Figure 1 .graphically s h o w s the r e l a t i o n s h i p o f the # i l e s t o ea~:h other.
I
I
Fig. I. Data Base Schema EXECUTINg THE PROGRAM The above d e f i n e d t a b l e s c o n t a i n the basic data u s e d by the system; however, the ~equived q u e r i e s must combine this data w i t h c e r t a i n l o g i c and a l g o r i t h m i c e x p r e s s i o n s i n o r d e r t o o b t a i n the d e s i r e d , plant layout useful output. The program s t a r t s o f f by p r e s e n t i n g the user w i t h a menu o f o p t i o n s : 1. d e t e r m i n a t i o n o f machines and space r e q u i r e m e n t s 2. d e t e r m i n a t i o n o f s e l e c t i o n o r d e r and e v a l u a t i o n o f a l a y o u t c o n f i g u r a t i o n To execute the o p t i o n s related to the determination of machine and space requirements, the user must s e l e c t o p t i o n number 1 ~rom t h i s menu. Next, the program w i l l p r e s e n t a menu r e l a t e d t o the d e t e r m i n a t i o n o f machines and space ~equirements p a r t : 1. c r e a t e new t a b l e s 2. combine t a b l e s 3. machines r e q u i r e d (by p a r t number) 4. machines r e q u i r e d (by machine i d ) 5. summary (by p a r t numbe~ and machine i d ) 6. machines r e ; u i r e d (b~ department no. ) 7. area r e q u i r e d per department 8. p r i n t o u t o f the o r i g i n a l data 9. f i n i s h your work. The user w i l l i n i t i a l l y have t o c r e a t e and combine the t a b l e s before the area i n f o r m a t i o n q u e r i e s can be u t i l i z e d . This i s accomplished by s e l e c t i n g o p t i o n s 1 and 2 o f t h i s secondary m e n u and entering the requested data on p a r t s ,
80
PROCEEDINGS OF THE 8TH ANNUAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING
machines and operati(~ns ]in o p t i o n 2 t h e in o n e t a b l e ~ o r l a t e r r e t r i e v a l Options
p r o g r a m l~ill c o m b l n e t h ~ s !FIF~:,~,~I~Y:E ~ 6 a n d / o r 7 c ~ n be s e l e F ~ e d ~ :
EXAMPLES E x p l a n a t i o n s o~ how the programs work are b e s t shown t h r o u g h example prob~eR~ Two examples w i l l be p r e s e n t e d : one which shows the space c a l c u l a t i o n f e a t u r e , the o t h e r shows the d e p a r t m e n t s e l e c t i o n o r d e r and l a g o u t e v a l u a t i o n o p t i o n s o.F the software. The f i r s t example c o n s i s t s o~ a l a g o u t s i t u a t i o n ~here t h e r ~ ar~, @our d e p a r t m e n t s , @ire p a r t numbers, f i v e machines, and n i n e o p e r a t i o n s Problem 1 I n p u t Data @or Example I : PARTS INFORMATION PID DESC 001 PART A 002 PART B 003 PART C 004 PART D 005 PART E
OSIZE 500 300 400 600 300
MACHINES INFORMATION MID DESC 001 MACH. A 002 MACH. B 003 MACH. C 004 MACH. D 005 MACH. E
MAREA 125.00 250.00 375.00 200.00 150.00
OPERATIONS INFORMATION PID OID 001 001 001 002 002 001 002 002 003 001 003 002 004 001 004 002 005 001 Partial
Program Output f o r
LSIZE 250 100 200 150 175
ODESC OP-I OP02 0P-3 0P-4 OP-5 0P-6 0P-7 0P-8 0P-9
SU 1.25 1.50 1.75 2 00 2.25
MACH ID .
.
.
.
.
001
1
M. REG, .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1.00
TOTAL NUMBER OF MACHINES REQUIRED:
1.00
MACHINES REQUIRED IN DEPARTMENT NO.
2
MACH ID 002
M. REQ. 2.00
TOTAL NUMBER OF MACHINES REGUIRED:
2.00
MACHINES REGUIRED IN DEPARTMENT NO.
3
MACH ID 003 005
M
REG.
1.00 3.00
TOTAL NUMBER OF MACHINES REQUIRED:
4.00
MACHINES REQUIRED IN DEPARTMENT NO.
4
MACH ID
DEPT 1 2 1 2 3 4 3 4 3
Example 1:
MACHINES REGUIRED IN DEPARTMENT NO.
.
MID 001 002 001 002 003 002 005 003 005
STI 2.00 2.25 3.00 5.00 1.50 7.00 b. O0 4.00 3.00
M. REQ,
002
2.00
003
2.00
TOTAL NUMBER OF MACHINES REQUIRED:
4.00
.
.
.
.
.
.
.
.
MOODIE ET AL: A Microcomputer Database System f o r F a c i l i t i e s
ENTER YOUR SELECTION:
Design
81
7
A~te~ o p t i o n 7 has been s e l e c t e d the p r o g r a m Following inputs: ENTER THE NO. OF DEPARTMENTS (MIN. 4
will
MAX. 10):
ask t h e
user the
4
ENTER THE EFFICIENCY OF THE MACHINES ( I N DECIMAL) EFFICIENCY 0.85 ENTER THE AISLE ALLOWANCE DESIRED ( I N DECIMAL) ALLOWANCE: 0.20 Then the p r o g r a m p r e s e n t s the ~ o l l o w i n g spreadsheet w i t h i n f o r m a t i o n t h a t was r e q u e s t e d : AREA PER DEPARTMENT DEPTNO
AREA.
1 2 3 4
150.00 600.00 990.00 1500.00
TOTAL AREA REQUIRED WITH ALLOWANCE: Problem
the
3240.00
2
This example w i l l i l l u s t r a t e the department s e l e c t i o n and layout evaluation portions o~ the p~og~am. The problem c o n s i s t s o~ e i g h t departments (~or which the areas have a l r e a d ~ been c a l c u l a t e d bg pa~t 1 o~ the p~og~am), and the a c t i v i t g r e l a t i o n s h i p m a t r i x shown in Fig. 2. Department
Areas:
DEPARTMENT 1 Polishing 2 C l e a n Room 3 Packing 4 Machine Room 5 Shipping Receiving 7 Tool Shop 8 Production
AREA (SQ. FT) 8,000 11,000 9,000 9,600 12,000 12,000 9, bOO 16,800
!. 2. 3. 4. 5. 6. 7. 8.
POLISHING CLEANROOM PACKING MACHINE ROOM SHIPPING RECEIVING TOOL SHOP PRODUCTION
Fig. 2. Activity Relationship Matrlx
Program E x e c u t i o n : PLANT LAYOUT DESIGN PROGRAM APPROACHES A V A I L A B L E : 1, DETERMINATION OF MACHINES AND SPACE REQUIREMENTS 2. DETERMINATION OF SELECTION ORDER AND EVALUATION OF A LAYOUT CONFIGURATION OPTION SELECTED (1
OR 2 ) :
2
DETERMINATION OF THE SELECTION ORDER AND EVALUATION OF A LAYOUT OPTIONS AVAILABLE: 1. DETERMINATIONOF THE CLOSENESS RANK AND THE SELECTION ORDER
82
PROCEEDINGS OF THE 8TH ANNUAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING
2. 3.
EVALUATION OF A LAYOUT CONFIGURATION F I N I S H YOUR WORK OPTION SELECTED (1,
NO.
OF DEPARTMENTS (MAX. 10,
MIN.
2,
OR 3 ) :
4):
8
4
I
6
8
2
3
Fig.3. Layout Diagram gET
READY TO ENTER
RELATIONSHIP
MATRIX
CLOSENESS RANK OF THE DEPARTMENTS 8
3
5
6
:
4
1
2
7
2
1
7
SELECTION ORDER OF THE DEPARTMENTS : 8
6
4
5
3
WANT TO EVALUATE A LAYOUT CONFIGURATION ( Y / N ) ? Suppose t h e l a y o u t c ~ e a t e d u s i n g t h e can be e v a l u a t e d u s i n g t h i s p~ogram.
selection
Y order
is
as shown i n
Fig.
3
It
gET READY TO ENTER THE NEIGHBORING DEPARTMENTS OF EACH DEPARTMENT CLOSENESS MATRIX DEPT.
NO.: 1 2 3 4 5 b 7 8
: : : : : : : :
1
2
0 I 0 0 0 0 1 0
1 0 1 1 0 0 0 1
3
4 0 1 0 0 1 0 0 I
5 0 1 0 0 0 0 1 1
6 0 0 1 0 0 1 0 1
7 0 0 0 0 1 0 0 1
8 1 0 0 1 0 1 1 1 0 I 0 1 0 0 0 0 SCORE 55
CONCLUSIONS The d e t e r m i n a t i o n of space requirements, layout design and evaluation oF alternatives comprise a large portion of the overall plant layout design p~ocess. A l t h o u g h , many o f t h e t e c h n i q u e s a v a i l a b l e to perform these design stages a~e simple enough to be don@ on a hand c a l c u l a t o r , t h e number oF c o m p u t a t i o n s r e q u i r e d i s l a r g e , even f o r ~ e l a t i v e l g small design problems. As a ~esult, the p l a n t l a y o u t d e s i g n and e v a l u a t i o n s o f t w a r e package d e s c r i b e d h e r e i s a good t o o l t o be used by t h e p l a n t l a y o u t d e s i g n e r . It reduces the number of computations t h a t t h e d e s i g n e r has t o p e r f o r m . However, t h i s p r o g r a m has a drawback. I t t a k e s a l o t o¢ t i m e t o r u n i t : a b o u t 25 m i n u t e s . The reason is that t h e KMAN s o f t w a r e package i s slow. However, i F t h e c o m p u t a t i o n s were done on a hand c a l c u l a t o r i t would t a k e much mo~@ t h a n 25 m i n u t e s . Further software improvements should enable r e d u c i n g t h i s e x e c u t i o n time. REFERENCE Knowlwdaeman R~F~rence Manual Indiana
(1984),
M i c r o Data Base Systems,
Inc.,
LaFagette,
ABSTRACT
A data base management system which i s d e d i c a t e d t o p l a n t l a y o u t type d a t a , and should be u s e f u l t o the p r a c t i c i n g i n d u s t r i a l e n g i n e e r , i s presented. The data items u t i l i z e d i n the data base f o r t h i s microcompute~ s o f t w a r e r e p r e s e n t only a minimal subset of the data which one would want f o r the c r e a t i o n oF a proper, i n d u s t r i a l F a c i l i t y design~ however, they were F e l t t o r e p r e s e n t a good s t a r t i n g point for the creation o f a microcomputer data base system which would aid a l a y o u t engineer. The Knowledgeman s o f t w a r e (Micro Data Base Systems, I n c . ) was used For this p r o j e c t i i t c o n s i s t s o f a r e l a t i o n a l database and an e l e c t r o n i c spreadsheet. Two p l a n t l a y o u t examples are presented t o demonstrate the use oF the s o f t w a r e . KEYWORDS Data base; relation~ R e l a t i o n s h i p Chart~ R e l a t i o n s h i p Diagram; attribute~ schemas p l a n t layouts closeness m a t r i x ; closeness ranks l a y o u t e v a l u a t i o n .
INTRODUCTION This p l a n t l a y o u t , d e c i s i o n s u p p o r t s o f t w a r e c o n s i s t s oF two b a s i c p a r t s . Part 1 takes the input oF p a r t s required, process plans, and machine data, and c a l c u l a t e s the space needed i f a process o ~ l e n t e d l a y o u t i s desired. The key calculation here i n v o l v e s the machine F r a c t i o n Formula. P a r t 2 o f t h i s s o f t w a r e r e q u i r e s the a n a l y s t t o c r e a t e an SLP-type R e l a t i o n s h i p Diagram (using the A , E , I , O , U , X d i a l o g ) and then i n p u t t i n g t h i s data t o the computer. The s o f t w a r e w i l l c a l c u l a t e a d e s i r e d department s e l e c t i o n order For c o n s t r u c t i o n oF the layout. The l a y o u t e n g i n e e r could a i d h i s l a y o u t c r e a t i o n process by u t i l i z i n g a Space R e l a t i o n s h i p Diagram. Part 2 oF t h i s software also enables the e v a l u a t i o n oF a l t e r n a t e l a y o u t s .
ABOUT THE DATA BASE The t h r e e basic F i l e s ( r e l a t i o n s , t a b l e s , e t c . ) used in t h i s s o f t w a r e a r e PARTS, MACH1, and FOPER. The below l i s t e d a t t r i b u t e s o f these r e l a t i o n s d e f i n e t h e i r utility
t o the s o f t w a r e :
PARTS Attributes 1. 2. 3. 4.
PID: DESC: OSIZE: LSIZE:
P a r t Number o~ P a r t ID Part Description Order Size L o t Size
Attributes 1. 2. 3. 4.
MID: MDESC: MAREA: SU:
Machine Number oF Machine ID Machine D e s c r i p t i o n Machine A~ea Set Up Time
MACH1
FOPER Attributes: 1. PID: 2 OID: 3. ODESC:
P a r t Number oF P a r t ID O p e r a t i o n Number oF O p e r a t i o n ID Operation Description
78
NOODLE ET AL: A M i c r o c o m p u t e r D a t a b a s e System f o r F a c i l i t i e s
4. 5. 6.
Design
79
STI: O p e r a t i o n Standard Time MID: Machine Number o f Machine ID DEPNO: Department Number
The names o f the r e l a t i o n s PARTS and MAcH1 more or l e s s i n d i c a t e the c o n t e n t s ~ the files; FOPAR, however, does n o t become e v i d e n t unless the f i r s t l e t t e r (F~ i s removed. This f i l e i s concerned w i t h the manufacturing operations. ]'he schema o f Figure 1 .graphically s h o w s the r e l a t i o n s h i p o f the # i l e s t o ea~:h other.
I
I
Fig. I. Data Base Schema EXECUTINg THE PROGRAM The above d e f i n e d t a b l e s c o n t a i n the basic data u s e d by the system; however, the ~equived q u e r i e s must combine this data w i t h c e r t a i n l o g i c and a l g o r i t h m i c e x p r e s s i o n s i n o r d e r t o o b t a i n the d e s i r e d , plant layout useful output. The program s t a r t s o f f by p r e s e n t i n g the user w i t h a menu o f o p t i o n s : 1. d e t e r m i n a t i o n o f machines and space r e q u i r e m e n t s 2. d e t e r m i n a t i o n o f s e l e c t i o n o r d e r and e v a l u a t i o n o f a l a y o u t c o n f i g u r a t i o n To execute the o p t i o n s related to the determination of machine and space requirements, the user must s e l e c t o p t i o n number 1 ~rom t h i s menu. Next, the program w i l l p r e s e n t a menu r e l a t e d t o the d e t e r m i n a t i o n o f machines and space ~equirements p a r t : 1. c r e a t e new t a b l e s 2. combine t a b l e s 3. machines r e q u i r e d (by p a r t number) 4. machines r e q u i r e d (by machine i d ) 5. summary (by p a r t numbe~ and machine i d ) 6. machines r e ; u i r e d (b~ department no. ) 7. area r e q u i r e d per department 8. p r i n t o u t o f the o r i g i n a l data 9. f i n i s h your work. The user w i l l i n i t i a l l y have t o c r e a t e and combine the t a b l e s before the area i n f o r m a t i o n q u e r i e s can be u t i l i z e d . This i s accomplished by s e l e c t i n g o p t i o n s 1 and 2 o f t h i s secondary m e n u and entering the requested data on p a r t s ,
80
PROCEEDINGS OF THE 8TH ANNUAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING
machines and operati(~ns ]in o p t i o n 2 t h e in o n e t a b l e ~ o r l a t e r r e t r i e v a l Options
p r o g r a m l~ill c o m b l n e t h ~ s !FIF~:,~,~I~Y:E ~ 6 a n d / o r 7 c ~ n be s e l e F ~ e d ~ :
EXAMPLES E x p l a n a t i o n s o~ how the programs work are b e s t shown t h r o u g h example prob~eR~ Two examples w i l l be p r e s e n t e d : one which shows the space c a l c u l a t i o n f e a t u r e , the o t h e r shows the d e p a r t m e n t s e l e c t i o n o r d e r and l a g o u t e v a l u a t i o n o p t i o n s o.F the software. The f i r s t example c o n s i s t s o~ a l a g o u t s i t u a t i o n ~here t h e r ~ ar~, @our d e p a r t m e n t s , @ire p a r t numbers, f i v e machines, and n i n e o p e r a t i o n s Problem 1 I n p u t Data @or Example I : PARTS INFORMATION PID DESC 001 PART A 002 PART B 003 PART C 004 PART D 005 PART E
OSIZE 500 300 400 600 300
MACHINES INFORMATION MID DESC 001 MACH. A 002 MACH. B 003 MACH. C 004 MACH. D 005 MACH. E
MAREA 125.00 250.00 375.00 200.00 150.00
OPERATIONS INFORMATION PID OID 001 001 001 002 002 001 002 002 003 001 003 002 004 001 004 002 005 001 Partial
Program Output f o r
LSIZE 250 100 200 150 175
ODESC OP-I OP02 0P-3 0P-4 OP-5 0P-6 0P-7 0P-8 0P-9
SU 1.25 1.50 1.75 2 00 2.25
MACH ID .
.
.
.
.
001
1
M. REG, .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
1.00
TOTAL NUMBER OF MACHINES REQUIRED:
1.00
MACHINES REQUIRED IN DEPARTMENT NO.
2
MACH ID 002
M. REQ. 2.00
TOTAL NUMBER OF MACHINES REGUIRED:
2.00
MACHINES REGUIRED IN DEPARTMENT NO.
3
MACH ID 003 005
M
REG.
1.00 3.00
TOTAL NUMBER OF MACHINES REQUIRED:
4.00
MACHINES REQUIRED IN DEPARTMENT NO.
4
MACH ID
DEPT 1 2 1 2 3 4 3 4 3
Example 1:
MACHINES REGUIRED IN DEPARTMENT NO.
.
MID 001 002 001 002 003 002 005 003 005
STI 2.00 2.25 3.00 5.00 1.50 7.00 b. O0 4.00 3.00
M. REQ,
002
2.00
003
2.00
TOTAL NUMBER OF MACHINES REQUIRED:
4.00
.
.
.
.
.
.
.
.
MOODIE ET AL: A Microcomputer Database System f o r F a c i l i t i e s
ENTER YOUR SELECTION:
Design
81
7
A~te~ o p t i o n 7 has been s e l e c t e d the p r o g r a m Following inputs: ENTER THE NO. OF DEPARTMENTS (MIN. 4
will
MAX. 10):
ask t h e
user the
4
ENTER THE EFFICIENCY OF THE MACHINES ( I N DECIMAL) EFFICIENCY 0.85 ENTER THE AISLE ALLOWANCE DESIRED ( I N DECIMAL) ALLOWANCE: 0.20 Then the p r o g r a m p r e s e n t s the ~ o l l o w i n g spreadsheet w i t h i n f o r m a t i o n t h a t was r e q u e s t e d : AREA PER DEPARTMENT DEPTNO
AREA.
1 2 3 4
150.00 600.00 990.00 1500.00
TOTAL AREA REQUIRED WITH ALLOWANCE: Problem
the
3240.00
2
This example w i l l i l l u s t r a t e the department s e l e c t i o n and layout evaluation portions o~ the p~og~am. The problem c o n s i s t s o~ e i g h t departments (~or which the areas have a l r e a d ~ been c a l c u l a t e d bg pa~t 1 o~ the p~og~am), and the a c t i v i t g r e l a t i o n s h i p m a t r i x shown in Fig. 2. Department
Areas:
DEPARTMENT 1 Polishing 2 C l e a n Room 3 Packing 4 Machine Room 5 Shipping Receiving 7 Tool Shop 8 Production
AREA (SQ. FT) 8,000 11,000 9,000 9,600 12,000 12,000 9, bOO 16,800
!. 2. 3. 4. 5. 6. 7. 8.
POLISHING CLEANROOM PACKING MACHINE ROOM SHIPPING RECEIVING TOOL SHOP PRODUCTION
Fig. 2. Activity Relationship Matrlx
Program E x e c u t i o n : PLANT LAYOUT DESIGN PROGRAM APPROACHES A V A I L A B L E : 1, DETERMINATION OF MACHINES AND SPACE REQUIREMENTS 2. DETERMINATION OF SELECTION ORDER AND EVALUATION OF A LAYOUT CONFIGURATION OPTION SELECTED (1
OR 2 ) :
2
DETERMINATION OF THE SELECTION ORDER AND EVALUATION OF A LAYOUT OPTIONS AVAILABLE: 1. DETERMINATIONOF THE CLOSENESS RANK AND THE SELECTION ORDER
82
PROCEEDINGS OF THE 8TH ANNUAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING
2. 3.
EVALUATION OF A LAYOUT CONFIGURATION F I N I S H YOUR WORK OPTION SELECTED (1,
NO.
OF DEPARTMENTS (MAX. 10,
MIN.
2,
OR 3 ) :
4):
8
4
I
6
8
2
3
Fig.3. Layout Diagram gET
READY TO ENTER
RELATIONSHIP
MATRIX
CLOSENESS RANK OF THE DEPARTMENTS 8
3
5
6
:
4
1
2
7
2
1
7
SELECTION ORDER OF THE DEPARTMENTS : 8
6
4
5
3
WANT TO EVALUATE A LAYOUT CONFIGURATION ( Y / N ) ? Suppose t h e l a y o u t c ~ e a t e d u s i n g t h e can be e v a l u a t e d u s i n g t h i s p~ogram.
selection
Y order
is
as shown i n
Fig.
3
It
gET READY TO ENTER THE NEIGHBORING DEPARTMENTS OF EACH DEPARTMENT CLOSENESS MATRIX DEPT.
NO.: 1 2 3 4 5 b 7 8
: : : : : : : :
1
2
0 I 0 0 0 0 1 0
1 0 1 1 0 0 0 1
3
4 0 1 0 0 1 0 0 I
5 0 1 0 0 0 0 1 1
6 0 0 1 0 0 1 0 1
7 0 0 0 0 1 0 0 1
8 1 0 0 1 0 1 1 1 0 I 0 1 0 0 0 0 SCORE 55
CONCLUSIONS The d e t e r m i n a t i o n of space requirements, layout design and evaluation oF alternatives comprise a large portion of the overall plant layout design p~ocess. A l t h o u g h , many o f t h e t e c h n i q u e s a v a i l a b l e to perform these design stages a~e simple enough to be don@ on a hand c a l c u l a t o r , t h e number oF c o m p u t a t i o n s r e q u i r e d i s l a r g e , even f o r ~ e l a t i v e l g small design problems. As a ~esult, the p l a n t l a y o u t d e s i g n and e v a l u a t i o n s o f t w a r e package d e s c r i b e d h e r e i s a good t o o l t o be used by t h e p l a n t l a y o u t d e s i g n e r . It reduces the number of computations t h a t t h e d e s i g n e r has t o p e r f o r m . However, t h i s p r o g r a m has a drawback. I t t a k e s a l o t o¢ t i m e t o r u n i t : a b o u t 25 m i n u t e s . The reason is that t h e KMAN s o f t w a r e package i s slow. However, i F t h e c o m p u t a t i o n s were done on a hand c a l c u l a t o r i t would t a k e much mo~@ t h a n 25 m i n u t e s . Further software improvements should enable r e d u c i n g t h i s e x e c u t i o n time. REFERENCE Knowlwdaeman R~F~rence Manual Indiana
(1984),
M i c r o Data Base Systems,
Inc.,
LaFagette,