1. Approaches to Line Balancing Three Basic Approaches for finding a solution COMSOAL – Basic random solution generation method Ranked Positional Weight Heuristic – Good solutions found quickly Implicit Enumeration Scheme Assumptions Required cycle time, sequencing restrictions and task times are known

2. COMSOAL Random Sequence Generation A simple record-keeping approach that allows a large number of possible sequences to be examined quickly Only tasks that satisfy all the constraints are considered at each step. Sequence discarded as soon as it exceeds the upper bound. Sequence saved if it is better than the previous upper bound and the bound is updated. Efficiency depends on the data storage and processing structure

3. COMSOAL – Example TaskActivityAssembly Time Immediate Predecessor aInsert Front Axle / Wheels 20- bInsert Fan Rod6a cInsert Fan Rod Cover5b dInsert Rear Axle / Wheels 21- eInsert Hood to Wheel Frame 8- fGlue Windows to top35- gInsert Gear Assembly15c, d hInsert Gear Spacers10g iSecure Front Wheel Frame 15e, h jInsert Engine5c kAttach Top46f, i, j lAdd Decals16k

4. Example Solution Model Car Precedence Structure a d e f bcj gh ikl 20 21 8 35 6 55 1510 154616

5. Data Known : Two 4 hour-shifts, 4 days a week will be used for assembly. Each shift receives two 10 minute breaks. Planned production rate of 1500 units/week. No Zoning constraints exist. COMSOAL – Example

6. Example Solution – Cont… To meet demand C = 70 Seconds. Initially four potential tasks a, d, e, or f Generate random number between 0 and 1. Say outcome in our case is 0.34 R is in second quadrant so keep d as first task. Continue the random generation. Quick check of lower bound Thus Better Solutions may exist

7. Single COMSOAL Sequence Results StepList AList BList FU (0,1)Selected Tasks Station (Idle Time) 1a through la, d, e, f 0.34d1(49) 2a through l, -da, e, f 0.83f1(14) 3a, b, c, e, g, h, i, j, k, la, ee-e1(6) 4a, b, c, g, h, i, j, k, la-Open Station 4a, b, c, g, h, i, j, k, laa-a2(50) 5b, c, g, h, i, j, k, lbb-b2(44) 6c, g, h, i, j, k, lcc-c2(39) 7g, h, i, j, k, lg, j 0.21g2(24) 8h, i, j, k, lj, hh, j0.42h2(14) 9i, j, k, li, jj-j2(9) 10i, k, li-Open Station 10i, k, lii-i3(55) 11k, lkk-k3(9) 12ll-Open Station 12lll-l4(54)

8. COMSOAL – Advantages The technique is relatively easy to program. Feasible solutions are found quickly. Greater the computational effort expended, the better the expected solution. Basic idea can be applied to many decision problems, the only requirement being that we can build solutions sequentially and a function evaluation can be performed to rank candidate solutions.

9. Class Exercise Solve the following line balancing problem using COMSOAL. Assume demand is 100 per 8-hour day. TaskTimeImmediate Predecessor a2- b1a c2a d3b, c e1d f3e

10. Exercise Solution a b c def 2 1 2 313

11. Exercise Solution – Cont… StepList AList BList FU(0,1)Selected Task Station (Idle Time) 1a to faa -a1(2.8) 2b to fb, c 0.68c1(0.8) 3b to f, -cbb -b2(3.8) 4d to fdd -d2(0.8) 5e, fee -e3(3.8) 6fff -f3(0.8)

12. Ranked Positional Weight Heuristic A task is prioritized based on the cumulative assembly time associated with itself and its successors. Tasks are assigned in this order to the lowest numbered feasible workstation. Cumulative remaining assembly time constrains the number of workstations required. Illustrates the greedy, single pass heuristics. Procedure requires computation of positional weight PW(i) of each task.

13. RPW Procedure – Cont… 1. Task Ordering : For all tasks i = 1,…,N compute PW(i). Order (rank) tasks by nonincreasing PW(i) 2. Task Assignment : For ranked tasks i =,…,N assign task i to first feasible workstation. Precedence Constraints : assignment to any workstation at least as large as that to which its predecessors are assigned Zoning & Time Restrictions : Checked on placement.

14. RPW Procedure - Example TaskActivityAssembly Time Immediate Predecessor aInsert Front Axle / Wheels 20- bInsert Fan Rod6a cInsert Fan Rod Cover5b dInsert Rear Axle / Wheels 21- eInsert Hood to Wheel Frame 8- fGlue Windows to top35- gInsert Gear Assembly15c, d hInsert Gear Spacers10g iSecure Front Wheel Frame 15e, h jInsert Engine5c kAttach Top46f, i, j lAdd Decals16k

15. Example Solution Model Car Precedence Structure a d e f bcj gh ikl 20 21 8 35 6 55 1510 154616

16. RPW Procedure - Solution Positional Weight calculated based on the precedence structure (previous slide). PW l = its task time = 16 PW k = t k + PW l = 46+16 = 62 PW j = t j + PW k = 5+62 = 67 TaskPWRanked PW a1381 b1183 c1124 d1232 e858 f976 g1025 h877 i779 j6710 k6211 l1612

17. RPW Solution Cont… Assignment order is given by the rankings. Task a assigned to station 1. c - t a = 70 – 20 = 50 seconds left in Station 1. Next Assign task d 50 – 21 = 29 seconds left in Station 1. j, k, l70, 65, 19, 33 f, h, e, i70, 35, 25, 17, 22 a, d, b, c, g70, 50, 29, 23, 18, 31 TasksTime RemainingStation

18. Class Exercise Assembly of a product has been divided into elemental tasks suitable for assignment to unskilled workers. Task times and constraints are given below. Solve by RPW Procedure g14h e, f6g c, d7f b6e a10d a6c -18b -20a Immediate Predecessors TimeTask

19. Exercise Solution a b d e c f gh 20 18 6 10 6 7 614 TaskPW i Rank a631 b442 c334 d373 e266 f275 g207 h148 WorkstationAssigned Tasks Remaining Time 1a, d30, 10, 0 2b, c, e30, 12, 6, 0 3f, g, h30, 23, 17, 3