Scribd
Upload
527 views2 pages

Line Balancing

This document presents a line balancing example to minimize the total cycle time. It lists 7 tasks with their individual processing times, predecessors, and possible workstations. The goal is to assign each task to a workstation to balance the line, subject to task dependencies and workstation capacity, in order to find the minimum cycle time.

Uploaded by

api-3835934
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
527 views2 pages

Line Balancing

This document presents a line balancing example to minimize the total cycle time. It lists 7 tasks with their individual processing times, predecessors, and possible workstations. The goal is to assign each task to a workstation to balance the line, subject to task dependencies and workstation capacity, in order to find the minimum cycle time.

Uploaded by

api-3835934
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 2

Line Balancing Example

Immediate Assigned Max Predecessor


Task Time Predecessor(s) Workstation Workstation Workstation
a 0.20 -- 1 0 1
b 0.37 a 2 1 2
c 0.21 a 3 1 3
d 0.18 a 4 1 4
e 0.19 c, d 5 4 5
f 0.39 b, e 6 5 6
g 0.36 f 7 6 7
Max 7 Cycle Time

Minimize: E13
By changing: E6:E12
Subject to: I6:I12<=I13
E6:E12>=F6:F12
1<=E6:E12<=7 & integer

Note: Use evolutionary solver.


Total
Task Time
0.20
0.37
0.21
0.18
0.19
0.39
0.36
0.40

You might also like