Lehigh UniversityLehigh Preserve
Theses and Dissertations
1-1-1983
A simulation model of a robotic assembly line.Chen-Fa Sun
Follow this and additional works at: http://preserve.lehigh.edu/etd
Part of the Industrial Engineering Commons
This Thesis is brought to you for free and open access by Lehigh Preserve. It has been accepted for inclusion in Theses and Dissertations by anauthorized administrator of Lehigh Preserve. For more information, please contact [email protected].
Recommended CitationSun, Chen-Fa, "A simulation model of a robotic assembly line." (1983). Theses and Dissertations. Paper 1934.
brought to you by COREView metadata, citation and similar papers at core.ac.uk
provided by Lehigh University: Lehigh Preserve
A SIMULATION
MODEL OF A ROBOTIC ASSEMBLY LINE
by
Chen-Fa Sun
A Thesis
Presented to the Graduate Faculty
of Lehigh University
in Candidacy for the Degree of
Master of Science
in
Industrial Engineering
Lehigh University
July, 1983
ProQuest Number: EP76207
All rights reserved
INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted.
In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed,
a note will indicate the deletion.
uest
ProQuest EP76207
Published by ProQuest LLC (2015). Copyright of the Dissertation is held by the Author.
All rights reserved. This work is protected against unauthorized copying under Title 17, United States Code
Microform Edition © ProQuest LLC.
ProQuest LLC. 789 East Eisenhower Parkway
P.O. Box 1346 Ann Arbor, Ml 48106-1346
CERTIFICATE OF APPROVAL
This thesis is accepted and approved in partial
fulfillment for the Degree of Master of Science.
Date '
rofessor in Charge
Chairman of Department
11
ACKNOWLEDGEMENTS
I would like to extend my sincere thanks and appreciation
to Dr. John W. Adams for his advice, encouragement, and
guidance in the role of major advisor; and to Dr. Mikel
P. Groover for his support as minor advisor.
In addition, I would like to thank all of the members of
the Industrial Engineering Department at Lehigh University
for making my graduate studies thoroughly worthwhile and
enjoyable.
111
Table of Contents
1. INTRODUCTION 2 2. SYSTEM DEFINITION 5 2.1 Palletizing line 5 2.2 Assembly line 5 3- MODEL BUILDING 7 3.1 Factors affect the system's performance 7 3.2 Performance evaluation • 9 3-3 Model development 10 4. STATISTICAL ANALYSIS OF THE RESULTS 13 5. SIMULATION RESULTS 15 5.1 Probability of having a jam vs. performance 15 5-2 Time needed for solving the jam vs. performance 15 5-3 Processing time vs. performance 16 5-4 Time between successive pallet's arrival vs. performance 16 6. DISCUSSION 17 6.1 Reliability of the results 17 6.2 The time spent in system by the pallets and maximum queue 17
observed 6.3 Robot's utilization 18 6.4 Output of the system 18 7. CONCLUSIONS 19 REFERENCES 21 I. THE APPENDIX 24 1.1 TABLE 24 1.2 FIGURES 38 l.j, SIMULATION PROGRAM 74
VITA 81
IV
ABSTRACT
A Simulation Language for Alternative Modeling (SLAM) computer
program was used to help analyze some important factors arising in
connection with assembly by robot. These factors were used as
parameters in the program and changed individually to obtain
different System's performance. Then the relationships between
system's performance and those parameters were generated by using
statistical methods.
This thesis includes a description of a special assembly
system, model building for this system and discussion of the
results. For each set of parameters, several executions of program
have been made by changing the random number only. The statistical
analysis is all based on these data group.
1. INTRODUCTION
Ln. a conventional assembly system, the assembly activities are
separated into several steps, each step being the placement of a
specific part in the assembly. These steps are assigned to a series
of stations which are operated by either persons or special-purpose
machines. The work proceeds from station to station and finished
assemblies come out of the final station. A manual assembly,
typically has low amount of output, low accuracy, poor repeatability
and poor resistance to errors and fatique. Although the station's
motions can be assigned with more flexibility, this type of assembly
line (operated by humans) is difficult to achieve a high product
quality, high equipment utilization and high production rate. A
special machine, typically a one-of-a-kind device is built to
assemble one product or subassembly for its entire productivity
life. So the station's motions are simple and are fixed to a
pattern. It is therefore difficult to change the machine to
accommodate changes in the product. This type of assembly(operated
by special machines) has limited the flexibility which can not be
changed easily to produce another type of product.
Ln recent years, industrial robots have found practical and
economic application in manufacturing environments performing such
tasks as spot welding, palletizing, paint spraying, machine loading
and unloading, machine-to-machine transfer and material handling
2
tasKs. It can not only be used to do a repetitive operation and
because of its programming ability, also be easily switched to do
another series of operations by unloading and loading different well
prepared programs. By letting these properties to be used in a
batch size multi-product assembly line, it is possible that the
assembly process can be carried to completion at a single station
(which is operated by robot)•[7],[sJ,[l 1],[12] Moreover, we can
provide sufficient stations operating in parallel to attain the
desired production rate. If one assumes that a small percentage of
any assembly job will require manual intervention, then efficient
deployment of lead men at phased parallel stations will allowed the
roving men to proceed logically from station to station to lend a
hand at critical stages of assembly. This system is less sensitive
to production loss due to individual station downtime and has high
product quality, high production rate, low in-process inventory and
is less disruptive to production schedules.
These thesis will discuss some factors which may affect the
performance of an assembly system. A Simulation Language for
Alternative Modeling (SLAW) computer program has been used to
simulate this assembly system. Several factors such as process
time, robot's breakdown rate, the probability of having a jam in
assembly and time needed for solving the jam are treated as
parameters. From the results of simulation program, we can find out
the relationship between the parameters and the system's
3
2. SYSTEM DEFINITION
The first step in the simulation application consisted of
system definition.
2.1 Palletizing line
In the first subsystem, the blank pallet and oriented parts
come in to the palletizing station, then the placer picks up the
part and puts it on the pallet at the proper location. The pallets
are prepared in batches of N, and each pallet contains n different
parts. To prepare a batch of N pallets, the N pallets are
circulated through the placer system n times. On each pass the
placer puts a different part on the pallet, and after a pallet
completes its n-th pass all n parts are on the pallet . When the 11-
th part is placed on the N-th pallet, the entire batch of N pallets
is complete and ready for assembly. The circulating conveyor system
on which the pallets are traveling must be large enough to contain
all N pallets simultaneously. The next batch of blank pallets will
come into the palletizing line and repeat all the operations again.
2.2 Assembly line
In the second subsystem, the assembler picks up the parts from
the pallets and assembles them on a base plate. However, for
certain parts, the assembly operation can not be performed by the
assembler. In this case the base plate will be routed to another
station for special treatment. This treatment can be performed
5
manuaiy or by some special purpose machine. Meanwhile, the
assembler and the pallet in assembly station must wait for the base
plate until it comes back from the other station after completing a
specific operations.
After the base plate is returned, the assembler keeps on
assembling until another special treatment is needed or to the end
of assembly operation. Whenever it reaches the end of assembly
operation, The pallet and base plate will be routed out of the
assembly station and next pallet will come in (if there is a pallet
waiting), or the assembler will be idle.
These two subsystems are connected by a conveyor: from the
output of the first subsystem to the input of the second subsystem.
After completing assembly from assembly station, the blank pallet
will be routed back to palletizing station and the base plate with
final product will be routed to another area for unloading and
inspection. Then the base plate will be routed back to assembly
station again.
When the palletizing and assembly are in progress, there is a
probability that a jam will occur. All jams are removed by a human
operator.
j>. MODEL BUILDING
3.1 Factors affect the system's performance
Among the whole system, the main concern is to find a proper
input which will yield an optimal performance. Some factors which
will affect these values are listed as follow:
1. pallet's input rate
An input rate which is too high does not increase the
performance of the system but would just build up a long
queue which increases cost. An input rate which is lower
than needed would cause the line to be idle more
frequently and the yield will be low.
2. probability of a jam which is caused by improper
orientation of the part or inaccuracy of the robot
The placement of a part is not necessarily successful,
and if not the intervention of a human operator is
required. It is assumed that the probability of failure
is known for each part, say p. for the i-th part.
Morever, when human intervention is required, there is an
additional delay, say d.
3. robot's breakdown rate and repair time
In this assembly system, only the robots are directly
processing the parts. So that the robot's breakdown will
greatly influence the output of the system especially
when the repair time for breakdown comparing to the
process time is significant. In general the repair times
is so significant that it is impossible to treat the
breakdown as a factor in this system. Therefore, the
robot's breakdown is assumed not to occur in the
execution of simulation. In the real world, this effect
can be estimated for the long run.
4. process time for the individual operations
The time required for the placement of each part is
assumed to be known, say t- for the i-th part."
5. the speed of the robot
Ln some caess, the robot's movement can be speeded up.
This will reduce the process time but the probability of
a jam increases.
6. time for pallet to feed into the station and its transfer
times
Pallet transfer time and time for pallet to be fed into
the station will have a great influence to the system's
performance when these times are significant comparing to
the process time. If these times do not appear
significant, it can be treated as constant or just
neglects it(a too small time value used in the simulation
will greatly increase the program's execution time). In
this thesis, all these times are treated as constant.
7. the effect of the batch size
A large batch size will build up a longer queue and will
need a larger circulating conveyor to contain all N
pallets simultaneously. A small batch size will cause
changing robot's program and/or gripper more frequently
and the change-over time will become significant.
3.2 Performance evaluation
The performance of the system is judged by the following:
1. number of product completed(For the assembly station,
pallets completed is the index. For the palletizing
station, parts used is the index).
2. utilization of the robot (percentage of the idle time of
the robot).
$. maximum queue length
4. how muny pallets and base plates are needed to supply the
whole system.
5. total time spend in the system by the pallet.
3.3 Model development
Ln the model developement, all the pallets are treated as
entities.[1j Along with them, several attributes are assigned to
represent their characteristics. These characteristics include the
times that pallet first arrived at both lines, the number of the
parts currently or. the pallet and the process time needed for the
current operation. The process times and the probabilities of
having a jam for all the parts are stored in memory arrays. All the
pallets queuing on the line are grouped into several files and all
the movements of the pallets are treated as activities.
The pallets(entities) arrive at the palletizing line with a
predetermined rate. After arriving at the palletizing line, the
pallet wait for seizing the resources(placer and part) in a waiting
file. When a pallet seizes the placer and part, its attributes are
reviewed, then the process time needed and the probability of having
a jam and the time needed to solved the jam are determined from the
memory arrays. Whenever placing a part on a pallet is completed,
the placer is released and the next pallet comes in(if there ia one
waiting) and seizes the resources again. The original pallet is
10
routed to a checking point(gate) and then will be routed back to
waiting file or out of palletizing line according to the values of
its attributes(to check how many parts already on the pallet).
Before entering the palletizing line, there is another checking
pomt(gate) in which a counter and a setting number( batch size) are
used to prevent more than N pallets from coming into the waiting
file in the same time.
The pallet which carries the parts enters the assembly line
with a predetermined rate. After arriving at the assembly line, the
pallet waits for seizing the resources(assembler and base plate) in
a waiting file. When a pallet seizes the placer and base plate, its
attributes are reviewed, then the process time needed and the
probability of having a jam and the time needed to solved the jam
are determined from the memory arrays. In the same time, another
memory array is also reviewed to determine which steps the special
treatments will be needed. Whenever these steps are reached, the
base plate will be routed to another station for processing and then
be routed back. After assembling a product is completed, the
assembler is released and next pallet comes in(if there is one
waiting) and seizes the resources again. The original pallet is
routed out of the system and will release the base plate after some
time period.
The whole system was then programmed in the SLAM format. The
11
number of operations and the process time for individual operation
could be assigned to any values to simulate different product which
would like to be produced in this system. In the actual execution
of the simulation, the number of operations for assembling a product
is 20 and the average process time is assigned to 8.5 second. The
base plates available at the beginning is assigned to 30.
Acctually, after taken some simulation runs, we found 2 base plates
are enough for the system if there has no time delay between pallet
is routed out and then release the base plate. Approximately 17000
parts were used for each 24-hours simulated period. The time unit
was equal to 1 second.
12
4- STATISTICAL ANALYSIS OF THE RESULTS
Two statistical methods were used to analyse the results of the
simulation.
The first method used is regression. This method can help find
the relationship that exists between the independent variables and
the dependent variable. Two types of model used are listed as
follow:L2j,L3j
1. nonlinear model with exponential relationship
y=abx
2. polynomial regression model
y=bQ+b1x+b2x'l+ "' ' + brx
The second method used is to prove whether the differences existing
between two group of results from different set of parameters. The
equation is listed as follow: [4]
N=Max (n, |(2s2h2)/d*2}+)
where s2-(s2
1 + s22+s2
:5+ +s2k)/k
h: parameter determined by n, p and k
Sj: sample variance of k group
n: number of samples in a group
p: confidence level
d*: preference zone
13
5. SIMULATION RESULTS
5.1 Probability of having a jam vs. performance
Whenever the probability of having a jam increases, the
utilization of the robots in both line decrease linearly.(see fig.
A,B). The output of the palletizing line also decreases
linearly,(fig. F) but the output of the assembly line does not
change siginificantly. The time spent in system by the pallets is
proportional to the square of the probability of having a jam. The
maximum queue observed before the work station has quadratic
relation with the probability of having a jam(fig. C,E,I,D).
5-2 Time needed for solving the jam vs. performance
When the time needed for solving the jam decreases, the
utilization of the robot in the assembly line decreases(fig. p,
linear relationship), but the utilization of robot in the
palletizing line does not change significantly. The output of the
palletizing line increases linearly,(fig. Q) but the output of the
assembly line does not change. The time spent in system by the
pallets (and maximum queue observed before work station) in both
line decrease, and is proportional to the square of the time needed
for solving the jam (fig. U,T,S). With only one exception.(fig. R,
a linear relationship, the pallet's in system time when in
palletizing line)
15
5»3 Processing time vs. performance
When the process time of the operations decreases(from 100^
improves to 70/0, the utilization of the robots in both line
decreases linearly.(fig. W,V) The output of the palletizing line
increases linearly (fig. X), but the output of the assembly line
does not have a significant change. The time spent in system by the
pallets and maximum queue observed before the work station in both
lines decreases and is proportional to the square of the processing
time(fig. Y, Z.YY.ZZ).
5»4 Time between successive pallet's arrival vs. performance
Whenever the time between successive pallet's arrival
decreases, the utilizations of the robots in both line increase
linearly until the 100,2 utilization rate reached.(fig. K,H) The
outputs of these two lines increase and have exponential
relationships(fig. J,U). The time spent in system by the pallets
and the maximum queue observed in both lines decrease with respect
to the change of processing time( cubic relationships).
16
6. DISCUSSION
6.1 Reliability of the results
All the results obtained from the simulation were used to
generate several emprical equations by means of regression.
Accompanied with the equations generated, a correlation coefficient
or a standard deviation has been caculated to make sure the equation
is a good fit. Ail the equations have significantly high
correlation coefficients.
6.2 The time spent in system by the pallets and maximum queue
observed
From the results listed before, whenever the factors changed,
the time spent in system by the pallets always has a similar
variation with the maximum queue observed and all have square or
cubic relationships. This means that these two types of performance
change more quickly than those of factors.
Both lines have a lower bound of the maximum queue observed.
In the assembly line the value is 2. in the palletizing line the
value is 112 which is a little higher than the batch size(lOO) and 2
more higher than the initial value(l10 Was assumed in the
simulation).
17
6-3 Robot's utilization
From the results listed before, The robot's utilization always
changed linearly when factors changed except Vs. the time needed for
solving the jam changed in the palletizing line. In this
exceptional case, the robot's utilization stayed around 100$ which
means that in this palletizing line, the robot is always too busy
and the effect of the time needed for solving the jam is not so
significant to affect it.
6.4 Output of the system
From the results listed before, except under the effectiveness
of changing the time between successive pallet's arrival(exponential
relationship vs. output and has an upper bound), the output of the
palletizing line has a linear relationship with respect to all the
factors. The output of the assembly line does not have a
significant change for all of these cases, and the factors do not
change the production rate of the assembly line. The reason is that
the pallet's input rate is too low to restrict the effectiveness of
the other factors.
18
7. CONCLUSIONS
From the results and disussion listed before, we can conclude
the following:
1. Maximum queue observed and the time spent in the system
by the pallet have simillar variation when the
factors(pallet's input rate, probability of having a jam,
time needed to resolve a jam and processing time)
changed. So, these two types of performance of the
system can be seen as the same index of the performance.
2. The output of these two lines(palletizing line and
assembly line) has an upper bound and this upper bound is
greatly influenced by the pallet's input rate(or time
between successive pallet's arrival). A too low input
rate will reduce the value of this upper bound(certainly
can not yield a high output) and a too high input rate
does not increase the output of the system(because there
is an upper bound). So, an optimal range of the pallet's
input rate which can yield the best performance exists
and can be found(obtain the highest output with the
lowest maxiraun queue observed).
3. Reducing the batch size in the palletizing line will
reduce the length of the circulating conveyor and the in-
19
process iriveritory(the pallets needed are less too). But
a too small batch size will result in excessive change-
over time of the work station and the pallet's
circulating time delay. So, theoretically, there is an
optimal range of the batch size , and this range can not
be found prior some cost informations(cost for pallet,
cost for conveyor, etc.)are obatained.
4. The system1s output is linearly related to the
probability of having a jam, and the time needed to
resolve a jam. Whether or not it is economical to
increase output by reducing the probability of having a
jam is an economic question. That is due the economic
gain from increased output exceed the cost of reducing
the probability of having a jam.
20
REFERENCES
1. Pritsker, A. A. Introduction to Simulation and SLAM.
New York: Halsted Press, 1979-
2. Walpole, R. E. Probability and Statistics for engineers
and scientists. 2nd ed. New York: Macmillan, 1978.
3. Simmons, Donald M. Nonlinear Programming for Operations
Research. N.J.: Prentice-Hall, 1975-
4. Gibbons, Jean D. Selecting and Ordering Populations.
New York: rfiley, 1977-
5. Van cleave, David A. One Big Step For "Assembly In The
Sky." Nov. 1977 Iron Age.
6. Abraham, R. G. State-Of-The-Art Ln Adaptable-Programmable
Assembly Systems. S.M.E. Dearborn, MX. 1977 (technical
Paper MS77-757)
7. Dunne, Macurice J. An Advanced Assembly Robot.
1976, Volume II, Industrial Robots.
8. Nevins, James L. and Whitney, D. E. Computer-Controled
Assembly. Scientific American. Feb. 1978.
21
9. Whitney, Daniel E. and Nevins, J. L. Applying Robots
in Industrial Assembly.
Robotics Research and Advanced Applications, ASME, 1982.
10. Warnecke, H. J., Schweizer, M. and Fraunhofer, H.
An Adaptable Programmable Assembly System Using
Compliance and Visual Feedback. 10th International
Symposium on Industrial Robots Italy, 1980.
11. Martensson, N. and Johansson, C. Subassembly of A
Gearshaft by Industrial Robot. 10 th International
Symposium on Industrial Robots Italy, 1930.
12. Badger, M. A. The Use of The DEA PRAGMA A3000 Robot
in The Assembly of Automative Components.
10th International Symposium on Industrial Robots
Italy, 1980.
1'3« Kohno, M. , Sugijnoto, K., Hatsumoto, Y. and Suzuki, T.
A Robot For Assembling Variety of Mechanical Parts.
10th International Symposium on Industrial Robots
Italy, 1930.
14- Miller, Richard K. Robots in Industry, Applications
For Assembly. SEAI Institute, Madison, GA.
15- Nevins, J. L. and Whitney, D.E. Research on Advancrd
22
Assenmbiy Automation. Computer, December, 1977•
16. K.Feldmann and G.Schillack A Flexible Assembly
System Using Industrial Robots. 8th International
Symposium On Industrial Robots.
25
I. THE APPENDIX
1.1 TABLE
****Palletizing Line****
Table A (probability of having a jam)
.01 .008 .006 .004 .002
1 .0 1.0 • 9917 • 9345 • 9105 1.0 1.0 .9630 • 9294 .9092 1.0 1.0 • 9697 • 9316 • 9072
. 1.0 • 9945 • 9697 • 9384 • 9137 1.0 1.0 • 9697 .9428 • 9137 1.0 1.0 .9398 • 9338 • 9070 1.0 1.0 • 9742 • 9451 • 9114 1.0 • 9985 .9809 • 9339 .9182 1.0 1 .0 • 9397 • 9697 • 9249 1.0 1.0 .9674 • 9339 • 9070
1.0 .99928 .97658 .9394 .91228 : mean * The entry in the table is the utilization
of the robot.
Table B (probability of having a jam)
.01 .008 .006 .004 .002
3079 8519 8942 9025 9049 8607 3491 8946 9025 9025 8476 8633 8862 8890 9025 8497 8834 9000 9000 9049 8476 8683 8834 8946 8973 8456 8792 8918 9000 9025 8668 8770 8390 8890 9000 3254 8328 8917 8946 9000 8159 8778 8831 8890 9025 8437 8820 8890 8918 9025
3410.9 8714.8 8903 8953 9019-6 : mean * The entry in the table is the the number
of parts used in the palletizing line.
24
****Palletizing Line****
Table C (probability of having a jam) .01 .008 .006 .004 .002
28200 25990 25540 23940 23310 26840 26280 24500 23720 23630 27410 26200 24980 23910 23430 27480 .26380 24300 24160 23420 27170 26000 24630 24170 23370 27060 26590 25630 23900 23440 26820 25480 24940 24040 23440 28060 27000 25530 24080 23320 28470 27440 26360 25200 23340 27950 26750 24820 23960 23470
27544 26411 25178 24108 23417 : mean * The entry in the table is the time spend in
the system by the pallet.
Table D (probability of having a jam)
.01 .008 .006 .004 .002
140 121 114 112 112 * The entry in the table is the maximum queue
observed.
25
****Assembly Line****
Table E (probability of having a jam)
.01 .008 .006 .004 .002
• 9422 • 9418 • 9157 • 9087 .8929 .9365 • 9416 .9097 • 9187 • 8967 • 9494 • 9143 .9201 • 9065 • 9006 • 9552 • 9412 • 9182 • 9009 .3948 • 9545 .9260 • 9331 • 9104 .8937 • 9513 • 9279 • 9279 • 9065 .8909 • 9338 • 9401 • 9139 • 9123 .8987 .9410 .9181 • 9221 • 9123 .8928 • 9572 • 9357 • 9103 • 9026 .8909 • 9260 • 9107 .9104 • 9045 .8948
•94471 .92974 .91814 -90831 .89518 * The entry in the table is the utilization
of the robot.
mean
Table F (probability of having a jam)
.01 .008 .006 .004 .002
432 436 431 432 432 435 437 436 436 437 437 437 437 437 437 437 435 437 436 437 436 437 436 437 437 437 437 437 437 437 437 436 435 437 437 436 436 437 437 437 437 437 436 437 437 437 432 437 437 437
436.1 436 435.9 436.3 436.5 : mean * The entry in the table is the products completed
26
****Assembly Line****
Table G (probability of having a jam)
.01 .008 .006 .004 .002
254-1 201.3 206.2 200.6 185-2 242 230.3 201.1 222.2 184 513.4 216.5 21.7-3 193.2 183-6 283-4 251-7 228.1 192.9 1.88.5 297-2 236.2 226.9 202.9 18t .9 266.7 222.3 223-9 201.5 1,89-9 237-5 260.6 208.4 201 185.9 245-4 216.5 214-5 208.7 193.6 297.2 275-9 193.5 193.5 186.9 236.8 253-3 205-7 193-5 185-8
267-37 236.46 213-1 200-75 186-53 : mean * The entry in the table is the time spend in
the system by the pallet.
Table H (probability of having a jam)
.01 .008 .006 .004 .002
5 4 3 2 2 * The entry in the table is the maximum queue
observed.
27
****Palletizing Line****
Table I (time needed for solving the jam) 200 180 160 140
1.0 1.0 1 .0 1 .0 1.0 1.0 1.0 • 9397 1.0 1.0 1.0 1 .0 1.0 1.0 1.0 • 9772 1.0 1.0 1.0 • 9365 1.0 1.0 1.0 • 9944 1..0 • 9933 1.0 • 9303 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0 1.0
1.0 .99983 1.0 .99272 : mean * The entry in the table is the utilization
of the robot.
Table J (time needed for solving the jam) 200 180 160 140
3079 8324 8550 8844 3607 8614 8353 8950 8476 8594 8751 3773 8497 8701 8768 891 1 8476 3595 3763 8333 8456 8594 8768 8930 8668 3763 8863 8891 8254 8406 8550 8772 8153 8333 8662 8769 3437 8424 8568 8891
8410.8 8540.4 8710.1 8356.4 : mean * The entry in the table is the the number
of parts used in the palletizing line.
28
****Palletizing Line****
Table K (time needed for solving the jam) 200 180 160 140
28200 27670 26660 25890 26840 26810 26150 25600 27410 26930 26710 26170 27480 26530 26450 25200 27170 26850 26380 25570 27060 26710 26360 25770 26820 26180 25470 25130 23060 27530 27390 26400 28470 27410 27140 26360 27930 27320 26710 261.60
27544 26999 26542 25825 : mean * The entry in the table is the time spend in
the system by the pallet.
Table L (time needed for solving the jam) 200 180 160 140
132 125 121 118 * The entry in the table is the maximum queue
observed.
29
****Assembly Line****
Table M (time ne eded for solving the jam) 200 180 160 140
• 9422 • 9304 .9203 .9221 • 9365 • 9340 .9193 • 9305 • 9494 • 9246 • 9405 .9278 • 9552 • 9332 .9298 .9242 • 9545 .9280 .9358 • 9116 • 9515 • 9194 • 9149 • 9101 • 9538 • 9463 • 9313 •9191 • 9410 • 9345 .9223 .9116 •9572 • • 9325 • 9273 • 9267 • 9260 • 9332 • 9294 • 9217
•94471 .93161 .92809 .92054 : mean * The entry in the table is the utilization
of the robot.
Table N (time needed for solving the jam) 200 180 160 140
432 431 431 432 435 436 437 437 437 437 436 436 437 437 437 437 436 437 437 437 437 437 437 436 437 435 437 437 436 435 437 437 437 436 437 437 437 437 436 437
436.1 435.5 436.2 436.3 : mean * The entry in the table is the products completed
30
****Assembly Line****
Table 0 (time needed for solving the jam) 200 180 160 140
254.1 229-5 209-9 206.7 242 229-6 205-2 217-5 313-4 218.8 237-1 203.2 283-4 235-5 218.8 205-9 297-2 230.1 230.3 193.0 266.7 205-4 199.8 193.5 237-5 238.3 212.8 200.7 245-4 233 208.8 193.2 297-2 229-7 221.9 209.7 236.8 240.9 213.7 204
267-37 229-08 215-83 203-74 * The entry in the table is the time spend in
the system by the pallet.
Table P (time needed for solving the jam) 200 180 160 140
5 3 2 2 * The entry in the table is the maximum queue
observed.
31
Table y ****Palletizing Line**** ****Assembly Line****
(ratio of process time) •8 .7 -9 .8
•93969 .92428 .88524 -mean- .8869 .80417 * The entry in the table is the utilization
of the robot.
.7
1.0 • 9294 • 8833 •8985 • 7836 .7252 • 9791 • 9189 • 8775 .8877 • 7965 .7008 1.0 • 9281 • 8739 .8712 .8058 • 7437
• 9621 • 8950 .8757 .8992 .8265 .7281 • 9355 •9285 .9027 .8658 • 7948 • 7295 • 9836 .9022 .8776 .8878 .7938 • 7276 1. • 9300 .8805 • 8765 .8224 • 7333 1. • 9385 .9013 .8974 • 7992 .7113
• 9386 • 9469 .8813 • 9017 .8087 • 7467 1.0 • 9253 .8968 .8832 .8004 .7275
.72737
Table H (ratio of process time)
• 9 .8 • 7 •9 .8 .7
3970 9177 9366 443 443 442 9146 9270 9396 443 448 448 9118 9296 9511 448 448 443 9162 9324 9525 448 448 448 9084 9199 9497 448 448 448 9251 9331 9428 448 448 448 9176 9307 9304 448 448 448 8975 9312 9V60 448 448 448 3939 9237 9367 448 448 448 9105 9187 9509 447 448 447
9092.6 9269 9406.3 -mean- 447-4 447.6 447.3 * The entry in the left table is the number of
parts used in the palletizing line. The entry in the right table is the products completed in the assembly line.
32
Table 3 ****Palletizing Line**** ****Assembly Line****
(ratio of process time) • 9 .8 • 7 • 9 .8 -7
251JQ 23310 22230 219-1 170.9 155-7 24490 251-20 22050 206.2 170.5 144-5 25500 23070 22180 1-92.2 177.1 166.7 24240 22610 221.90 224-2 194-0 158.1 24640 23310 22410 187-6 170.1 155-6 24750 22550 22090 202.2 1-75-5 1-56.6 25190 23520 22340 196-9 189-8 159-8 26000 25610 22760 216-9 171-8 148.0 25930 25720 22290 255-1 180.7 162.8 256.3 25060 22540 206 175-5 155-1
25215 25166 22288 -mean- 208-65 177-37 156.27 * The entry in the table is the time spend in
the system by the pallet.
Table T (ratio of process time)
-9 -3 -7 -9 -7
1-21 112 112 3 3 2 * The entry in the table is the maximum queue
observed.
33
****Palletizing Line****
Table U (time between successive pallet's arrivals)
250 230 215 200 197 194 190 180
.88343 .93019 -97854 1-0 1.0 1.0 1.0 -mean-
* The entry in the table is the utilization of the robot.
1-0
170
.8823 • 9458 • 9904 1.0 1.0 1.0 1.0 1.0 1.0
.8925 • 9284 • 9591 1.0 1-0 1.0 1.0 1.0 1-0
.8791 •9352 • 9860 1.0 1.0 1.0 1.0 1.0 1.0
.8768 •9150 • 9614 1-0 1-0 1.0 1.0 1-0 1.0
.8679 .9061 • 961.4 1.0 1.0 1.0 1.0 1.0 1.0
.8746 • 9240 • 972 5 1-0 1.0 1.0 1-0 1.0 1.0
.3836 .9262 • 9546 1.0 1.0 1.0 1.0 1.0 1.0
.3656 • 9329 1.0 1-0 1.0 1-0 1.0 1.0 1.0 • 9059 .9486 1.0 1-0 1.0 1.0 1-0 1.0 1.0 .9060 .9397 1.0 1.0 1.0 1-0 1.0 1.0 1 .0
1.0
Table V (time between successive pallet's arrivals)
250 230 215 200 197 194 190 180 170
7450 7366 8224 8079 8353 8125 8101 8230 8304 7518 7866 8273 8607 8634 8583 8533 8634 8542 7428 7866 8282 8476 8477 8417 8393 8457 8498 7497 7866 8273 8497 8641 8584 8540 3542 8563 7540 7866 8224 8476 8584 8584 8540 3541 8438 7401 7366 8231 8456 8418 8456 8540 8477 8457 7450 7866 8347 8668 8748 8632 3703 8657 8715 7475 7866 8156 8254 8161 8231 8159 3133 8329 7355 7366 8182 8159 8116 8254 8159 8116 8231 7454 7866 8207 3437 8232 8417 8352 8399 8438
7456.8 7866 3239.9 8410.9 3436.4 8428.3 8407.5 8424.18451.5 -mean-
* The entry in the table is the the number of parts used in the palletizing line.
34
■■"•Palletizing Line****
Table W (time between successive pallet's arrivals)
250 230 215 200 197 194 190 180 170
26820 27330 28200 28200 27600 28070 28400 28330 28580 26860 26960 27380 26840 27060 27510 27560 27960 28170 26000 26980 28070 27410 27670 27840 28170 28190 28450 25940 26590 26220 27480 26820 27300 27600 27800 28020 25930 26440 26630 27170 27480 26820 27040 27860 28510 26030 26720 26150 27060 27450 27160 27060 27970 28460 26300 26910 26350 26820 26730 27380 27420 27700 27960 25790 26840 26920 28060 28480 27850 28770 29280 29160 27120 27240 26240 28470 28520 28190 28500 26250 29080 27210 26900 27320 27930 27640 27850 27970 28330 29050
26405 26890 26948 27544 27545 27597 27849 27967 28544 -mean-
* The entry in the table is the time spend in the system by the pallet.
Table X (time between successive pallet's arrivals)
250 230 215 200 197 194 190 180 170
112 113 118 132 138 139 149 1>75 190 * The entry in the table is the maximum queue
observed.
35
****Assembly Line****
Table Y (time between successive pallet's arrivals)
250 230 215 200 197 194 190 180 170
.7657 .3068 .8304 • 9422 .9625 • 9637 • 9914 • 9999 1.0 • 7573 .8144 .8779 .9365 • 9620 .9651 • 9309 • 9999 1 .0 • 7436 .8105 .8742 • 9494 .9630 • 9589 • 9937 1.0 1.0 .7846 .8215 .8755 • 9552 • 9663 • 9718 • 9914 .9983 1.0 • 7553 . 8203 .8649 • 9545 • 9435 • 9573 • 9942 • 9999 1.0 .7528 .8125 .8801 .9513 • 9454 • 9593 • 9943 • 9999 1.0 • 7534 .8027 .8566 • 9338 • 9538 • 9739 • 9945 • 9994 1.0 .7280 • 8398 .8677 .9410 • 9744 • 9719 • 9941 1.0 1 .0 • 7601 .8300 .8742 • 9572 • 9474 • 9833 • 9959 • 9990 1.0 • 7556 .8393 .8644 .9260 • 9474 • 9712 • 9339 • 9989 1 .0
.75564 .81983 -87159 -94471 -95657 -96764 .99143 -99962 -mean-
* The entry in the table is the utilization of the robot.
1 .0
Table Z (time between successive pallet's arrivals)
250 230 215 200 V97 194 190 180
348.6 379.5 405.6 436.1 442.2 448.6 456 463 -mean-
* The entry in the table is the products completed
1.70
345 376 402 432 438 445 451 457 458 349 380 406 435 443 450 455 460 458 349 380 406 437 443 450 453 467 463 349 379 406 437 442 449 458 463 460 349 380 405 436 443 448 459 464 471 349 380 406 437 443 450 459 457 469 349 380 406 437 441 448 454 469 461 349 380 406 436 443 450 456 463 459 349 380 406 437 443 449 457 461 458 349 380 406 437 443 447 458 469 461
462.3
36
****Assembly Line****
Table XX (time between successive pallet's arrivals)
250 230 215 200 197 194 190 180 170
206.5 198.2 223.2 254-1 304.8 306.8 549-2 2293 4439 193.9 199-2 220 242 306.3 331-6 359-7 2678 4553 192.2 198.7 215.3 313.4 337-2 246.2 633-2 1821 3896 214.2 206.2 220.9 283-4 356.9 317-1 463-2 2309 5369 197-9 203-2 206.8 297-2 235 264-3 447-5 2264 3785 193.2 199-2 218.1 266-7 237.7 317 443.1 3352 3950 197-7 193-3 199-2 245-4 309.3 316.7 413.9 2625 4112 186 216.3 209.1 237.5 281.1 311-3 844-8 1479 4713 201.6 209 217-2 297-2 309.3 576.2 777-3 2718 4647 192 205-1 203-7 236.8 255-9 332-3 404.6 1362 4112
193.52 182.35 213.35 267-37 288.22 332 533-65 2290 4396 -mean-
* The entry in the table is the t ime spe md in the system by the pallet.
Table U (time between successive pallet's arrivals)
250 230 215 200 197 194 190 V30 170
22 3 54 6 9 29 56 * The entry in the table is the maximum queue
observed.
37
Flowchart:
f START J
PARTS AND PALLETS COMMING
YES
PLACER PLACING THE PART ON PALLET
WAIT
L .
WAIT
1
WAIT
0
39
0 PARTN
^JAM?
NO
FREE THE
PLACER
ADJUST THE INDEX OF PALLET
.IBS-
COLLECT NECESSARY
DATA
OPERATOR SOLVES THE
JAM
WAIT UNTIL ALL 3ATCH DONE THE SAME MOTION
0
-r
( END ~\
40
C STAHT J
PALLET
COMMING
YES WAIT
'ASSEM- \ N0 ^3LER AVAIL^-11^
VABLE> WAIT
WAIT
ROUTE TO ANOTHER STATION
i PROCESS
BACK TO ASSEMBLY STATION
41
0 ASSEMBLY
NO
'JAM OCCURS ?
NO
YES
COLLECT NECESSARY
DATA
FREE THE ASSEMBLER
OPERATOR SOLVES THE
JAM
f END ^
42
Z£7- 3< \XX(8) ATRIB('0=TN( w) ^6 ASMBY J *(? PLLET ATRIB(3) =
BYE P <l>
tx> ARMRY INT (I ) TIME IN fleiMRV
DATA >
XX(IO) YI7
XX(9)
CYCLE
PLLET T
DONE
J VW-
170.
XX(12) PARTS
XX(2)
CASE
VM USERF(7)
ASMBY > USERF(8) ASMBY y
RESOURCE GATE
PLCER(l) h 2 IN OPEN 1 ASMBY(l) 8 6 OUT CLOSE 3 PLLETHO) 7 PARTS(0) 5
Fig. A
Palletizing Line
time between successive pallets in i 200 seconds time needed for solving the jam : 200 seconds no robot breakdown
o o
EQ.i Y=.8823+1^.91X
correlation coefficient: .9961
o m o or
o o
l I 1 •020 .030 .040 .050
JAM PR0BA.
.060 • 070 ■080X10
46
Fig. B
Assembly Line
time between successive pallets in : 200 seconds time needed for solving the jam : 200 seconds no robot breakdown
o EQ. t Y=.3331+6.025X
correlation coefficient: .9977
o CE O or
o
• 020 011 04? I
060 C73 08? icc<;
47
Fig. C
Assembly Line
time needed for solving the jam i 200 seconds time between successive pallets in t 200 seconds no robot breakdown
X o o o
o o o
EQ.J 183.82+357.36x+792678.6xi
S.D.: 7.152
o o o
o o o
o a o
3 o
C3 C3
■ C2C 047 C6C
'AM PP.GSA.
073 087 ICC'OC
48
o o
Fig. D
Palletizing Line
time between successive pallets in time needed for solving the jam no robot breakdown
200 seconds 200 seconds
o o
o o
EQ.j Y=22688.+303500.X+18696^00.X2
S.D.: 107.18
• 1:; ■, <;!
49
Fig. E
Assembly Line
time needed for solving the jam : 200 seconds time between successive pallets in : 200 seconds no robot breakdown
o o o
Y=-l6.637-9257.9X+.3282*107X2
ID O
X
50
Fig. F
Palletizing Line
time between successive pallets in : 200 seconds time needed for solving the jam ! 200 seconds no robot breakdown
EQ.: Y=9237.-72780.X
correlation coefficient: -O.938
C/3
a.
51
MC80DEX CORRECTION SINK (M-9)
CORRECTION The preceding document has been re- photographed to assure legibility and its image appears immediately hereafter.
OWCi «V«TIM« OMAN
Fig. E
Assembly Line
time needed for solving the jam : 200 seconds time between successive pallets in : 200 seconds no robot breakdown
o o
EQ: Y=-l6.687-9257.9X+.3282*107X2
o a a
o o o
CM x ■<:
ST
c S3
.2C :.'j
1
'AM pRC?A
cr USf I C0'<1 !
50
WC80DEX CORRECTION 6WK (M-9)
CORRECTION The preceding document has been re- photographed to assure legibility and its image appears immediately hereafter.
MMMMOTQN RAIVD 0*»*Ca «V«TSM« OTV1MON
Fig. A
Palletizing Line
time between successive pallets time needed for solving the jam no robot breakdown
s 200 seconds i 200 seconds
o CM o
o o o
EQ. : Y=.8823+1^.91X
correlation coefficient: .9961
o to
a CD a
a o 01
i i I •020 .030 .040 .050
JAM P.ROBA.
.060 .070 .080X10
46
.900 .920
ROBOT UT1•
.940 .960 .980 1 .000 I .020
o o 1 l-f CD hi H t) P a
<+ a.
t-" O K 3 II
o m o no CD i\> H| V.J >-•> + I-" H* O ^ H' > ID vr> 3 H* c+ X
*0 vi) CA
3 C+ C+ 0 l-'.H'.
S 3 1 CD (I) o cr 3 o-
0 ID m «+ (0 c+
Cf CD CD 1 P. CD (0 3 P> M> «" O M O. >1 C O O £ M " 3 O CD
MM <: tn
3 <i at) CD
3- pi CD H-
M M O O O O
in U] CD CD o o <> o 3 3 a. o- C/l M
Pi
CD ct H- N H- 3 m
(-" 3
cm
Fig. B
Assembly Line
time between successive pallets in : 200 seconds time needed for solving the jam ■■ 200 seconds no robot breakdown
o T
EQ.: y=.3331+6.025X
correlation coefficient: .9977
o
o or
c en
.020 047 060
'AM poC° \ ■
C73 08? 1CG'<; C
47
ROBOT UT1•
8flu . 3110 .910 • 320 .030 .540 .350
—1
n 0 r>
( i a- 'ii o
I I I 1 I
\ o \ o \ 1 \ 1 W \ " O \ i-* ■
\ P> •< \ ■+ \ H' « \ o II \ 3
■ \ CU \ o co \ o <-) \ IB H1
\ H + \ h^ o> \ H* ■
\ o o \ 1J- M \ <® Ol \ 3 >•) \ rt \ \ v° \ O \ "^ \ ~°
3 C+ t+ 0 h- h"
3 a 1 CD CD O O- 3 o- O (0 (0 <+ CD <+
O.S O" CD CD i a co CD 3
R'Oll p. T t: o o S no 3 O CD
(-• 01 <J 01 H' H' 3 <!
(Jt) CD
rl-T) 3- pi CD H-*
C-i. CD (U c+ 3 CJ)
M M O O O O
C/l in CD CD Cl O Cl O 3 3 p. a <n 01
M CD 3
3 CD
Fig. C
Assembly Line
time needed for solving the jam i. 200 seconds time between successive pallets in t 200 seconds no robot breakdown
o o
EQ.i 183.82+357.36X+792678.6X':
S.D.: 7.152
a a a
a a o
UJ
3 o o
■ C?X a: 047 .C6G
• 'AM P.RCBA .
373 087 IGC'OC
48
TME IN SYS
IH.UUU 20.000 2 Si.OOO
CD .0 O
JO.000X10
J
m <D
(/} ■'
* H* n 00
U)
CO -v) N • + i-» VJ Vn V_n to ^j
VJ ON X + -o vO ro ON -v> CD
Ox X
N
3 <+ €+ O H H-
B H 1 ID ID o crcr 3 o n> (D <+ c+ IS * P. O- (B IS 1 ID a IS 3 ID "i pr en o o. c 1 o o >■■ « U) 3 (D o
U) t-1
(A <i 1— H- < 3 IS U<)
•rf rl- l» 3" t-* IB H- IB C_l. c+ P Ul 3
IO W O O O O
10 (/) IB IB O O d O 3 3 O. Q. u> Ul
> Dl !/] IB a a-
mi
Fig. D
Palletizing Line
time between successive pallets in time needed for solving the jam no robot breakdown
200 seconds 200 seconds
o o
a
o 2 r-
EQ.s Y=22688.+303500.X+18696^00.X2
S.D.: 107.18
■ C20 033 IX." . C6C 073 C87 1 :;, < i
49
IMF. IN yy:,
2:1..to
O
O u
24 ftOO 25.7 00 _l _j
27 . 300 _l
o
X) .0 O Ul
.'&■100X10 -I
o -)
00
II
to ON co 00
o
o o
+ *-* CD Os SO ON
o o t~i
w
3 i+ rt- 0 H- H-
g a 1 IB IB
' O era o- 0 IB ID
0- fe- el'IB ID ^ IX ID IB 3 01 H, !Y O (/) p.1 c o o s w o 3 O ID
h-* 0] < 01 h" H- 3 <;
01) IB
cl-'O 3- a) ID H*
M :_i ID m <-t 3 01
w to o o o o 01 oi ID ID o () o O 3 3 P. o. Ul (0
3
t-< 3
cm
Fig. E
Assembly Line
time needed for solving the jam : 200 seconds time between successive pallets in : 200 seconds no robot breakdown
a
o
EQ: Y=-l6.687-9257.9X+.3282*107X2
50
MAX OUt'.Ub".
0-000 8.000
o
4b.000X10 I
H) o 1
3 rt rt 0 !-•■[-••
s a 1 n> ro o cf o" 3 0 ra m rt c-t (0
£ P- C n> ra 1 ID p. (D 3
!V CD o. c o o inn 3 ra o
ui M co ^ H- f < 3 ra oq
•a rt cu 3- t-" ro >-• (D c. rt 01 CO a
M rj o o o o b) CO ID (D n O o o 3 3 o. a u CO
CO to ra B
3
(K)
Fig. F
Palletizing Line
8™ n^deTfoTsofS S1^ ^ ' S22 SeCOndS
no robot breakdown 200 seconds
o o o
EQ.: Y=9237.-72780.X
correlation coefficient: -O.938
CO 3
■ 1 C C < I c
51
PARTS USED
H5.000
o a
o .o o
86.000
_l
H7-000 _l
88.000
_l
HO.000
_1
no.ooo 91 .000X10
_l
3 c+ cf C h- H-
a H 1 in 11) a cr 3 ri- o ID ii) rr ID rt
p. >■ cr <D ID 1 D. ID IB 3 (U >•> :v o 0) p. i c. o o 3" </)
O o CD
H* HI < M H- H' 3 W ID
cf'd 3- |U (0 (-•
t\) M O O O O
(!) in ID ID (> o () o 3 3 a. a Ul Cfl
ID c+
3 (Ji)
3
(K)
o o
in
< a
Fig. G
Palletizing Line
probability to have a jam occured : .01 time needed for solving the jam s 200 seconds no robot breakdown
EQ.iY=8450.(1.-2.395*10"5*e,029X)
correlation coefficients .906
13 667 ;:<io
iNPUT M^E
52
pARf.S USFD
HI .1,00
IV)
rn
8 •1.1,00X10 I
3 ct-'a 0 H->1
3 o 1 (0 cr o (U cr 3 o" o m I-" ct ID »-• a (•-• o" (D ch
ID P> "l ef WOO P. 1 O ET S tn pi 3 O s'
(-• ID
M« IU 3
I?)
SB ID
o c-i. O p o a i:
1 ID a.
tv) • o o o >--
3 a in
3 im
(XI
Fig. H
Assembly Line
probability to have a jam occured : .01 time needed for solving the jam : 200 seconds no robot breakdown
EQ: Y=1.733-3-9^6*lO"3X correlation coefficient: -.9962
o a
o a. a or
o
f ~ is c:-: 2ECCC 23 ooo 24-c::.
INPi:T r i "i£
25 U0L
53
J.
7 01)
RORO! UT
■ a';o ■ OOO . o.*.o 1 1 1 1 1
W O
Ki II
/ o H* ' o •
1 -vj ►1 U) ID l-J (-• 1 |U Ul rt ■
H' vO O ^ 3 * O t-> O o It) 1 Mi U) H X P-
/ o I-"
/ CD 3 / rt
/ •■
/ t 1
/ / *o vO / ON / M / / / /
/' / / /
I . 000 I
3 i+'O O (-• M
y n 1 ID rr u (a <T a <T O ID H' ct 01 h-'
p. »-• & ID 1 o.^ ID U> Hi it- ?r o O o. '1 o y
s 1/1 O
|U
H (0 N H- u> n m
§g
o o O (-*
3 a
to 01 ID a
Fig. I
Assembly Line
time needed for solving the jam : 200 seconds time between successive pallets in s 200 seconds no robot breakdown
o a
a o o
EQ.: Y=1.8-28.57X+3571^3X£
S.D.: .23905
uJ r> UJ •D a x r
2
. C2C C3_' Ci? C6C
'AM PRCPA .
cr3 087 l-X'KiC
54
I . 000 . atjci J.6U0
MAX OUEUE
3.4 00
4^ a
.a O n
. HOO
3rtrt O (-■■ >-■•
3 3 ►iron) o era- 3 0 (o n> c+ c+ fl> _S a □* CD (D 1 10 O. (D 3 (0 hi, W M O a c i o o 5 o co 3 n> o
</) K" H <J H- H- < 3 IB (Jl)
•a c+ pi 3-
(D C-i.
U 3
3
to t\> O O O O
M W ro in o o o o 3 3 p. a u> en
> to n> 3 zf H
tm
Fig. . J
'Assembly Line
probability to have a jam occured s .01 time needed for solving the jam i 200 seconds no robot breakdown
a o EQ.: Y=465.(l.-8.8iJ.no"7*e,0529X)
correlation coefficient: ,9204
o a
o a o OS a.
17.000 13-J33 19.C57 21.000 ?.l ■ iil
INPUT T i ME
i3-CC7 2S.000*10
55
PRODCT DON
23.000 ;?.ooo
"0 c
3. m
31.000 35.000 1_
39.000 -L.
A? . 000X10 .1
3 rt->d 0 H-1 a o
1 ro cr o m O (D H- c+ (0 (-•
P. p. o" n> c+ >1 P-<<; (D (U ^ ,f rV O O O. 1 o 2r g 01 P) 3 o <
<; pi 3
(0
jn>
o o
3 a
> 01 01 IB a
g iw
o
Fig. K .
Palletizing Line
probability to have a jam ocoured : .01 time needed for solving the jam i 200 seconds no robot breakdown
o o
o o o
EQi Y=1.^83-2.1*2*10"3X
correlation coefficient: -0.992
a CD o or
o
20-000 I
i0-e.fi 21 22.650
INPUT TIME
-T3J ; 4. o i.' —i
25. J00X10
56
ROBOT UTI
800 • 840 .880 .920 .960 1 .000 I -040
NJ1
c
2. m
o 1
CD (-" •• P ■+ t->. H;
O II 3 »-* o V o oo (0 U) H, i Ml to H- O ■p- h" to (D * 3 H* c+ O
" loJ 1 X. O
VO >o to
3 c+hd O M ■1
S O 1 ro a* o P C3-3 cr O fD H- t+ (0 I-"
Q. p. O* (D c+ 1 as ra PI H, C(. (v o o p. n o 3" £ "1 (U 3 O <
H1 ro <! H- CD 3 (ft
§s
o o O M
IB
3 P.
t+ H- N
3 (X)
3 (B
PS
Fig. L
Assembly Line
probability to have a ''jam occured : .01 time between successive pallets in : 200 seconds no .robot breakdown
o X o
EQ. i Y=388i)-62.2-5253.5X+23.59X2-.035X2
S.D.: 198.51
UJ SI
I 7-000 <:S.000'<1 0
INPUT TiME
57
i3.000
W O - " K II ^
w 00 ■ oo a *■ * ON •• to
H» to ^5 1 00 U* • to Ul Ul h» VJ
Ui « + to <J
u> M3
to 1
o VJ U\ X
to
Gl.000X10 I
0 H- i • S o 1 n> a* o pi fftfo- 0 ID H-
cra> rt 1 ID v; ro 3 P c+ tr i/i o p. c o o 3"
to • o o o i-
3 a in
> to 01
t/1 ID 3 0) cr H- H) M < «< (D '.
•a pi P 3 3 !-■ ID I-- o ID O i+ O (/] c
1
w
Fig. M
Assembly Line
probability to have a jam occured : .01 •time needed for solving the jam : 200 no robot breakdown
seconds
EQ.i Y= i)-6^3.0-62.5x+.2?9962X2-4.l7*10'i;X3
S.D.j 3-0231
LLl
LLl
X
r
17.000 lg.J3J 19.CB? 21.000 iZ-iSl
INPUT TI ME
ii-ce.7 ■000XI0
53
MAX OUEUE
o.ooo 4.000
.2
c
m
12.000X10 I
n </) ■
n K
•■ II
VJ £- ■ (T\ o ^~ M >*J K.) • H* o
ON w v_n X + M ^1 \o VO <J\
VJ
3 <+>d 0 H'l
a o 1 (B cr o pi o* 3 o- o ro H- ctlt H d p. O- ID rt- i-i as* ro pi «-» <+ woo Q. 1 O ST f »U 3 o <;
3 cm
£3 is o
C-J. O (u o 3 C
1 ID
IV) • O O O i-»
3 p.
> 01 in a> 3 a"
3 ro
mi
Fig. N
Palletizing Line
probability to have a jam occured i .01 time needed for solving the jam s 200 seconds no robot breakdown
a o
EQ.: Y=59396.7U-38I.882X+1.55353X2-2.219*10"V
to >- to
UJ
£1-30C
i.NPUf T I ME
. GCO.'OO
59
TME IN SY!
,.'(>. JOO V!6. _1_
'00 _t_
100 2( ■ SOO ^7.noo _J
28.J00 _l_
NJ1
fl"
m
ys.rooxio _l
a <+'d U H 1
H o i m IT o P tr 3 <r o (0 H- c+ <D M
a. *-•• o- ro r+ 1 u-S' ID w K> C+ w O o a. i o 3"
§ <fl o < K-(D < H- IU 3
U<)
c ►1 ID a
to • o o o I-1
in ro o o 3 o. u
c+ h" N h" 3 m
i-» 3 ID
Fig.
Palletizing Line
tftl^n11^? *° haVe a Jam °«ured , .01 time needed for solvine the iam . inn no robot breakdown J 2°° seconds
o o
EQ. : Y=1586.if26-15.075X+.0iJ-839X2-4.7*l0"5X3
o o o
a o UJ o
o o o
a o o
~i 1 1 1—: 17.000 18.J33 19.06? 21.000
INPUT TIME
—1 1
IZ-iSi <!3.C';.- 25.000X10
60
MAX QUEUE
10.000
o
22-000X10
1 o
3 o ro □*
P era o- O (D H. c+ ro (->
(X h" 0"(t) i+
ID
X o o ci O 3- £1111 3 o <
I—ro < 3
im <+ (U Era (D
o «-*. o
gg 1 ro
o o OH
3 a. in
p !-■ T) M H- (I) <m c+ H- N
B- o 0>)
IT" h" 3
o
o CD a or
Fig.. P
Assembly Line
probability to have a jam occured : .01 time between successive pallets in i 200 seconds no robot breakdown
EQ.i Y=.8667+3.8*1O'^X
correlation coefficient: .972
1 1 1 14.000 iS-OOO i6-000 17.000
JAM TIME
iS.QOO
1
i n . "1
'.0.300X10
61
ROBOT UT1. <1|0 • ni a
.958
o W o £) 4 ►1 ,. ID (-■ K PI II e+ ■
I-" CD O CK 3 0\
-vl o + o VuJ ID « M, CO H, * H- H* O o H- 1 IB £- 3 X c+
Co ^3 l\>
3 d-^d 0 H'M
3 o 1 ro o" o pi c o* o- O (D p*
_ *' •- O-ID <+ 't ID •<; ID 3
Jv en o o-c o o 3- g O P 3 0 <;
(A ID CD
< ID
C_i. •a w P § H* Mo ID o <+ o w c HMO 3 a
o o o l-»
10 ID o o 3 p.
> CO CO ID B 0' ►a H >-•• «< im
£ 3 *ti ID
Fig. Q
Palletizing Line
probability to have a jam occured , 01 time between successive pallet^ no .robot breakdown »*^exs in i 200 seconds
o o
EQ.i Y=9909-95-7.5325X
Correlation coefficient! .9988
CO
3
or 0.
il.OOO 13.000 io.OOO i7.000
JAM T i ME
i s.000 i 3-000 •:o. 000x10
62
PARTS USF.D
H4.000 8 4.HOO H5.GOO I
CT> IV)
88.R00XI0 J
o m o ii ►1 - i-( •• n> H X P II r+ vj> H- vn O o 3 vo
o vo o Vn (D 1 Hi -M H, ■
H- vn O V.) H- M (D Vn 3 * (+
vn v<> m CD
3 eft) O (-■• 1
. a o >i m o" o pi o" o" o' 0 (B H- ct c+ t-1
< M-
1 (0 << ro 3 [» ■+ rf 0) O ft c O o 3" S o P 3 (D ^
to ra U) hi. Ill <
•a w
(B o <•+ O (/) f.
1 H- m 3 a •• - to . O O O »-»
U) (0 r> (i 3 ft ID
p
h" 3
(X)
h" 3
Fig. R
Palletizing Line
probability to have a jam occured i .01 time between successive pallets in : 200 seconds no .robot breakdown
o o
00
EQ.s Y=21955.6+28.07X
S.D.: 28.0?
:c"<io
63
TME IN SYS
iS.HOO
rn
3 r+>tf o M ►1
. 9 o 1 m rr o 1U o- o* o- O 0) H- t+ t+ (-• * h" O* (I) r+ i m <<; as 3 P r+ ?r 01 O M. C1 o o 3"
3 ID 01 <
B) m in M- w < (B
LJ.
T) pi ft) g (-• !-• O (B o rt <i in c
1 M* (D 3 (X
l\j . o o o h-»
0] (1) o o 3 a u
*Tl 111 H H ID ct H- •n N H- h" (11 3
un
M w i-» 3 ID
Fig. S
Assembly Line
probability to have a jam occured time between successive pallets in no robot breakdown
.01 200 seconds
o a o
EQ.i Y=520.536-^.5^7X+.l6^X':
S.D.: 5.34
UJ
o o o 01
o o
o o o
o o o
14.000 15.000 16.000 17-000
JAM TIME
18■000 —1
19.000 ~1 ao-ooo:<io
64
THE IN SYS
o o o
3
3 m
JO.000 3H.00O
-f-^ 1 . •(6.000
1
54 l
000 62.000 I
70.000 I
78 000X10 '< • 1
a <+>a OH.11 - 3 ° 1 ro a o p O* 11* o*
w O ID H. o rttH-
*' H- - 1 IB •<
w K (B 3 II 0> cf
D (v (a o a c
H o 003-
Ol U\ S 0 P 3 ro < 9> • >oj 01 IB m
VJ d\ 01 0} ■p- 1
+ »-» 0\ ■P"
M
i-"P <* IB
C-j.
P b K- i-" 0 IB 0 <+ 0 01 c
►1 N-IB 3 0.
IB s a-
•<;
P 3 IB ' l/l
M . O o ot- tn IB o o 3 n. 00
Fig. r
Assembly Line
ff«ba5±i1'ty t0 have a JM occured , .01 non?obotW^ai1do^a3iVe Pall6tS in ' 20° ■"««»-
o o
EQ. i Y=-5.696i;+.051133X+.l26't6*io"6x2
14.300 ;c:oo
AM T i ME
65
MAX OUEUF.
i .000 i .HOO .000 J.400 4 . ^00 5 .000 '"). ROO
Ul .2 m
a rf a 0 (-"• f(
. 3 o 1 ID or o pi o'er c O <D H- e+ t+ H- _*' H- o*n> «+
ID 3 p <+ r? CO O P. c O O ST SOP 3 <D <
01 (I
m <
M o ro o cf o oi c
1 H" (0 3 p.
O O O l-»
O O 3 0. w
> (A 01 m a o*
cm
Fig. U
Palletizing Line
probability to have a jam occured : .01 time between successive pallets in i '200 seconds no robot breakdown
EQ.i Y=155.9-.62X+2.5*10"3X2
S.D.i .^72
14.000 15.000 15.000 17.000
JAM TiME
000 13.000 '.0. 000X10
66
I I .HOO MAX OUEUE
13.000 13.400 ■^00X10
W o
K M II • H» a Oi • Ul
VO
£- 1
£- 0\
K + to Oi * H* o
V-J X to
3 ct>c< O M-^
a o o |U o*ty a-
0 a> H* c+ cr M _ ** H- 0*10 re 1 (0 •< rt> 3 p> rt- Jvcii o ac O o 3* 3 fl> <$
(a n>
*: ID
'O 0) PI 3
r- • o ra o <+ n (n c
1 h- CO 3 o. - •• to' . o o o H*
ID n o o 3 PL m
Hi
M- N H- 3
<W
tr<
3
o •v o
Fig. V
Palletizing Line
time between successive pallets in i 195 seconds time needed for solving the jam s 200 seconds probability to have a jam occured t .01 no robot breakdown
o a o
EQ.i .51527+.52225X
correlation coefficient! .9895^
o m o or.
o a <x
.700 .733 767 .800
SPEED RTI 0
8C7 .300
67
ROBOT UT1
.800 .840 .880 .fliiO .160 I .000 1 .040
-J
u, rn rn o
o o n 1 n> M W P /D ct ■ M- ■• o • 3 •
!j» o H* o U\ n> to H> -vj H, + h" > O U\ (-•• tO IS M 3 to ct U\
ts . VO 00 VO
-P
3-0 ct ct 0 1 HM-"-
o 3 3 1 O" (D <D O P tftratf 0 h" ro ro c+ !-■ (0 ct
o- ct ID ID 1 •<! P-ro CD 3 P. ct H>
a o o on h)
1 C P 3" O H" (0 tn o M < o ro 0) It h-«l ct >*J
«S fl h" H- P H-I-" ts im
3 < 3 cm
• at ID
C_l.
§ 3" P f .«*
ID (-■ 3 O H"
OIJ.O ID O P ct c g oi
• to h* o OVO H* OUl
0) </] ID ID O o O o 3 3 p. a. (a (A
Fig. W
Assembly Line
time between successive pallets in i 200 seconds, time needed for solving the jam i 200 seconda probability to have a jam occured i .01 no robot breakdown
EQ.i Y=.168+.79?65X
correlation coefficienti .99977
o m o or
./GO 733 ?6' .800
SPEED °J\0 5JJ ■ 300
68
ROBOT UT1•
7QO '40 .7tiO .a^o .860 .900 .940
00
rn o
1 1 1 1 1 1
\ o \ ° \ 1 \ ^ w
\ p \ ■+
o
\ H- K \ o II
\ 3 l-» \ ° Ox
\ o 00 _ \ <B + \ H> ■
\ Hi -o •\ I-" \o \ o -o \ >"" Os \ ™ V-n \ 3 >4 \ rt
\ Co \ *o \ »o \ ~J
-
\ ~°
\
3Ti c+ <+ O 1 H- H-
o H H 1 C ro ro n |U cr a-3 tr o p. (0 (D c+ H1 <n <+
H- p. ^ a" i+ fl> (D 1««« a. n> m 3 in c+ H !>r o o Ul p. 1 c n 3- o
3 P 01 o <$ o (D (D H" U)
<s 01 P H- I-"
3 «* in 01
c_t
g ctv 3"P> ro H"
O H O c_. ID O P rt- c B 01 1
• NN o o o t-* o o
01 «i (D a> O o O o 3 3 a- o- [C 01
01 (D a o-
Fig. X
Assembly Line
time between successive pallets in : 200 seconds time needed for solving the jam : 200 seoonda probability to have a jam occured s .01 no robot breakdown
EQ.: 10511.-1568.5X
correlation coefficient: .997^
a Lu
■<
a.
.700 ■7Ti . ?6? --"30
SPEED RTiO
. 90C
69
PARTS USFD
90.000 91.ZOO
J.
V m m a
o 1 '1 m (0 JIT M • 111 •■
r+ H- H* O O 3 Or
H* o I-* o ■
IB 1 H, 1-* H, v_n I-" Ov O CD h" ■
(t> lj\ a X rt
Cr> yn -s] -p-
3* rtrt o 3 a
1 o* ra ro o |U o- cr 3 cr 0 H-CD (0 rt H<D <+
H-O. S CT c+ ID (0 1 «<! p. (D m 3 f» c+ M> (v o o en P- 1 c O 3" O * w to o 3 <i O CD
SHU <J 01
(D H- I— 3 <J
TO ID
IJrt'd a 3-p
ID H* O M O c_i. ID O fj) r+ C 3 01 1
• M M O O O MOO
01 01 ID ID O f) O O 3 3 a a. a oi
m 01
<m
Fig. r.
Palletizing Line
time between successive pallets in s 195 seconds time needed for solving the jam i 200 seconds probability to have a jam occured t .01 no robot breakdown
Y=^8926 . -7903^ .8^Xf 585^ .X
UJ
,700 733 767 .800
SPEED RT10
667 .900
70
TMc. IN SYS
<;2.<;00
o
</i
m ni a
■if . 000X10
I
0 fl H-P- OSS
1 a* ro m O B) a- o"3 cr 0 H- m (0 ct (--n) c+
H- p. S O* c+ (0 (0 1 <<: p. ni ro 3
Voou O. 1 C O 3" O
S"" P 01 o hi < o <t> (U a> H-* oi (-"
< M (-" (U |J. H. IB >fl
3 < e+ H- W <o h" 0>)
O. N
§£3 3 W (-> cm K
O h-" Oo. (D tr< O 0) rt C 3 CO 3 •1 rt> (D H- a 3
• INJ I"1
O OvO ►■* ou
(a i/1 m a> o o o o 3 3 p. p. CQ 01
o o
Fig. Z
Assembly Line
time between successive pallets in : 200 seconds, time needed for solving the jam : 200 seconds probability to have a jam occured : .01 no robot breakdown
o o
a a UJ
EQ.i Y=293-02-550.9X+5O7.95X
S.D.: 0. /
o o
o a
767 800
p p f D ? T J.'
833 ■807 300
71
TME IN SY:,
i S.I no ih.UKl 17-600 .1 L
11
.1
IJ CO o o
CO
Co O
3 •r) r+ r+ <J M H H-
o r) r! 1 cr ra ID O HI a- a" 3 rr c H a> ID H H 10 ft
H a O* e+ ID ID 1 •< CL (D ID 3 111 el- n> SV O o (11 o. 1 c U s' o f (U 0) o J < o ID
ID P-- 01 < «i HI H* h"
3 < J<1 ID
t^.
U rl-'d 3- PI 10 t-
o r-1
o :_,. ID o 111 .+ c H 11 i ID M- a 3
% ro fo o o O H* o O
i,i 1/1 • D .D O 1) o tl 3 ^J p. u. u. 01
> 01 01 ID g
tr1
3
CD a o
Fig. T£
Palletizing Line
time between successive pallets in time needed for solving the jam probability to have a jam occured no robot breakdown
200 seconds. 200 seconds .01
o o
EQ.i Y=118^5. + 1>6^.X-5.9225X':
o o
667 900
SpEE
72
MAX OUEUE
3 'd ct c+ 0 >i |J. H-
o a a 1 ffm n o pi ffcraff 0 H-(B n> ct t-'lt rt
P. as; 1 ^ am re 3 P ct H>i rV O O W
O 3" o S W 0) o 3 < O (D
IB I-1 W < M
P> H- H-
cm <o c_i.
a a- iu O (-. O cj. (ti O (U rt C 3 O 1 ro i- a 3
o o o •"• o o
m u> a> ro o o o o 3 3 a a a in
hj
£ H- (0 ct (-■• ►a N M- M' oq 3
im
3 3 01
o o
Fig. ZZ
Assembly Line
time between successive pallets in time needed for solving the jam probability to have a jam occured no robot breakdown
195 seconds 200 seconds .01
EQ.i Y=13.35-33.5X+25.X'
S.D.: .671
a a
UJ o o • X -c r
o o o
.700 7TJ 75' .600
SPEED RTiO
83J ■6C- . <?0C
73
MAX QUEUE
2.000 2.400
-J
m m a
CO
GOO 4.000 J
4.400 J
M £> ■
{/] ■ K a 1! > M •• U)
. l_J 0\ U\ -N3 1 l-» U)
U)
u> X + M U\
X w
o a a 1 fflO It o pi cro-3 cr O H- <D fl> «+ (- ID <+
O* c+ ID (D i"*; p.™ (0 3 (» rt-Hi ITOOU P- 1c o a- o J pi la n 3 < o ro
ID H* IQ
< U>
0*i ID C-J.
§£+•□ (D (-•
O (-. 0 c. re ngrf c 3 co 1 01 H- O- 3
O OO I- OUl
U) (A re re o o o o 3 3 o. o. CO CO
> CO CO ID 3
H- 01)
CS1 IS)
o o
1.3 SIMULATION PROGRAM
PROGRAM MAIN DIMENSION N3ET(10000) C0MM0N/SC0M1/ ATRIB(tOO),DD(t00),DDL(tOO).DTNOtf,II 9,MFA,MST0P,NCLNR 1,NCRDR,NPRNT,NNRUN,NNSET,NTAPE,S3(1.00), 8, SoL( 1-00) , TNEXT, TNOW, XX (200) C0MM0N/UC0M1./ TPLCR(20), ASMBT(3), REPAR, FAST COMMON QSET( 1,0000) EQUIVALENCE (NSET(1),QSET(1)) OPEN (UNIT-5, DEVICE-' DSK' ,"FILE- 'SLIN.DAT* .ACCESS- 'SEQIN' ) 0PEN(UNIT=6,D2VICE='D3K'.FILE-'SLOUT.DAT',ACCESS-'SEQOUT') 0PEN(UNIT=7,DEVICE-'DSK'.FILE-'TEMP.DAT',ACCESS-'SEQINOUT') NNSET-10000 NCRDR-5 NPRNT-6 NTAPE-7 CALL SLAM STOP END
C C C C
SUBROUTINE INTLC COMMON/SCOMl/ ATRIB(lOO),DD(100),DDL(100),DTNOW,II 9.MFA.MST0P.NCLNR 1 , NCRDR, NPRNT, NNRUN, NNSET, NTAPE, SS(l-OO), 8, SSL(1.00),TNBXT, TNOW, XX (200) C0MM0N/UC0M1/ TPLCR(20),ASMBT(3),REPAR,FAST COMMON QSET(10000)
CCCCC ROBOT PLACING TIME FOR EACH TYPE OF PRODUCT DATA TPLCR/8.5,8.5,8.5,8.5,8.5,8.5,8.5,6.5,8.5,8.5, 1 8.5,8.5,8.5,8.5,8.5,8.5,8.5,8.5,8.5,8.5/
CCCCC DATA ASMBT/7.,0. ,12./
CCCCC TIME TO REPAIR THE JAM
c REPAR-200.
XX(1.)-1. CCCCC NUMBERS IN A CASE
XX(2)-100. CCCCC NUMBERS OF PARTS IN A PALLET
XX(3)-20. CCCCC
XX(8)=7. CCCCC TIME FOR PALLET TO BE RELEASED
74
XX(9)=1 ccccc ccccc
XX(1.0)-10. CCCCC THE FOR PALLET TO RECYCLE IN SYSTEM 1
XX(1.1)=7. CCCCC
XX(12)*=1. CCCCC NUMBER OF STAGES IN ASSEMBLY
XX(13)-JJ. CCCCC SUCCESSFUL HATE FOR PLACING THE PARTS ON PALLET
XX(l,4)-.99 CCCCC INDIVIDUAL SUCCESSFUL RATE FORR THE PARTS ON PALLET
XX(16)=.99**7 XX(17)=.99*12
CCCCC INCOMING RATE OF PALLET CCCCC
XX(l5)-30. CCCCC RATIO OF THE ROBOT PROCESS THE
FAST-1. RETURN END
C C
SUBROUTINE EVENT(l) GO TO (1,2)1
1 CALL ARVL RETURN
2 CALL R'rfORK RETURN END
C C
SUBROUTINE ARVL COMMON/SCOMt/ ATRIB(100)IDD(100),DDL(VOO),DTNOW,II 9,MFA,MSTOP,NCLNR 1,NCRDH,NPRNT,NNRUN,NNSET,NTAPE,SS(100), 8,SSL(100),TNEXT,TNOW,XX(200) C0MM0N/UC0141/ TPLCR(20) ,ASMBT(3) ,REPAR,FAST COMMON QSET( 10000) IF(ATRIB(2).EQ.XX(13))G0 TO 50 IF(ATRIB(2).GT.XX(13))CALL ERROR(lOOt) IF(ATRIB(3).EQ.0.)G0 TO 20 ATRIB(2)-ATRIB(2)+1. CALL ENTER(1.ATRIB) RETURN
20 CONTINUE TT-USERF(2)
75
IF(TT.LE.O.)CALL ERROR(1001) ATRIB(2)-ATRIB(2)+1. CALL SCHDL(2,TT,ATRIB) RETURN
50 CONTINUE CALL KNTER(2,ATRIB) RETURN END
C
C
SUBROUTINE RrfORK COMMON/SC0M1./ ATRIB( 100) ,DD(100) ,DDL( 100), DTNOW, II 9,MFA,MST0P,NCLNR 1,NCRDR,NPRNT,NNRUN,NNSET,NTAPE,S3(100), 8,SSL(100),TNEXT,TN0W,XX(200) C0MM0N/UC0M1/ TPLCR(20),ASMBT(3),REPAR,FAST COMMON QSET(10000) CALL ENTER(1.ATRIB) RETURN END
SUBROUTINE OTPUT
C0MM0N/SC0M1/ ATRIB(lOO),DD(100),DDL(100),DTNOW,II 9,MFA,MST0P,NCLNR 1 ,NCRDR,NPRNT,NNRUN,NNSET,NTAPE,S3(100), 8,SSL(100),TNEXT,TNOW,XX(200) COMMON QSET( 10000) rfRITE(6,10)REPAR rfRITE(6,20)XX(2) rfRITE(6,30)XX(3) WHITE(6,80)XX(d) WRITE(6,90)XX(9) WRITE(6,140)XX(14) WRITE(6,150)XX(15)
10 F0HMAT(10X,'TIME FOR SOLVING THE JAM-',F10.5) 20 FORMAT(tOX,'BATCH SIZE =',F10.5) t>0 F0Ri4AT( 10X ,' No . OF PARTS IN A PALLET=',F10. 5) 80 FORMAT(1 OX,'TRANSFER TIME FROM 1-2 =',F10.5) 90 FORMAT(10X,'TIME FOR PALLET RELEASED-',F10.5) HO FORMAT (1 OX," PROBABILITY OF PASS «',F10.5) 150 FORMAT(tOX,'TIME BET. PALLET ARRIVAL'',F10.5)
RETURN END
C C
76
FUNCTION U3ERF(I) COMMON/SCOM17 ATRIB(100),DD(100),DDL(100),DTNOW,II 9,MFA,MSTOP,NCLNR 1 ,NCRDR,NPRNT,NNRUN,NN3ET,NTAPE,SS(100), 8,SSL(100),TNEXT,TNOW,XX(200) COMMON/UCOM1/ TPLCR(20) ,ASMBT(3) ,REPAR,FAST COMMON Q5ET(10000) 00 TO (1,2,3,4,5,6,7,8)1
1 CONTINUE AA=REPAR*.9 BB=REPAR*1.1 GG=0. IF(DRAND(1I).GT.XX(1.4))00=UNFRM(AA,BB,1) U5ER1)'"GTABL(TPLCR,XX(6), 1 • ,XX(3) , 1 •) USERF»USERF*FAST IF(GG.GT. 0.)U3ERF=U3ERF/2• USERF=U3ERF+GG RETURN
2 CONTINUE CCCCC TIME FOR PALLET TO RECYCLE AND PROCESS IN SYSTEM 2
USERF=1.1 . RETURN
3 CONTINUE USERF=UNFRM(20.,40.,1) RETURN
4 CONTINUE USERF=EXPON(tOOOOO.,1) RETURN
5 CONTINUE RETURN
6 CONTINUE AA=REPAR*.9 BB-REPAR*1.1 GG=0. TX=XX(16) IF(ATRIB(2).GE.3-)TX»=XX(17) IF(ATRIB(2).BQ.2.)TX=1. IF(DRAND(1,).GT.TX)GG=UNFR14(AA,BB,1) USERF=GTABL(ASMBT,ATRIB(2),1.,XX(13),1•) USERF=USERF*FAST IF(GG.GT.0.)USERF=USERF/2. U3ERF-U3ERF+GG USERF-USERF+GG RETURN
7 CONTINUE USERF=EXPON(100000.,1) RETURN
8 CONTINUE
77
USERF=EXP0N(30.,1) RETURN END
NETWORK PROGRAM
GEN,SUN, INPUT 1,3/7/1 385,1,0,, NO, ,N0 ; LIH,9,4,tOOO; SEEDS,756375957(1); INTLC,XX(6)=1.; NETWORK;
KES0URCE/PLCER(1),4,2; RESOURCE/ASMBY(1),8,6; RESOURCE/PLLET(30),7; RESOURCE/PARTS(100),5; GATE/IN,0PEN,1; GATE/OUT,CLOSE,3;
CREATE,XX(15),,1; AGAIN GOON;
QUEUE(9),100; ACT,0.001; ASSIGN,ATRIB(3)=NNQ(1 )+NNACT(4); G00N.1; ACT/3,2000,ATRIB(3)-GE.XX(2),AGAIN; ACT(1)/4,1; ASSIGN,ATRIB(1 )=TN0W; ArfAIT(l-),IN; ACT,,,COUNT; ACT/2;
SUN AtfAIT(2),PLCER; PART AWAIT(5),PARTS;
ASSIGN,XX(5)=XX(5)+1; ACT/1,USERF(1); GOON; ACT,,,GO; ACT,1,XX(5).EQ.XX(2),ONE;
GO G00N,1; ACT,,NNGAT(OUT).EQ.O,SND; ACT,,,NEXT;
NEXT FREE.PLCER; ACT,XX(11);
LOOP GOON.t; ACT,5.,NNGAT(IN).EQ.0,L00P; ACT,,,SUN;
78
END AirfAIT(3),0UT; Jj'REE.PLCER; COLCT,INT(l),TIME IN PLCER; ASSIGN,XX(7)=XX(7)+t; ACT,,XX(7).EQ.XX(2); CLOSE, OUT; OPEN,IN; ASSIGN,XX(7)=0; TERM;
ONE ASSIGN,XX(6)=XX(6)+V, XX(5)=0;
ACT,,XX(6).EQ.XX(3); OPEN,OUT; ASSIGN,XX(6)=1; TERM;
COUNT ASSIGN,XX(4)"XX(4)+1 ;. 1 ACT,,XX(4).EQ.XX(2); '
CLOSE,IN; ASSIGN,XX(4)=0; TERM; .
BREAK CREATE,,; ACT,U3ERP(4); PREEMPT (4). PLCER; ACT,U3ERJ>'(3); FREE, PLCER; ACT,,,BREAK;
CASE CREATE,400.,,1; ACT,XX(12); ALTER,PARTS/XX(2); TERM;
CHEN CREATE,XX(1 5),,1; ASSIGN,ATRIB(4)-TNOW; AWAIT(6),ASMBY; AWAIT(7),PLLET; ASSIGN,ATRIB(2)=1;
JASSI ASSIGN,ATRIB(3)=USERF(6); ACT,ATRIB(3);
79
EVENT,1; TERM;
ENTER,1; ACT,,,JASSI;
ENTER,2; FREE,ASMBY; ACT,,,DATA;
DATA C0LCT,INT(4),TIME IN ASMBY; ACT,,,CYCLE;
CYCLE GOON; ACT,XX(9); FREE.PLLET/+1 ; TERM;
CHANG CREATE,,; ACT,USERF(7); PREEMPT(8),ASMBY; ACT,U3EflF(8); FREE,ASMBY; ACT,,,CHANG; END;
INIT.O.,29800.; TIMST,XX(5),N0. IN CASE; TIMST,XX(6),N0. IN PALLET; TIMST,XX(15),RATE OF INCOMING; MONTR,CLEAR, 1000.; FIN;
80
VITA
The author was born in Taipei, Taiwan, The Republic of China,
on April 9, 1957, the son of Tung-Yun Sun and Melin Sun. He
completed high school in 1975. and attended National Tsing Hua
University, Hsinchu, Taiwan from 1975 to 1979- He received his
Bachelor of Science degree in 1979> with a major in Industrial
Engineering. Upon graduation, he served in the Chinese Army as a
Welfare Officer for two years. After that, he decided to continue
his education with graduate study in the United States, and enrolled
at Lehigh University in the Department of Industrial Engineering.
81