Professional Documents
Culture Documents
Modeling and Analysis OF Manufacturing Systems: Assembly Lines
Modeling and Analysis OF Manufacturing Systems: Assembly Lines
Modeling and Analysis OF Manufacturing Systems: Assembly Lines
OF
MANUFACTURING SYSTEMS
Session 4
ASSEMBLY LINES
February 2001
ASSEMBLY LINE
• SET OF SEQUENTIAL WORKSTATIONS
• CONNECTED BY A CONTINUOUS
MATERIALS HANDLING SYSTEM
• INPUT: RAW MATERIALS
• OUTPUT: FINISHED PRODUCT
WORK ELEMENTS
SMALLEST UNITS OF
PRODUCTIVE (i.e. VALUE-
ADDING) WORK
BACKBONES OF ASSEMBLY
LINES
• PRINCIPLE OF
INTERCHANGEABILITY
• DIVISION OF LABOR
ASSEMBLY LINE TYPES
• SINGLE PRODUCT
• MULTIPLE PRODUCT
• MIXED LINES
MULTIPLE PARALLEL LINES
• DISSADVANTAGES
ADVANTAGES
• easy work
higher setupload
costs
balancing
• increasing
higher equipment
scheduling
costsflexibility
• job enrichment
higher skill requirements
• higher line
slower learning
availability
• more accountability
complex supervision
WORKSTATION CYCLE TIME
• PACED LINES
• UNPACED LINES (ASYNCHRONOUS)
• ROLE OF BUFFERS
• PARALLEL WORKSTATIONS IN
SERIAL SYSTEMS
BASIC LINE BALANCING
PROBLEM
TO ASSIGN WORK ELEMENTS TO
WORKSTATIONS SUCH THAT
ASSEMBLY COST IS
MINIMIZED
TOTAL ASSEMBLY COST
• LABOR COST (WHILE PERFORMING
TASKS)
• IDLE TIME COST
• FOCUS: MINIMIZE IDLE TIME
• LIMITS: PRODUCTION CONSTRAINTS
PROBLEM FORMULATION
• PRODUCTION RATE P (UNITS/TIME)
• NUMBER OF PARALLEL LINES m
• TO MEET DEMAND: CYCLE TIME m/P
• TIME TO PERFORM TASK i : ti
• NO WORKER MUST BE ASSIGNED A
SET OF TASKS OF DURATION LONGER
THAN m/P = C !
SOME FEATURES OF TASKS
• ORDER PARTIALLY DETERMINED
• ASSEMBLY ORDER CONSTRAINTS IP
• ZONING RESTRICTIONS
• TASK PAIRS TO SAME STATION ZS
• TASK PAIRS NOT PERFORMED IN
SAME WORKSTATION ZD
DECISION VARIABLES
• TASK i ASSIGNED TO STATION k ?
• Xik = {1,0}
• TOTAL NUMBER OF STATIONS K
• COST COEFFICIENTS cik
• TOTAL NUMBER OF TASKS N
PROBLEM FORMULATION
• MINIMIZE (cik Xik)
• SUBJECT TO:
ti Xik < C (all stations k)
Xik = 1 (all tasks i)
Xvh < Xuj (all k) & (u,v) in IP
(Xuk Xvk)=1 (all k) & (u,v) in ZS
Xuh+Xvh < 1 (all k) & (u,v) in ZD
OBJECTIVE FUNCTION
FEATURES
• LOWERED NUMBER STATIONS FILL
UP FIRST
• ONLY STATIONS WITH AT LEAST ONE
TASK ARE CONSTRUCTED
• BECHMARKING GAGE: PROPORTION
OF IDLE TIME
• IDLE TIME = (PAID -PRODUCTIVE)
BALANCE DELAY
(measures proportion of idle time)
D = (K* C - ti)/(K* C)
= idle time/paid time
where K* is the number of
stations required by the solution
COMMMENTS
• D IS IDLE TIME OVER PAID TIME
• OBJECTIVE DOES NOT ALLOCATE
IDLE TIME EQUALLY AMONG STNS
• BEST SOLUTIONS: GOOD WORK LOAD
BALANCING
• TOTAL TASK TIME T = ti
• MINIMUM STATIONS (LOWER
BOUND) Ko = | T/C |
LINE BALANCING
APPROACHES
• COMSOAL
• RPWH
• OPTIMAL SOLUTIONS
– TREE GENERATION &
EXPLORATION
– PROBLEM STRUCTURE RULES
– FATHOMING RULES
LINE BALANCING
APPROACHES (contd)
• Required cycle time, sequencing
restrictions and tasks times are all
known.
COMSOAL
• Computer Method for Sequencing
Operations for Assembly Lines
• Simple record keeping to allow examination
of many possible sequences
• Sequences are generated by random picking
a task and constructing subsequent tasks
• New stations are opened when needed
COMSOAL (contd)
• Sequences that exceed the best solution are
discarded
• Better sequences become upper bounds
COMSOAL (contd)
• Array of number of Immediate Predecesors
for each task i NIP(i)
• Array of for which other tasks is i an
immediate predecesor WIP(i)
• Array of N tasks TK
COMSOAL (contd)
• List of unassigned tasks A
• List of tasks from A with all immediate
predecesors assigned B
• List of tasks from B with tasks times not
exceeding remaining cycle time in the
current workstation F
COMSOAL ALGORITHM
For generating X trial solutions
1.- SET x=0, UB=inf, c=C
2.- START NEW SEQUENCE:
– SET x=x+1, A=TK, NIPW(i) = NIP(i)
3.- PRECEDENCE FEASIBILITY
– FOR i IN A, IF NIPW(i) = 0 , ADD i TO B
COMSOAL ALGORITHM
(contd)