代写MATH6119、Python/c++编程语言代做
Case Study - Information Sheet
Printed Circuit Board Assembly
1 Background
Philips Electronics produces printed circuit boards (PCBs) for use in consumer electronics (audio and video equipment, personal computers) and in professional industries
(telecommunication systems, aircraft navigation, medical equipment). Special machines
are used to mount components onto the boards. The problem to be considered is one
of production preparation: for each type of PCB, it is necessary to specify the way in
which the components should be mounted.
This case study is based on work carried out for one of the major product divisions
of Philips. Although some simplifications have been made to the original problem, this
does not affect the main characteristics of the decisions that have to be taken.
2 Assembly of PCBs
PCBs are assembled by automated machines. A conveyor feeds each board into the first
machine, and transports the boards between machines. Thus, a board passes into the
first machine where a selected subset of components are mounted, then passes to the
second machine where further component mountings are performed, and so on, until the
last machine completes the PCB. The conveyor moves all partially assembled boards to
the next machine simultaneously. Thus, the conveyor only moves when every machine
has completed its work on a board. For example, if there are eleven components to be
mounted by three machines, A, B and C, where machine A mounts components 1, 2,
3 and 4 and takes 8 seconds, machine B mounts components 5, 6 and 7 and takes 12
seconds, and machine C mounts components 8, 9, 10 and 11 and takes 9 seconds, then the
conveyor moves the boards every 12 seconds. Consequently, the first PCB is completed
after 36 seconds, and a further PCB is completed at the end of each subsequent 12-second
interval.
The components to be mounted on the board are contained in feeders on one side of
the conveyor. The components are classified into different types, and each feeder only
contains components of a single type.
Each machine has a robot arm with three heads. The heads are each fitted with a
piece of equipment which can pick components from the feeders and subsequently place
them on the board. At most one component at a time can be carried by a head. Note that
each component type can only be handled by a subset of the set of head equipments. In
other words, a head with a given piece of equipment can only pick and place components
of a limited set of component types.
The mounting process consists of a sequence of pick-and-place moves. In the picking
phase, the heads pick a component from the relevant feeders in turn. The order is
fixed: the first head picks first, then the second, and finally the third head. During
1
the placing phase, the robot arm moves to appropriate points on the board so that
the components can be sequentially mounted. In contrast to the picking, the order in
which the components are mounted can be chosen. Note that it is possible to choose
pick-and-place moves in which only one or two of the three heads are used.
To illustrate the process, consider the following example in which a single machine is
used to mount five components on a board. There are two components of type α, one of
type β, and two of type γ. The feeders for these component types have coordinates (5,
0), (10, 0), and (15, 0), respectively. Further, the two α components have to be mounted
at locations with coordinates a1 = (10, 2) and a2 = (10, 12), the β component has to
be mounted at a location with coordinates b1 = (6, 5), and the two γ components have
to be mounted at locations with coordinates c1 = (15, 8) and c2 = (14, 16). Suppose
that, on the first pick-and-place move, the second α component is assigned to head 1,
the β component is assigned to head 2, and the first γ component is assigned to head
3, and that these components are mounted in the order γ, α and β. Then, the robot
arm moves successively between locations (5, 0), (10, 0), (15, 0), (15, 8), (10, 12) and
(6, 5): a total distance of 5 + 5 + 8 + √
41 + √
65 = 32.49. Suppose that on the second
pick-and-place move, the first α component is assigned to head 1, and the second γ
component is assigned to head 2, and that these components are mounted in the order
α and γ. Starting at the location (6, 5) where the last component was mounted on the
previous move, the robot arm moves successively between locations (5, 0), (15, 0), (10, 2)
and (14, 16): a total distance of √
26 + 10 + √
29 + √
212 = 35.04. These pick-and-place
moves are illustrated in Figures 1a and 1b, respectively.
Figure 1: (a) First pick and place move; (b) Second pick and place move (the solid line
denotes the route travelled by the arm during this move)
2
3 Throughput
It is required to maximize the throughput of the assembly line, which is determined by
the machine with the heaviest workload. The workload of a machine is proportional to
the total distance travelled by the robot arm. In computing this distance, you should
assume that, when the conveyor moves, the robot arm remains at the position where the
last component was placed until the new board arrives. Increased throughput is achieved
by:
• avoiding large movements of the robot arm;
• balancing the workload between machines.
The scheme that is selected should minimize the time required for the busiest machine
to complete all of its mounting operations.
4 Data
Relevant data for the problem are as follows. There are three machines, and 102 components to be mounted on the board. The components are of 10 different types, which are
labelled as type A, type B, etc., up to type J. There are nine pieces of equipment which
are to be fitted on the heads, and no piece of equipment is duplicated. The following
table lists the equipment, giving the component types that each piece of equipment can
handle.
Piece of equipment Types of components that can be mounted
Figure 2 displays the feeder positions, and shows the positions of the component
types on the board. The feeders for components of types A, . . . , J have coordinates (2,
0), . . ., (11, 0), respectively. The board is depicted below the feeders. The components
to be mounted at the top of the board have coordinates (1, 2), . . . , (12, 2), and the
components to be mounted at the bottom of the board have coordinates (1, 13), . . . ,
(12, 13). There are some locations on the board where no component is to be fitted.
For example, no component is required at the position with coordinated (9, 5), while a
component of type J is to be mounted at the position with coordinates (10, 5).
Note that the times required to pick a component from a feeder, to mount a component on a board, and to move the board on the conveyor are neglibible.
eeders
Figure 2: Layout of the PCB board
4

热门主题

课程名

int2067/int5051 bsb151 babs2202 mis2002s phya21 18-213 cege0012 mgt253 fc021 mdia1002 math39512 math38032 mech5125 cisc102 07 mgx3110 cs240 11175 fin3020s eco3420 ictten622 comp9727 cpt111 de114102d mgm320h5s bafi1019 efim20036 mn-3503 comp9414 math21112 fins5568 comp4337 bcpm000028 info6030 inft6800 bcpm0054 comp(2041|9044) 110.807 bma0092 cs365 math20212 ce335 math2010 ec3450 comm1170 cenv6141 ftec5580 ecmt1010 csci-ua.0480-003 econ12-200 ectb60h3f cs247—assignment ib3960 tk3163 ics3u ib3j80 comp20008 comp9334 eppd1063 acct2343 cct109 isys1055/3412 econ7230 msinm014/msing014/msing014b math2014 math350-real eec180 stat141b econ2101 fit2004 comp643 bu1002 cm2030 mn7182sr ectb60h3s ib2d30 ohss7000 fit3175 econ20120/econ30320 acct7104 compsci 369 math226 127.241 info1110 37007 math137a mgt4701 comm1180 fc300 ectb60h3 llp120 bio99 econ7030 csse2310/csse7231 comm1190 125.330 110.309 csc3100 bu1007 comp 636 qbus3600 compx222 stat437 kit317 hw1 ag942 fit3139 115.213 ipa61006 econ214 envm7512 6010acc fit4005 fins5542 slsp5360m 119729 cs148 hld-4267-r comp4002/gam cava1001 or4023 cosc2758/cosc2938 cse140 fu010055 csci410 finc3017 comp9417 fsc60504 24309 bsys702 mgec61 cive9831m pubh5010 5bus1037 info90004 p6769 bsan3209 plana4310 caes1000 econ0060 ap/adms4540 ast101h5f plan6392 625.609.81 csmai21 fnce6012 misy262 ifb106tc csci910 502it comp603/ense600 4035 csca08 8iar101 bsd131 msci242l csci 4261 elec51020 blaw1002 ec3044 acct40115 csi2108–cryptographic 158225 7014mhr econ60822 ecn302 philo225-24a acst2001 fit9132 comp1117b ad654 comp3221 st332 cs170 econ0033 engr228-digital law-10027u fit5057 ve311 sle210 n1608 msim3101 badp2003 mth002 6012acc 072243a 3809ict amath 483 ifn556 cven4051 2024 comp9024 158.739-2024 comp 3023 ecs122a com63004 bms5021 comp1028 genc3004 phil2617
联系我们
EMail: 99515681@qq.com
QQ: 99515681
留学生作业帮-留学生的知心伴侣!
工作时间:08:00-21:00
python代写
微信客服:codinghelp
站长地图