- Email: [email protected]
Facilities planning and design with microcomputers
Computers ind. En~n~ Vol. 13, Nos I-4, pp.332-335, 1987 Printed in Great Britain. All rights reserved
0360-8352/87 $3.00+0.00 Copyright c 1987 Pergamon Journals LtO
FACILITIES PLANNING AND DESIGN WITH MICROCOMPUTERS
Hamid R. Parsaei*, and Louis J. Galbiati III** * University of Louisville ** State University of New York, Utica
ABSTRACT
T~is paper describes an interactive layout design program, that is written in LISP and runs on IBM PC, KT, AT, or compatible microcomputers. This program follows a construction algorithm and generates a block diagram
KEYWORDS Microcomputer layout, routine, computerized layout planning, relationship chart, plant layout, microcomputer software.
INTRODUCTION Facility design researchers have focused on the development of computer routines to assist planner in the design of the layout for over twenty years. A r m o ~ and Buffa (1963) introduced the first computer-assisted layout routine and since then, many programs have been developed by others (Lee and Moore, 1967; Seehof and Evans, 1967). A common feature among these programs is that they generate block layouts rather than detailed designs. Generally the computerized layout routines are developed following either construction algorithms or improvement algorithms. When a routine ~enecates a layout from scratch, It is referred to as a construction algorit~n, and when a routine generates a layout by improving the existing one, it is called an impro~enent algorithm. In b~pcovement algorlt~ns, based on materlal flow considerations, the routine b~proves the existing layout by interchanging the departments. In construction algorithms, the main concern is the relationships between the departments (Francis and White, 1974; To npkins and White, 1984). The majority of these layout routines have been deceloped for mainframes. With recent ~evelo~ment in microcomputer technology and availability of the systeas with moderate speed and adequate memory size, the need for the developuent of similar programs for microcomputers with the .natnframes" routine capabilities e~Ist (Parsael and Morier, 1985 and 1986; Parsaei and Galbiatl, 1987). This paper presents an interactive layout design program that is written in LISP and runs on IBM PC, XT, AT, or compatible microcomputer. Requirements include 512K me,nory and the PC-SCHEME LISP software by Texas Inst=u~ents. This program is a c o n s t r u c t i ~ routine and generates block layouts according to Lee aud Moore's algorithm, (t967). The program has the capability of handling up to 20 departments. The inputs to the program include: departmental area cequlrements (department number, width, height, and an optional department description), relationship (REL) chart, numerical closeness ratings, and weighted closeness ratings. The closeness ratings de~Ine the relationship between a given palr of departments and are e~pressed by ordinal scales. The possible closeness ratings are summarized as: A = Absol~tely essentlal; E = Essential; I ~ ImportaL~t; O = Ordinary; U = Unimportant; X ~ Undeslrabl~. The numerical closeness ratings are used to determlae the best place for each new department. This paper assumes the weighted closeness ratings of: A = 600; E = 200; I - 50; O = I0; U = O; AND x = -200 for the illustrated case study. These values may change from one case to another, and each ti~e user can enter a new set of aunbers for closeness and weighted cl,~seness ratings. ~le process of selection and placement of departnents ,uay start by selecting the department with the highest total closeness rating and place it in the layout. If a tie e~ists, the following rule~ are applied: i) ii)
Maxii~n a r e a Minimum department number
7qe~t, the REL chart scanned for a department sharing an "A" rating with the flc~t department, if 0ore than one department is found, the following criteria is used:
332
Parsaei and Galbiati: F a c i l i t i e s planning
i) ii) Ill)
333
Maximumtotal closeness ratings Maximumarea Minimum department number
I f a department having an "A" rating cannot be found, the EL chart is scanned for a department having an "E" rating wlth the f i r s t department and process continues. The score of a layout is: Score of = ~ the layout
closest r e c t i l i n e a r dl stance
X numerical closeness ratl ngs
as defined by Tompklns and White (Ig84). INSTRtH:TIONS FOR USING PC-CORELAP The following instructions are for using PC CORELAP on an IBM XT, AT, or Compatible with Hard Disk, Floppy Disk, and at least 512K reentry. I.
I n s t a l l PC-Schemeon the hard disk as described in the PC-Scheme Manual. (PC-Schemecan be obtained from Texas Instruments). We understand that PC-Scheme can also be used on an PC, XT, or AT without a hard disk, but has not been t r i e d by the authors.
2.
After turning on the machine, place the PC-Corelap disk in the Floppy Disk 9rive.
3.
L o a d Pc-Scheme and PC-Corelap into reentry by giving the following commands: A: START PCS (LOAD "CORELAP")
4.
Use the EI)~IN t e x t e d i t o r to n~dlfy the f i l e "data" for your p a r t i c u l a r case study. The six input parameters are defined in this f i l e . (The use of EDWIN is described in the PC-Schen~e manual. I f you prefer, you may use a different editor to nlodify the f i l e p r i o r to step 3.) The specific f o r ~ t for thls f i l e is shown in the case s t u ~ . The horizontal and vertical layout is unimportant as long as the definitions and l i s t s are parenthesized correctly.
5.
Run the program by giving the following command:
( RUN) 6.
Use the appropriate commands to generate the layout. The f command finishes the layout in one step. The ? comnklnd gives a menu of other commands. The q commandquits from the program. After q u i t t i n g from the program, the user can repeat steps 4, 5, and 6 with d i f f e r e n t parameter values. Certain errors in the commands typed by the user w i l l cause PC-Corelap to crash. happens, the program can be restarted with no loss of information by typing
I f thls
CONTROL-Q ( RESTART) CASE SllJDY Fig. 1 i l l u s t r a t e s the format of the input data required by PC-CORELAP. Each department Is i d e n t i f i e d by the department number, width, height, and (optional) description for the department. The contents of the EL chart are entered in the order shown below: 1:2, 1:3, - . . . . . . 2:3, - . . . . . .
1:0 2:0 9:0
The numerical r~tlngs and weighted closeness ratings are entered according to the format shown in Pig. I . The user may a l t e r these val~Jes and enter the numbers of his and/or her own choice. depart,~ents : ( ( I 25 25 RECEIVING AND SIiIPPING) (2 60 60 STORAGE) (3 40 40 LOUNGE) (4 70 70 PRODUCTION) (5 30 30 PROUUCTION SUPERVISOR'S OFFICE) (6 40 40 ACCOUNTING AND DATA PROCESSING) (7 20 20 REST ROOMS)
334
Proceedings of the 9th Annual Conference on Computers & I n d u s t r i a l Engineering
tel-char t
( AOEUO0 OA I on OOO1 Ell A I l
) numerlcal-closeness-ratlngs
( CA (Z (i (o (u (x
:
6) 5) 4) 3) 2) l))
weighted-closeness-ratlngs ( (A 600) (E 2 0 0 ) (i 50) (o to) (u o) (x-2oo) )
:
order-method : CORELAPS place-method : CORELAP8 Fig. I. Input Data File ~or the Case Study
After all necessary data entered, displayed in Fig. 2.
order of placement:
the final layout is generated
and scored.
This result ls
4, 2, I, 5, 6, 7, 3
layout score: 1150
V
5"
G
l
Fig. 2. Layout Generated by t1~e Program
REFERENCES
A r m o r , O. C., and E. S. Buffalo (1963). A Heurlsttc Algorlthn and Simulation to Relative Locstlon of Facilities. Management Science, 9, 290-309. Francis, R. L., and J. A. White (1974). Facility Layout and Locatio% An Anal~tlcal Approach. Preatlce-Halt, Inc., New Jersey. Lee, R.C., and J. M. Moore (1967). CORELAP-Computerized Relationship Layout Plannlng. Th_~e Journal of Industrial En~Inearln~, 18, 195-200. Parsael, H. R., and J. S. Morler (1985). Computerized Layout Plannlng. Th_~e Proceedln~s o~ th~ 18th Annual Conference of National Association of Industrial Technology, Terre Ha0te, Indiana,
Parsaei and Galbiati: F a c i l i t i e s planning
335
Parsaei, H. R., and J. S. Morler (1986). An Interactl~e Program Assists Layout Planning. The Proceedln~s of the 3th Annual Conference on Computers and Industrlal En~lneerln~r Orlando~ Florida. Parsael, H. R., aud L. J. Galblatl, III. (1987). Layout Planning and Design with Mlcrocomputers. The Proceeding8 of the Ist Annual Conference on En~Ineerln~ and Manufacturln~ Software, Chicago, Illinois. Seehof, J. M., and W. O. Evans (1967). Automated Layout Design Prograu. The Journal of Industrial En~Ineerln~, 18, 690-695. Tompklns, J. A., and J. A. White (1984). Fac11[ttes Planning. John Wlley and Sons, New York.
NOTE A copy of the program may be obtained by writing to the first author at University of Louisville, Louisville, Kentucky, 40292. Note that It is necessary to acquLre the PC-Scheme LISP Software from Texas Instruments in order to run this program.
0360-8352/87 $3.00+0.00 Copyright c 1987 Pergamon Journals LtO
FACILITIES PLANNING AND DESIGN WITH MICROCOMPUTERS
Hamid R. Parsaei*, and Louis J. Galbiati III** * University of Louisville ** State University of New York, Utica
ABSTRACT
T~is paper describes an interactive layout design program, that is written in LISP and runs on IBM PC, KT, AT, or compatible microcomputers. This program follows a construction algorithm and generates a block diagram
KEYWORDS Microcomputer layout, routine, computerized layout planning, relationship chart, plant layout, microcomputer software.
INTRODUCTION Facility design researchers have focused on the development of computer routines to assist planner in the design of the layout for over twenty years. A r m o ~ and Buffa (1963) introduced the first computer-assisted layout routine and since then, many programs have been developed by others (Lee and Moore, 1967; Seehof and Evans, 1967). A common feature among these programs is that they generate block layouts rather than detailed designs. Generally the computerized layout routines are developed following either construction algorithms or improvement algorithms. When a routine ~enecates a layout from scratch, It is referred to as a construction algorit~n, and when a routine generates a layout by improving the existing one, it is called an impro~enent algorithm. In b~pcovement algorlt~ns, based on materlal flow considerations, the routine b~proves the existing layout by interchanging the departments. In construction algorithms, the main concern is the relationships between the departments (Francis and White, 1974; To npkins and White, 1984). The majority of these layout routines have been deceloped for mainframes. With recent ~evelo~ment in microcomputer technology and availability of the systeas with moderate speed and adequate memory size, the need for the developuent of similar programs for microcomputers with the .natnframes" routine capabilities e~Ist (Parsael and Morier, 1985 and 1986; Parsaei and Galbiatl, 1987). This paper presents an interactive layout design program that is written in LISP and runs on IBM PC, XT, AT, or compatible microcomputer. Requirements include 512K me,nory and the PC-SCHEME LISP software by Texas Inst=u~ents. This program is a c o n s t r u c t i ~ routine and generates block layouts according to Lee aud Moore's algorithm, (t967). The program has the capability of handling up to 20 departments. The inputs to the program include: departmental area cequlrements (department number, width, height, and an optional department description), relationship (REL) chart, numerical closeness ratings, and weighted closeness ratings. The closeness ratings de~Ine the relationship between a given palr of departments and are e~pressed by ordinal scales. The possible closeness ratings are summarized as: A = Absol~tely essentlal; E = Essential; I ~ ImportaL~t; O = Ordinary; U = Unimportant; X ~ Undeslrabl~. The numerical closeness ratings are used to determlae the best place for each new department. This paper assumes the weighted closeness ratings of: A = 600; E = 200; I - 50; O = I0; U = O; AND x = -200 for the illustrated case study. These values may change from one case to another, and each ti~e user can enter a new set of aunbers for closeness and weighted cl,~seness ratings. ~le process of selection and placement of departnents ,uay start by selecting the department with the highest total closeness rating and place it in the layout. If a tie e~ists, the following rule~ are applied: i) ii)
Maxii~n a r e a Minimum department number
7qe~t, the REL chart scanned for a department sharing an "A" rating with the flc~t department, if 0ore than one department is found, the following criteria is used:
332
Parsaei and Galbiati: F a c i l i t i e s planning
i) ii) Ill)
333
Maximumtotal closeness ratings Maximumarea Minimum department number
I f a department having an "A" rating cannot be found, the EL chart is scanned for a department having an "E" rating wlth the f i r s t department and process continues. The score of a layout is: Score of = ~ the layout
closest r e c t i l i n e a r dl stance
X numerical closeness ratl ngs
as defined by Tompklns and White (Ig84). INSTRtH:TIONS FOR USING PC-CORELAP The following instructions are for using PC CORELAP on an IBM XT, AT, or Compatible with Hard Disk, Floppy Disk, and at least 512K reentry. I.
I n s t a l l PC-Schemeon the hard disk as described in the PC-Scheme Manual. (PC-Schemecan be obtained from Texas Instruments). We understand that PC-Scheme can also be used on an PC, XT, or AT without a hard disk, but has not been t r i e d by the authors.
2.
After turning on the machine, place the PC-Corelap disk in the Floppy Disk 9rive.
3.
L o a d Pc-Scheme and PC-Corelap into reentry by giving the following commands: A: START PCS (LOAD "CORELAP")
4.
Use the EI)~IN t e x t e d i t o r to n~dlfy the f i l e "data" for your p a r t i c u l a r case study. The six input parameters are defined in this f i l e . (The use of EDWIN is described in the PC-Schen~e manual. I f you prefer, you may use a different editor to nlodify the f i l e p r i o r to step 3.) The specific f o r ~ t for thls f i l e is shown in the case s t u ~ . The horizontal and vertical layout is unimportant as long as the definitions and l i s t s are parenthesized correctly.
5.
Run the program by giving the following command:
( RUN) 6.
Use the appropriate commands to generate the layout. The f command finishes the layout in one step. The ? comnklnd gives a menu of other commands. The q commandquits from the program. After q u i t t i n g from the program, the user can repeat steps 4, 5, and 6 with d i f f e r e n t parameter values. Certain errors in the commands typed by the user w i l l cause PC-Corelap to crash. happens, the program can be restarted with no loss of information by typing
I f thls
CONTROL-Q ( RESTART) CASE SllJDY Fig. 1 i l l u s t r a t e s the format of the input data required by PC-CORELAP. Each department Is i d e n t i f i e d by the department number, width, height, and (optional) description for the department. The contents of the EL chart are entered in the order shown below: 1:2, 1:3, - . . . . . . 2:3, - . . . . . .
1:0 2:0 9:0
The numerical r~tlngs and weighted closeness ratings are entered according to the format shown in Pig. I . The user may a l t e r these val~Jes and enter the numbers of his and/or her own choice. depart,~ents : ( ( I 25 25 RECEIVING AND SIiIPPING) (2 60 60 STORAGE) (3 40 40 LOUNGE) (4 70 70 PRODUCTION) (5 30 30 PROUUCTION SUPERVISOR'S OFFICE) (6 40 40 ACCOUNTING AND DATA PROCESSING) (7 20 20 REST ROOMS)
334
Proceedings of the 9th Annual Conference on Computers & I n d u s t r i a l Engineering
tel-char t
( AOEUO0 OA I on OOO1 Ell A I l
) numerlcal-closeness-ratlngs
( CA (Z (i (o (u (x
:
6) 5) 4) 3) 2) l))
weighted-closeness-ratlngs ( (A 600) (E 2 0 0 ) (i 50) (o to) (u o) (x-2oo) )
:
order-method : CORELAPS place-method : CORELAP8 Fig. I. Input Data File ~or the Case Study
After all necessary data entered, displayed in Fig. 2.
order of placement:
the final layout is generated
and scored.
This result ls
4, 2, I, 5, 6, 7, 3
layout score: 1150
V
5"
G
l
Fig. 2. Layout Generated by t1~e Program
REFERENCES
A r m o r , O. C., and E. S. Buffalo (1963). A Heurlsttc Algorlthn and Simulation to Relative Locstlon of Facilities. Management Science, 9, 290-309. Francis, R. L., and J. A. White (1974). Facility Layout and Locatio% An Anal~tlcal Approach. Preatlce-Halt, Inc., New Jersey. Lee, R.C., and J. M. Moore (1967). CORELAP-Computerized Relationship Layout Plannlng. Th_~e Journal of Industrial En~Inearln~, 18, 195-200. Parsael, H. R., and J. S. Morler (1985). Computerized Layout Plannlng. Th_~e Proceedln~s o~ th~ 18th Annual Conference of National Association of Industrial Technology, Terre Ha0te, Indiana,
Parsaei and Galbiati: F a c i l i t i e s planning
335
Parsaei, H. R., and J. S. Morler (1986). An Interactl~e Program Assists Layout Planning. The Proceedln~s of the 3th Annual Conference on Computers and Industrlal En~lneerln~r Orlando~ Florida. Parsael, H. R., aud L. J. Galblatl, III. (1987). Layout Planning and Design with Mlcrocomputers. The Proceeding8 of the Ist Annual Conference on En~Ineerln~ and Manufacturln~ Software, Chicago, Illinois. Seehof, J. M., and W. O. Evans (1967). Automated Layout Design Prograu. The Journal of Industrial En~Ineerln~, 18, 690-695. Tompklns, J. A., and J. A. White (1984). Fac11[ttes Planning. John Wlley and Sons, New York.
NOTE A copy of the program may be obtained by writing to the first author at University of Louisville, Louisville, Kentucky, 40292. Note that It is necessary to acquLre the PC-Scheme LISP Software from Texas Instruments in order to run this program.