CEME 352 ENGINEERING MANAGEMENT II

(LECTURE SERIES 8)

TOPIC: Project Costs & Valuation(s)-Line Balancing

Lecturer: Mr. Herod Malo

School of Engineering (Civil)
Papua New Guinea University of Technology
Reference:
Malo, H. “Project Costs & Valuations- Line Balancing”. Papua New Guinea
University of Technology, August 07, 2020 Lecture.

BEng (Civil) Semester II

© 2020 School of Engineering (Civil), Papua New Guinea University of Technology 1
 Line of Balance in Practice

Example
A company wants to produce 360 parts in a 10 hours/shift in a day.
The production itself has 8 different process. With such
information:
Process Process Time Predecessor Determine:
1. Make precedence diagram and
Seconds
determine the Cycle Time (CT)
A 90 2. Using the longest operation time
heuristic determine the most efficient
B 30
production time
C 70 A 3. Determine the line efficiency and the
Smoothing Index (SI)
D 10 A,B
E 30 C,D
F 60 D
G 50 E
H 50 E,F,G
Sum 390
 LB-Step by step process

1 2 3
Determine number of work
Draw Precedence diagram Calculate Cycle Time (CT)
station

4 5
Determine the efficiency-
Make line of Balance Smoothing Index (SI)
1 Draw precedence diagram

Process Process Time Predecessor

A
seconds
90
C G
B 30
A E H
C

D
70

10
A

A,B
D
E 30 C,D

F 60 D
B F
G 50 E

H 50 E,F,G

Sum 390
2 Calculate Cycle Time (CT)

Example
A company wants to produce 360 parts in a 10
hours/shift in a day. The production itself has 8
different process. With such information:

Known:
Number of products: 360 units Production time per day
Production time per day: 10 hours/ (10 hours x 60 mins x 60
secs =36000 secs) CT=
Number of product
36,000
CT=
360

CT= 100 seconds

 Determine the number of
3 workstation(NT)
Process Process Time Predecessor
seconds Sum of Process Time (T)
A 90 NT=
Cycle Time (CT)
B 30

C 70 A
390
D 10 A,B NT=
100 seconds
E 30 C,D

F 60 D

G 50 E NT= 3. 9 Work stations

H 50 E,F,G

Sum 390
NT= 4 Work stations rounded

CT= 100 seconds

4
Proc Process Predece Work
Line Balancing
Longest Operation Time heuristic
Time Remaining Eligible Will fit Assign Remaining Idle
ess Time ssor station (seconds) (Task time) time Time
seconds 1 100 A,B A,B A (90) 10 (=100-90)

A 90 10 B,C None 10 10
B 30
2 100 B,C B,C C (70) 30 (=100-70)
C 70 A
30 B,D B,D B (30) 0 (=30-30)
D 10 A,B
E 30 C,D 3 100 D,E D,E E (30) 70 (=100-70)

F 60 D 70 D,F D,F F (60) 10 (=70-60)

G 50 E 10 D,G D D (10) 0 (=10-10)
H 50 E,F,G
4 100 G,H G,H G (50) 50 (=100-50)
Sum 390
50 H H H (50) 0 (=50-50)

C G Rule: Assign task according to the greatest number of following tasks. In case of a

A E H tie, use the tie breaker of assigning the task with the longest processing time first.

D Workstation Workstation Workstation Workstation

B F 1 (A) 2 (C,B) 3 (E,F,D) 4 (G,H)
5 Calculate the Idle time and
efficiency

10
Idle Time= 4 x 100

10
Idle Time= 400

Idle Time= 0.025

Efficiency % = 100 x (1-0.025)

Efficiency % =97.5%
CVR: Cost – Value Reconciliation
Important Things to know before writing
up a report