Kelompok 2 – Operations Management

Scheduling Operations
Problems 3,6,7,8 (Page 261-262)

Disusun oleh Kelompok 2:

Denny Bayu Oktariza Sibuea

Cahyo Kurnia Hartawan
Panji Bagus
Sari Narulita
Selvia Dwi Fremawaty

Program Studi Magister Manajemen

Sekolah Tinggi Manajemen PPM
2020
 Kelompok 2 – Operations Management

DAFTAR ISI

Problem – 3 (Hal-261)...............................................................................................................................3
Problem – 6 (Hal-261)...............................................................................................................................4
Problem – 7 (Hal -261)..............................................................................................................................4
Problem -8 (Hal -261)...............................................................................................................................5

2
 Kelompok 2 – Operations Management

Problem – 3 (Hal-261)
Sequence the jobs shown below by using a Gantt Chart. Assume that the move time between machine
is 1 hour. Sequence the jobs in priority order 1, 2, 3, 4.

Job Work Center/Machine Hours Due Date (Days)

1 A/3. B/2, C/2 3
2 C/2, A/4 2
3 B/6, A/1, C/3 4
4 C/4, A/1, B/2 3

a. What is the makespan?

b. How much machine idle time is there?
c. When is each job delivered compared with its due date?
d. How much idle time (waiting time) is there for each job?
e. Devise a better job sequence for processing.

Answer :

Hours
Machine 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Idle Time
A 1 1 1 2 2 2 2 4 3 9
B 1 1 3 3 3 3 3 3 4 4 8
C 2 2 4 4 4 4 1 1 3 3 3 7
Total Idle Time 24

a. Makespan 18
b. Machine idle time = 24 Hours
c. Compare Due Date
Delivery Delivery Due Date
Job Time Time (Day)
(Hour) (Day)
1 9 2 3
2 7 1 2
3 18 3 4
4 14 2 3

d. Idle time (waiting time)

Delivery Process Job
Time (Hour) Waiting
Job
(Hour) Time
(Hour)
1 9 7 2
2 7 6 1
3 18 10 8
4 14 7 7

3
 Kelompok 2 – Operations Management

e. Better job sequence for processing is 3, 1, 4, 2 with makesplan 14 hours

Hours
Machine 1 2 3 4 5 6 7 8 9 10 11 12 13 14
A 1 1 1 4 3 2 2 2 2
B 3 3 3 3 3 3 1 1 4 4
C 4 4 4 4 2 2 3 3 3 1 1
Total Idle Time

Problem – 6 (Hal-261)
The security life insurance company process all new life insurance policies through three departments:
Incoming mail (I), Underwriting (U), and policy control (P).The incoming mail department receives
applications and cutomer payments and then routes the files to underwriting department. After
checking of the applicants qualification for life insurance, the underwriting department forwards the
file to policy control for the issue of the policy. At the present time, the company have five new policy
applications waiting to be processed. The time required for processing in each department is shown
below.

Policy Department / Hours

1 I/3, U/6, P/8
2 I/2, P/10
3 I/1, U/3, P/4
4 I/2, U/8, P/6
5 I/1, P/6

a. Prepare a Gantt Chart schedule for this policies.

Hours
Department 1 2 3 4 5 6 7 8 9 11 11 12 13 14 15 16 17 18 19 20
I 1 1 1 2 2 3 4 4 5
U 1 1 1 1 1 1 3 3 3 4 4 4 4 4 4 4 4
P 1 1 1 1 1 1 1 1 2 2 2
Hours
Department 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
I
U
P 2 2 2 2 2 2 2 3 3 3 3 4 4 4 4 4 4 5 5 5 5 5 5

Problem – 7 (Hal -261)

At the university hospital, five blood samples must be scheduled through a blood-testing laboratory.
Each sample goes through up to four different testing stations. The times for each test and the due
dates for each sample are as follows:

Sample Test Station/ Hours Due Date (Hours)

1 A1/, B/2, C/3, D/1 6
2 B/2, C/3, A/1, D/4 10
3 C/2, A/3, D/1, C/2 8
4 A/2, D/2, C/3, B/1 14
5 D/2, C/1, A/2, B/4 12

4
 Kelompok 2 – Operations Management

a. Using a Gantt chart, Schedule these five samples in priority order earliest due date first
Priority order earliest due date 1,3,2,5, and 4
Hours
Test Stattion 1 2 3 4 5 6 7 8 9 11 11 12 13 14 15 16
A 1 3 3 3 5 5 4 4 2
B 1 1 2 2 5 5 5 5 4
C 3 3 5 1 1 1 3 3 2 2 2 4 4 4
D 5 5 3 1 4 4 2 2 2 2
b. Assume that the capacity of each test station (A,B,C, and D) is Doubled. Prepare an FCS for this
situation.
Hours
Test Stattion 1 2 3 4 5 6 7 8 9 10
A1 1 3 3 3 2
A2 4 4 5 5
B1 1 1 5 5 5 5 4
B2 2 2
C1 3 3 5 1 1 1 4 4 4
C2 2 2 2 3 3
D1 5 5 4 4 3 1
D2 2 2 2 2
Priority based on FCS is 1, 4, 2, 3 and 5

c. What are the bottleneck work centers in part a of the problem. Suggest capacity additions that
might be needed.
bottle neck terdapat pada Test Station “C”, sebaiknya dilakukan penambahan jam lembur
atau penambahan jumlah tenaga kerja pada test station “C”, dikarenakan pada station “C”
jumlah permintaan terlalu banyak, dikhawatirkan kapasitas tidak memadai,

Problem -8 (Hal -261)

A secretary is considering three dispatching rules for typing term papers. The following information is
given on jobs that are waiting to be typed:

Paper Hours until Due Date Total Remaining Processing Time Order of arrival
Processing Time* (Typing Hours)
(Hours)
A 20 12 10 4TH
B 19 15 12 3RD
C 16 11 6 2ND
D 10 5 5 1ST
E 8 11 7 5TH

5
 Kelompok 2 – Operations Management

Use the following dispatching rules to determine the sequence for term paper processing.

a. SPT
SPT (Shortest Processing Time) untuk typing hours urutannya adalah D-C-E-A-B

b. FCFS
FCFS (First Come First Served) berdasarkan order yang diterima paling pertama hingga paling
terakhir urutan FCFS yaitu : D-C-B-A-E

c. CR
CR (Critical Ratio) = remaining time until due date
Remaining processing time
Total Remaining
PAPER Hours until Due Date
Processing Time* (Hours) Critical Ratio
A 20 12 1.67
B 19 15 1.27
C 16 11 1.45
D 10 5 2.00
E 8 11 0.73