Scribd
Upload
17 views3 pages

20210201079

1. The document contains a production schedule, EOQ calculation, routing information, and job scheduling details. 2. The optimal EOQ is calculated to be 1704.89 units when Q is greater than 3000. 3. The routing information shows 10 elements with a total processing time of 57 minutes. The balanced delay is calculated to be 730.24 and the system instability is 81.13. 4. The job scheduling details include start and finish times showing jobs 5 and 10 finished tardy, with an overall makespan of 204 minutes.

Uploaded by

BENNY WAHYUDI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
17 views3 pages

20210201079

1. The document contains a production schedule, EOQ calculation, routing information, and job scheduling details. 2. The optimal EOQ is calculated to be 1704.89 units when Q is greater than 3000. 3. The routing information shows 10 elements with a total processing time of 57 minutes. The balanced delay is calculated to be 730.24 and the system instability is 81.13. 4. The job scheduling details include start and finish times showing jobs 5 and 10 finished tardy, with an overall makespan of 204 minutes.

Uploaded by

BENNY WAHYUDI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Soal 1

Jadwal Induk Produksi

Periode
Sumber MPS Permintaan
SS 1 2
RT 49 3750 3750 211 166 x 0,75 = 125
1X
OT 205 6
RT 79 3750 3750 439 161 x 1,35 = 218
2X
OT 250 189
RT 54 3750 3750 164 101 x 0,85 = 86
3X
OT 155 9
RT 54 2750 2750 310 131 x 1,2 = 158
4Y
OT 185 125
RT 59 2750 2750 341 191 x 1,1 = 211
5Y
OT 250 91
RT 49 2750 2750 331 111 x 1,25 = 139
6Y
OT 160 171
RT 64 2250 2250 278 136 x 0,65 = 89
7Z
OT 200 78
RT 59 2250 2250 193 116 x 0,95 = 111
8Z
OT 175 18
RT 49 2250 2250 199 121 x 0,9 = 109
9Z
OT 170 29
Soal 2

Diketahui :

Permintaan = 10000 unit

Biaya Pesan = 109

Inventory Carrying Rate = 0,1

Ditanyakan :

EOQ optimal = ?

Penyelesaian :

0 < Q < 1000  EOQ =


√ I .C √
2. D . S = 2.10000 .109 = 1347,84
0 ,1.12

1000 < Q < 2000  EOQ =


√ I .C √
2. D . S = 2.10000 .109 = 1407,77
0 , 1.11

2000 < Q < 3000  EOQ =


√ I .C √
2. D . S = 2.10000 .109 = 1514,84
0 ,1.9 , 5

Q > 3000  EOQ =


√ I .C √
2. D . S = 2.10 000.109 = 1704,89
0 ,1.7 ,5
EOQ paling optimal saat Q > 3000.

Soal 3

Total Waktu = 4 + 10 + 5 + 2 + 6 + 5 + 10 + 2 + 5 + 8 = 57 menit

65
CT = = 0,077 menit/produk
2.7 .60
RPW

Elemen RPW
1 4/0,077 = 51,95
2 10/0,077 = 129,87
3 5/0,077 = 64,93
4 2/0,077 = 25,97
5 6/0,077 = 77,92
6 5/0,077 = 64,93
7 10/0,077 = 129,87
8 2/0,077 = 25,97
9 5/0,077 = 64,93
10 8/0,077 = 103,9
Jumlah 832,31

Balance Delay

Elemen RPW
1 (4-0,077)/0,077 = 50,95
2 (10-0,077)/0,077 = 128,87
3 (5-0,077)/0,077 = 63,93
4 (2-0,077)/0,077 = 24,97
5 (6-0,077)/0,077 = 76,92
6 (5-0,077)/0,077 = 63,93
7 (10-0,077)/0,077 = 128,87
8 (2-0,077)/0,077 = 24,97
9 (5-0,077)/0,077 = 63,93
10 (8-0,077)/0,077 = 102,9
Jumlah 730,24

SI =
√ ∑ ( SImax−SIi )2 =
n

√ 50 , 95+128 ,87 2+ 63 , 932+ 24 , 972 +76 , 922 +63 , 932 +128 , 872 +24 ,97 2+ 63 , 932+ 102, 92
10
SI = 81,13

Susunan RRW = 2-7-10-5-3-6-9-1-4-8

Legion Approach

1  2  4  5  8  9  10

3 67
Maka dapat dikelompokkan menjadi

WC 1 = 1-2-3-4

WC 2 = 5-6-7-8

WC 3 = 9-10

n .CT −∑ Ti 4−0,077
BD = = +¿
n . CT 0,077
10−0,077 5−0,077 2−0,077 6−0,077 5−0,077 10−0,077 2−0,077 5−0,077 8−0,077
+ + + + + + + +
0,077 0,077 0,077 0,077 0,077 0,077 0,077 0,077 0,077
= 730,24

SI =
√ ∑ ( SImax−SIi )2 =
n

√ 53 , 05 +134 ,13 2+66 ,57 2+26 ,03 2+ 80 ,08 2+ 66 ,57 2+ 134 , 132+ 26 , 032 +66 , 572 +107 , 122
2

10
SI = 84,46

Soal 4

Si -12 -23 -23 -15 -16 -19 8 9 30 21


Job 5 9 3 8 1 4 6 7 2 10
Ti 8 12 7 14 34 29 25 27 32 31
Mulai 0 8 20 27 41 75 104 129 156 183
Selesai 8 20 27 41 75 104 129 156 183 204
Tardy V X X X X X X X X V

Tardy Jobs = Job 5 dan Job 10

Makespan = 204

You might also like