HOMEWORK CHAPTER 15: 

GROUP 6: 
List of members: 

1. Nguyễn Thị Thu Hiền- BABAWE20055

2. Đặng Nguyễn Minh Thư- BABAIU19333 
3. Trần Nguyễn Lâm Vy- BABAWE20215 
4. Nguyễn Phan Ái Vy- BABAWE20023 
5. Phạm Ngọc Linh- BABAWE20057 
6. Nguyễn Thị Thiện Ý-BABAUH20048 
7. Phan Dương Tú Anh- BABAWE20175

Homework:

15.2

a. Step 1: To convert the problem as minimization we reduce the matrix by

subtracting all entry by the largest value , that is 11

Job Machine
A B C D
1 4 2 3 1
2 1 2 4 5
3 0 6 2 5
4 2 0 6 3

Using the above table, because it table show the productivity of each
machine, we will substract smallest number in the row from every number
in the row. The result is shown in the below table:

Job Machine
A B C D
1 3 1 2 0
2 0 1 3 4
3 0 6 2 5
4 2 0 6 3

Then, using the below table, substract the smallest number in each
column from every number in the column. The result is shown in the
below table:

Job Machine
A B C D
 1 2 1 0 0
2 0 1 1 4
3 0 6 0 5
4 2 0 4 3

Step 2: Draw the minimum number of vertical and horizontal

straight lines needed to cover all zeros.

Job Machine
A B C D
1 2 1 0 0
2 0 1 1 4
3 0 6 0 5
4 2 0 4 3
Because the number of line equal to the number of column, an
optimal assignment can be made. Assign Job 1 to Machine D , Job 2 to
Machine A , Job 3 to machine C , Job 4 to machine B

b. The total production will be: 10+10+9+11= 40 units

15.5

a. FCFS has the sequence A-B-C-D-E

Job Sequence Job Work Flow time Job Due Job Lateness
Time Date
A 8 8 313 0
B 16 24 312 0
C 40 64 325 14
D 5 69 314 30
E 3 72 314 33
72 237 77

Job Lateness will be calculate: (275+ Flow time) - Job Due Date
- Avegage Completion Time¿
∑ of total flow time = 237 =47.4
Number of Jobs 5
Total job Work time 72
- Utilization Metric = = =30.3 %
∑ of total Flow time 237
- Average number of jobs in the system=
∑ of total flow time =
237
=3.29 Jobs
Total job work ( processing ) time 72
Total late days 77
- Average job lateness = = =15.4 days
Number of jobs 5
b. The E-D-A-B-C sequence is the result of the SPT rule stated in the following
table. Orders are placed in order of processing time, with the shortest
work receiving the highest priority.

Job Sequence Job Work Flow time Job Due Job Lateness
Time Date
E 3 3 314 0
D 5 8 314 0
A 8 16 313 0
B 16 32 312 0
C 40 72 325 22
72 131 22

Job Lateness will be calculate: (275+ Flow time) - Job Due Date
- Avegage Completion Time¿
∑ of total flow time = 131 =26.5 days
Number of Jobs 5
Total job Work time 72
- Utilization Metric = = =54.96 %
∑ of total Flow time 131
- Average number of jobs in the system=
∑ of total flow time 131
= =1.82 Jobs
Total job work ( processing ) time 72
Total late days 22
- Average job lateness = = =4.4 days
Number of jobs 5
c. The EDD rule gives the sequence B-A-D-E-C in the table below. Take note
that jobs are listed in order of earliest due date first.

Job Sequence Job Work Flow time Job Due Job Lateness
Time Date
B 16 16 312 0
A 8 24 313 0
D 5 29 314 0
E 3 32 314 0
C 40 72 325 22
72 173 22

- Avegage Completion Time¿

∑ of total flow time = 173 =34.6 days
Number of Jobs 5
Total job Work time 72
- Utilization Metric = = =41.62 %
∑ of total Flow time 173
- Average number of jobs in the system=
∑ of total flow time =
173
=2.4 Jobs
Total job work ( processing ) time 72
 Total late days 22
- Average job lateness = = =4.4 days
Number of jobs 5
d. The LPT rule shown in the next table results in the order C-B-A-D-E.
Orders are placed in order of processing time, with the longest work
receiving the highest priority.

Job Sequence Job Work Flow time Job Due Job Lateness
Time Date
C 40 40 325 0
B 16 56 312 19
A 8 64 313 26
D 5 69 314 30
E 3 72 314 33
72 301 108

- Avegage Completion Time¿

∑ of total flow time = 301 =60.2
Number of Jobs 5
Total job Work time 72
- Utilization Metric = = =23.92%
∑ of total Flow time 301
- Average number of jobs in the system=
∑ of total flow time =
301
=4.18 Jobs
Total job work ( processing ) time 72
Total late days 108
- Average job lateness = = =21.6 days
Number of jobs 5
The results of these four rules are summarized in the following table:

Rules Avegage Utilization Average Average job

Completion Metric % number of lateness
Time (Days) jobs in the (Days)
system
FCFS 47.4 30.3 3.29 15.4
SPT 26.5 54.96 1.82 4.4
EDD 34.6 41.62 2.4 4.4
LPT 60.2 23.92 4.18 21.6

From the resulting table, the SPT decision rules is the best. This is because
it can optimize in 3 measures the average completion time and utilzation
metric and average job lateness, while SPT is superior in average number
of jobs in the system and Average job lateness
15.7

15.8

For this problem, Assignment method is applied.

Step 1:
Using the given table, we will substract smallest number in the row from
every number in the row. The result is shown in the below table:
 Electronic Plant
Componen 1 2 3 4
t
C53 0 0.02 0.03 0.01
C81 0.01 0.02 0 0.04
D5 0.02 0.1 0.01 0
D44 0.03 0 0.05 0.01

Then, using the below table, substract the smallest number in each
column from every number in the column. The result is shown in the
below table:

Electronic Plant
Componen 1 2 3 4
t
C53 0 0.02 0.03 0.01
C81 0.01 0.02 0 0.04
D5 0.02 0.1 0.01 0
D44 0.03 0 0.05 0.01

Step 2: Draw the minimum number of vertical and horizontal

straight lines needed to cover all zeros.

Electronic Plant
Componen 1 2 3 4
t
C53 0 0.02 0.03 0.01
C81 0.01 0.02 0 0.04
D5 0.02 0.1 0.01 0
D44 0.03 0 0.05 0.01

Because the number of line equal to the number of column, an

optimal assignment can be made. Assign C53 to Plant 1, C81 to Plant 3 , D5
to Plant 4, D44 to Plant 2.

The total Cost will be: = 0.10 + 0.04 + 0.3 + 0.14 = $0.58

15.12

Below is the game compatibility matrix –

  Barbara Donna Stella Jackie

Raul 30 20 10 40

Jack 70 10 60 70

Gray 40 20 50 40

Ajay 60 70 30  

The best pairs based on the scores include -

Jack and Barbara with a score of 70

Jack and Jackie with a score of 70

Ajay and Donna with a score of 70

15.17

a. In order to have the optimal sequence for the jobs, the four steps of
Johnson’s rule is applied.
1. T, in Binding, has the shortest processing time (with a time of 2 hours).
Schedule T comes last because it is in the second sequence. Remove it
from consideration.

T
2. The succeeding shortest job is a tie (at 4 hours). We can start with V,
which was on the printing. So, we schedule it first. Then Y is moved to
the next position in the sequence. Eliminate them from consideration

V Y T
3. The next shortest time is job W(6 hours) on the Binding. Therefore, it is
placed as late as possible.

V Y W T
4. For the following shortest task, there is a tie (at 7 hours). U, which was
on the first work center, can be put it as soon as possible . Z is then
moved up to the following sequencing position.
 V Y U Z W T
5. The last shortest time is job X, with 9 hours in Binding. It will be placed
in the last sequencing postiton.

V Y U Z X W T

The above table shows the optimal squence for the jobs
b. The sequential times for these jobs through two work centers are

Printing 4 4 7 7 10 7 15
Binding 10 5 9 8 9 6 3
The below chart illustrates these jobs through two work centers
Time 0 4 8 15 22 32 39 54

Printin V Y U Z X W T
g 57
Bindin V Y U Z X W T
g
Time 0 4 14 19 28 36 45 51 54

V Y U Z X W T

= Idle = Job completed

c. The total length of time of this optimal solution will be 57 hours

d. Given the optimal solution, the idle time in binding shop will be
57 - (10+5+9+8+9+6+3)= 7 hours
e. If Job Z is splitting in half in binding machine, we have the table shows the
optimal squence for the jobs

V Y U X W Z T

The sequential times for these jobs through two work centers are

Printing 4 4 7 10 7 7 15
Binding 10 5 9 9 6 4 3

The below chart illustrates these jobs through two work centers
Time 0 4 8 15 25 32 39 54

Printin V Y U X W Z T
g 57
Bindin V Y U X W Z T
 g
Time 0 4 14 19 28 37 43 47

V Y U X W T
Z

= Idle = Job completed

The idle time in binding shop would be 57- (4+10+5+9+9+6+3)= 11

hours when Job Z is splitting in half in binding machine.