Scribd
Upload
16 views5 pages

Job Scheduling Analysis: FCFS, SPT, EDD

1. The document presents scheduling data for 5 jobs under different scheduling algorithms: First Come First Served (FCFS), Shortest Processing Time (SPT), and Earliest Due Date (EDD). 2. Key metrics are reported for each algorithm, including makespan, average flow time, average early/late time. EDD scheduling has the lowest average flow time of 31.6 hours. 3. The scheduling algorithms prioritize jobs based on order of arrival, processing time, and date/time of delivery respectively. EDD gives priority to the job with the earliest due date.

Uploaded by

Louis Sekuba
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
16 views5 pages

Job Scheduling Analysis: FCFS, SPT, EDD

1. The document presents scheduling data for 5 jobs under different scheduling algorithms: First Come First Served (FCFS), Shortest Processing Time (SPT), and Earliest Due Date (EDD). 2. Key metrics are reported for each algorithm, including makespan, average flow time, average early/late time. EDD scheduling has the lowest average flow time of 31.6 hours. 3. The scheduling algorithms prioritize jobs based on order of arrival, processing time, and date/time of delivery respectively. EDD gives priority to the job with the earliest due date.

Uploaded by

Louis Sekuba
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd

First Come First Served:

prioritizing job according to order of arrival.


Time Since Estimated Due Date Actual
Beginning Finishing Hours
Order Arrival Processing (hrs from Pick Up
time (hrs) Time (hrs) Early
(hrs) Time (hrs) Now) Time
1 12 0 10 10 12 12 2
2 10 10 3 13 8 13 0
3 7 13 15 28 15 28 0
4 3 28 9 37 20 37 0
5 1 37 7 44 21 44 0

FCFS
Hours
1 2 3 4 5 6 7 8
11 12 13 14 15 16 17 18
21 22 23 24 25 26 27 28
31 32 33 34 35 36 37 38
41 42 43 44

Makespan = 44 Hours
Orders 1 2 3 4 5

FCFS
Average Flow Time 22+23+35+40+45/5 = 33
Average Early Time 2+0+0+0+0/5 = 0.4
Average Late Time 0+5+13+17+23/5 = 11.6
Shortest Processing Time:
Time Since Estimated prioritizingDue
jobsDate
according to processing time.
Actual
Beginning Finishing Hours
Order Arrival Processing (hrs from Pick Up
time (hrs) Time (hrs) Early
2 (hrs)10 0 Time (hrs)
3 3 Now)8 Time8 5

5 1 3 7 10 21 10 11
4 3 10 9 19 20 19 1
1 12 19 10 29 12 29 0
3 7 29 15 44 15 44 0

SPT
Hours
1 2 3 4 5 6 7 8
11 12 13 14 15 16 17 18
21 22 23 24 25 26 27 28
31 32 33 34 35 36 37 38
41 42 43 44

Makespan = 44 Hours
Orders 1 2 3 4 5
SPT
Average Flow Time 13+11+22+41+51/5 = 27.6
Average Early Time 5+11+1+0+0/5 = 3.4
Average Late Time 0+0+0+17+29/5 = 9.2
Earliest Due Date:
prioritizing job according to date/time of delivery.

Time Since Estimated Due Date Actual


Beginning Finishing Hours
Order Arrival Processing (hrs from Pick Up
time (hrs) Time (hrs) Early
(hrs) Time (hrs) Now) Time

2 10 0 3 3 8 12 5
1 12 3 10 13 12 13 0
3 7 13 15 28 15 28 0
4 3 28 9 37 20 37 0
5 1 37 7 44 21 44 0
EDD
Hours
1 2 3 4 5 6 7 8
11 12 13 14 15 16 17 18
21 22 23 24 25 26 27 28
31 32 33 34 35 36 37 38
41 42 43 44

Makespan = 44 Hours
Orders 1 2 3 4 5

EDD
Average Flow Time 13+25+35+40+45/5 = 31.6
Average Early Time 5+0+0+0+0/5 = 1
Average Late Time 0+1+13+17+23/5 = 10.8
er of arrival.
Hours
Flow
Past
Time
Due
0 22
5 23
13 35
17 40
23 45

9 10
19 20
29 30
39 40

ocessing time.
Hours
Flow
Past
Time
Due 0 13

0 11
0 22
17 41
29 51

9 10
19 20
29 30
39 40
of delivery.

Hours
Flow
Past
Time
Due

0 13
1 25
13 35
17 40
23 45

9 10
19 20
29 30
39 40
Time
Estimated Due Date
Since
Order Processin (hrs from
Arrival
g Time Now)
(hrs)
(hrs)
1 12 10 12
2 10 3 8
3 7 15 15
4 3 9 20
5 1 7 21

You might also like