Scribd
Upload
32 views4 pages

Assignment 08

The document contains information about four scheduling problems: 1) It provides the processing times and due dates for four trucks and calculates the mean flow time and tardiness for different scheduling algorithms. 2) It lists the processing times and due dates for eight jobs and determines the optimal job sequence based on precedence constraints. 3) It provides processing times for four jobs on three machines and determines the minimum completion times and optimal sequence. 4) It shows a Gantt chart with job processing on three machines and identifies the optimal solution as the one with the lowest maximum completion time.

Uploaded by

Zareen Khan
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 PDF, TXT or read online on Scribd
32 views4 pages

Assignment 08

The document contains information about four scheduling problems: 1) It provides the processing times and due dates for four trucks and calculates the mean flow time and tardiness for different scheduling algorithms. 2) It lists the processing times and due dates for eight jobs and determines the optimal job sequence based on precedence constraints. 3) It provides processing times for four jobs on three machines and determines the minimum completion times and optimal sequence. 4) It shows a Gantt chart with job processing on three machines and identifies the optimal solution as the one with the lowest maximum completion time.

Uploaded by

Zareen Khan
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 PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment # 08

Question 4 Page 425 truck 1 2 3 4 Unloading time 20 14 35 10 Time material is Due 25 45 50 30

FCFS basis
truck Unloading time Completion time Time material is Due Tardiness Mean flow time 50.5

1 2 3 4

20 14 35 10

20 34 69 79

25 45 50 30

0 Average Tardiness 0 Number of tardy jobs 19 49

17 2

Short processing time


Truck Unloading time completion time Time material is Due Tardiness

4 2 1 3

10 14 20 35

10 24 44 79

30 45 25 50

Mean flow time 39.25 0 Average Tardiness 12 0 Number of tardy jobs 2 19 29

Earliest Due time


truck Unloading time Completion time Time material is Due Tardiness

1 4 2 3

20 10 14 35

20 30 44 79

25 30 45 50

Mean flow time 43.25 0 Average Tardiness 7.25 0 Number of tardy jobs 1 0 29

Critical ratio method Using critical ratio method, we obtained the following sequence
truck Unloading time Completion time Time material is Due Tardiness Mean flow time 48.5

1 4 3 2

20 10 35 14

20 30 65 79

25 30 50 45

0 Average Tardiness 0 Number of tardy jobs 14 34

12 2

Question 8
job processing time Due date 1 2 5 2 3 4 3 2 13 4 1 6 5 4 12 6 3 10 7 2 15 8 2 19

Precedence sequence 2-6-3, 1-4-7-8 We select jobs that are not predecessor of other jobs that is job 3, job 5 and job 8. T= (2+3+2+1+4+3+2+2+2)=19 Now for 8th position, we have: 3, 5, 8 Max (13, 12, 19), hence job 8 is at 8th position. T=19-2=17 Now for 7th position, we have 3, 5, 7 Max (13, 12, 15), hence job 7 is at 7th position T=17-2=15 Now for 6th position we have 3, 4 , 5 Max (13,6,12), hence job 3 is at 6th position T=15-2=13 Now for 5th position, we have 4, 5, 6 Max (6, 12, 10) , hence job 5 is at 5 th position T=13-4=9 Now for 4th position, we have 4 , 6 Max (6, 10) , hence job 6 at 4th position T=9-3=6 Now for 3rd position we have 2, 4 Max (4,6), hence job 4 is at 3rd position T=6-1=5 Now for 2nd position we have 1, 2 Max (5,4), hence job 1 is at 2nd position And job 2 is at 1st position Hence the final sequence is = 2-1-4-6-5-3-7-8

Question 14

job 1 2 3 4

A 4 2 6 3

machine B 2 3 5 4

C 6 7 6 8

minAi maxBi MinCi job 1 2 3 4

2 5 6 machine B' 8 10 11 12

A' 6 5 11 7

Sequence 2 1 4 3

Machine A Machine B Machine C


1 2 3 4 5 6 7 8 9 10 12 14 19

25

30

32

Question 17

Based on the Gantt chart above the optimal solution is solution 1, which has less maximum to complete

You might also like