Seven jobs have arrived to work center ldquo X dquo to be processed. Determine t
ID: 452647 • Letter: S
Question
Seven jobs have arrived to work center ldquo X dquo to be processed. Determine the sequence to process the jobs by applying each of the following rules: FCFS (First Come First Served) SPT (Shortest Processing Time) EDD (Earliest Due Date) Critical ratio (CR) Moore's algorithm For each of the sequences above, compute the following metrics of performance: The number of jobs that won't meet the due date The average job lateness, in days late/job The average flow time per job Summarize your results in a table; specify which is the sequence that optimizes each of the performance criteriaExplanation / Answer
Let us first apply priority to jobs on the basis of First Come First Served
JOB
JOBS IN SYSTEM
JOB TIME AT WORK CENTER “X” (DAYS)
CUMULATIVE FLOW TIME
DUE DATE (DAYS FROM NOW)
DIFFERENCE IN DELIVERY SCHEDULE
A
7
3
3
15
-
B
6
7
10
30
-
C
5
6
16
18
-
D
4
5
21
20
1
E
3
2
23
22
1
F
2
9
32
21
11
G
1
4
36
25
11
TOTAL
36
141
24
Let us now apply priority to jobs on the basis of Shortest Processing Time
JOB
JOBS IN SYSTEM
JOB TIME AT WORK CENTER “X” (DAYS)
CUMULATIVE FLOW TIME
DUE DATE (DAYS FROM NOW)
DIFFERENCE IN DELIVERY SCHEDULE
E
7
2
2
22
-
A
6
3
5
15
-
G
5
4
9
25
-
D
4
5
14
20
-
C
3
6
20
18
2
B
2
7
27
30
-
F
1
9
36
21
15
TOTAL
36
113
17
Let us now priority to jobs on the basis of earliest due date
JOB
JOBS IN SYSTEM
JOB TIME AT WORK CENTER “X” (DAYS)
CUMULATIVE FLOW TIME
DUE DATE (DAYS FROM NOW)
DIFFERENCE IN DELIVERY SCHEDULE
A
7
3
3
15
-
C
6
6
9
18
-
D
5
5
14
20
-
F
4
9
23
21
2
E
3
2
25
22
3
G
2
4
29
25
4
B
1
7
36
30
6
TOTAL
36
139
15
Let us now priority to jobs on the basis of critical ratio
The Slack time for each job is calculated as follows
JOB
JOB TIME AT WORK CENTER “X” (DAYS)
DUE DATE (DAYS FROM NOW)
SLACK TIME (DAYS)
CRITICAL RATIO
A
3
15
12
5
B
7
30
23
4.3
C
6
18
12
3
D
5
20
15
4
E
2
22
20
11
F
9
21
12
2.3
G
4
25
21
6.25
JOB
JOBS IN SYSTEM
JOB TIME AT WORK CENTER “X” (DAYS)
CUMULATIVE FLOW TIME
DUE DATE (DAYS FROM NOW)
DIFFERENCE IN DELIVERY SCHEDULE
F
7
9
9
21
-
C
6
6
15
18
-
D
5
5
20
20
-
B
4
7
27
30
-
A
3
3
30
15
15
G
2
4
34
25
9
E
1
2
36
22
14
TOTAL
36
171
38
Let us now priority to jobs on the basis of Moore’s Algorithm
Let E denotes set of early jobs and L denotes set of late jobs
Initially all jobs are set in E and L is empty
Order all jobs in set E as per EDD rule
Let 0 means non-tardy job and 1 means tardy job
As per sequence in set E there are 4 tardy jobs and 1st tardy job is F
JOB
JOBS IN SYSTEM
JOB TIME AT WORK CENTER “X” (DAYS)
CUMULATIVE FLOW TIME
DUE DATE (DAYS FROM NOW)
DIFFERENCE IN DELIVERY SCHEDULE
TARDY/NON TARDY JOBS
A
7
3
3
15
-
0
C
6
6
9
18
-
0
D
5
5
14
20
-
0
F
4
9
23
21
2
1
E
3
2
25
22
3
1
G
2
4
29
25
4
1
B
1
7
36
30
6
1
TOTAL
36
139
15
SET E (A-C-D-E-G-B)
SET L (F)
JOB
JOBS IN SYSTEM
JOB TIME AT WORK CENTER “X” (DAYS)
CUMULATIVE FLOW TIME
DUE DATE (DAYS FROM NOW)
DIFFERENCE IN DELIVERY SCHEDULE
TARDY/NON TARDY JOBS
A
6
3
3
15
-
0
C
5
6
9
18
-
0
D
4
5
14
20
-
0
E
3
2
16
22
-
0
G
2
4
20
25
-
0
B
1
7
27
30
-
0
TOTAL
36
89
FINAL SEQUENCE (A-C-D-E-G-B-F)
JOB
JOBS IN SYSTEM
JOB TIME AT WORK CENTER “X” (DAYS)
CUMULATIVE FLOW TIME
DUE DATE (DAYS FROM NOW)
DIFFERENCE IN DELIVERY SCHEDULE
A
7
3
3
15
-
C
6
6
9
18
-
D
5
5
14
20
-
E
3
2
16
22
-
G
2
4
20
25
-
B
1
7
27
30
-
F
4
9
36
21
15
TOTAL
36
125
15
Final results are summarized as under
JOB
JOBS IN SYSTEM
JOB TIME AT WORK CENTER “X” (DAYS)
CUMULATIVE FLOW TIME
DUE DATE (DAYS FROM NOW)
DIFFERENCE IN DELIVERY SCHEDULE
A
7
3
3
15
-
B
6
7
10
30
-
C
5
6
16
18
-
D
4
5
21
20
1
E
3
2
23
22
1
F
2
9
32
21
11
G
1
4
36
25
11
TOTAL
36
141
24
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.