Scribd
Upload
32 views10 pages

OM Assignment Solved

The document provides information about scheduling jobs in a job shop. It gives processing times and due dates for multiple jobs and compares the performance of different scheduling algorithms (FCFS, SPT, EDT, LFT) based on average flow time, tardiness, and number of tardy jobs. The document also provides a similar example with job costs and compares scheduling algorithms to minimize total cost.

Uploaded by

Jayesh W
Copyright
© © All Rights Reserved
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 views10 pages

OM Assignment Solved

The document provides information about scheduling jobs in a job shop. It gives processing times and due dates for multiple jobs and compares the performance of different scheduling algorithms (FCFS, SPT, EDT, LFT) based on average flow time, tardiness, and number of tardy jobs. The document also provides a similar example with job costs and compares scheduling algorithms to minimize total cost.

Uploaded by

Jayesh W
Copyright
© © All Rights Reserved
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/ 10

Q.

1 The following data are given for a single processor static job-shop:

Job 1 2 3 4 5 6
Processing time (days) 3 2 9 4 2 4
Due date (days) 17 21 5 12 15 24

Ans. Scheduling the job using 4 methods 1) FCFS 2) SPT 3) EDT 4) LFT
1) FCFS – Sequence is 1-2-3-4-5-6

Job Sequence Processing Flow time Due Date Job Tardiness


Time

1 3 3 17 0

2 2 5 21 0

3 9 14 5 9
4 4 18 12 6

5 2 20 15 5
6 4 24 24 0

Avg. flow time


= Sum of Flow time / No. of jobs
= 84/6
= 14 days

Tardiness = 20
Avg. Tardiness
= Total tardiness/ No. of jobs
= 20/6
= 3.33 days

2) SPT – Sequence is 5-2-1-4-6-3

Job Sequence Processing Flow time Due Date Job Tardiness


Time

5 2 2 15 0
2 2 4 21 0

1 3 7 17 0

4 4 11 12 0

6 4 15 24 0
3 9 24 5 19

Avg. flow time


= Sum of Flow time / No. of jobs
= 63/6
= 10.5 days

Tardiness = 19
Avg. Tardiness
= Total tardiness/ No. of jobs
= 19/6
= 3.17 days

3) EDD – Sequence is 3-4-5-1-2-6

Job Sequence Processing Flow time Due Date Job Tardiness


Time

3 9 9 5 4

4 4 13 12 1
5 2 15 15 0

1 3 18 17 1
2 2 20 21 0

6 4 24 24 0

Avg. flow time


= Sum of Flow time / No. of jobs
= 99/6
= 16.5 days

Tardiness = 6
Avg. Tardiness
= Total tardiness/ No. of jobs
= 6/6
= 1 day

4) LFT – Sequence is 3-4-5-1-2-6

Job Sequence Processing Flow time Due Date Job Tardiness


Time
3 9 9 5 4
4 4 13 12 1

6 4 17 24 0

1 3 20 17 3

5 2 22 15 7

2 2 24 21 3

Avg. flow time


= Sum of Flow time / No. of jobs
= 105/6
= 17.5 days

Tardiness = 18
Avg. Tardiness
= Total tardiness/ No. of jobs
= 18/6
= 3 days

a) Schedule that minimizes avg. flow time is SPT – Avg. flow time is 10.5 days
b) Schedule minimizing maximum tardiness is EDD. Maximum Tardiness is 3.33 days
c) Schedule minimizing number of tardy jobs is SPT, there is 1 tardy job in this schedule

Q.2 A job shop incurs a cost of C dollars per day a job remains in the shop. At the beginning
of a month, there are five jobs in the shop. The data for these jobs are given below:

Job 1 2 3 4 5
Processing time (days) 5 3 10 2 4
Due date (days) 10 15 20 9 7

Ans.

1) FCFS – Sequence is 1-2-3-4-5

Job Processing Flow time Due Date Job Cost Total


Sequence Time Tardiness Cost

1 5 5 10 0 30 150
2 3 8 15 0 10 80
3 10 18 20 0 20 360

4 2 20 9 11 5 100

5 4 24 7 17 50 1200

Total Flow time = 75 days


Total Cost = 75*50 = $3750

2) SPT – Sequence is 4-2-5-1-3

Job Processing Flow time Due Date Job Total


Cost
Sequence Time Tardiness Cost

4 2 2 9 0 5 10

2 3 5 15 0 10 50

5 4 9 7 2 50 450

1 5 14 10 4 30 420

3 10 24 20 4 20 480

Total Flow time = 54 days


Total Cost = 54*50 = $2700

3) EDD – Sequence is 5-4-1-2-3

Job Processing Flow time Due Date Job Total


Cost
Sequence Time Tardiness Cost

5 4 4 7 0 50 200

4 2 6 9 0 5 30

1 5 11 10 1 30 330
2 3 14 15 0 10 140

3 10 24 20 4 20 480

Total Flow time = 59 days


Total Cost = 59*50 = $2950

4) LFT – Sequence is 3-1-5-2-4

Job Processing Flow time Due Date Job Total


Cost
Sequence Time Tardiness Cost

3 10 10 20 0 50 200
1 5 15 10 5 5 30

5 4 19 7 12 30 330

2 3 22 15 7 10 140
4 2 24 9 15 20 480

Total Flow time = 90 days


Total Cost = 90*50 = $4500

a) SPT schedule will minimize total cost - $2700


b) EDD Schedule will minimize cost
Q.3 Our Computer Centre has some jobs from outside and these are due in the next few days.
An Assistant of the Centre has been assigned these jobs. The pertinent data are given below:

Job 1 2 3 4 5 6
Processing time (days) 5 4 3 1 1/2 2
Due in (days) 11 10 16 2 1 3

1) FCFS – Sequence is 1-2-3-4-5-6

Job Sequence Processing Time Flow time Due Date Job Tardiness
1 5 5 11 0
2 4 9 10 0
3 3 12 16 0
4 1 13 2 11
5 0.5 13.5 1 12.5
6 2 15.5 3 12.5

2) SPT – Sequence is 5-4-6-3-2-1

Job Sequence Processing Flow time Due Date Job Tardiness


Time
5 0.5 0.5 1 0

4 1 1.5 2 0

6 2 3.5 3 0.5

3 3 6.5 16 0

2 4 10.5 10 0.5
1 5 15.5 11 4.5

3) EDD – Sequence is 5-4-6-2-1-3

Job Sequence Processing Flow time Due Date Job Tardiness


Time

5 0.5 0.5 1 0
4 1 1.5 2 0

6 2 3.5 3 0.5
2 4 7.5 10 0

1 5 12.5 11 1.5

3 3 15.5 16 0

4) LFT – Sequence is 1-2-3-6-4-5

Job Sequence Processing Flow time Due Date Job Tardiness


Time

1 5 5 11 0
2 4 9 10 0

3 3 12 16 0

6 2 14 3 11
4 1 15 2 13

5 0.5 15.5 1 14.5

a) Since all schedules have tardiness, the assistant cannot finish all her jobs on time
b) The assistant should follow EDD Schedule while completing these jobs since the tardiness for
the jobs is the lowest in this schedule

c) The assistant should follow SPT since the reward is highest i.e. Rs. 50

FCFS
Job Job
Processin Flow Due Difference Penalty/Rewar
Sequenc Tardines
g Time time Date in due date d
e s
1 5 5 11 0 -6 60
2 4 9 10 0 -1 10
3 3 12 16 0 -4 40
4 1 13 2 11 11 -110
5 0.5 13.5 1 12.5 12.5 -125
6 2 15.5 3 12.5 12.5 -125
68 36 -250
SPT
Job Job
Processin Flow Due Difference Penalty/Rewar
Sequenc Tardines
g Time time Date in due date d
e s
5 0.5 0.5 1 0 -0.5 5
4 1 1.5 2 0 -0.5 5
6 2 3.5 3 0.5 0.5 -5
3 3 6.5 16 0 -9.5 95
2 4 10.5 10 0.5 0.5 -5
1 5 15.5 11 4.5 4.5 -45
38 5.5 50

EDD
Job Processing Flow Due Job Difference
Penalty/Reward
Sequence Time time Date Tardiness in due date
5 0.5 0.5 1 0 -0.5 5
4 1 1.5 2 0 -0.5 5
6 2 3.5 3 0.5 0.5 -5
2 4 7.5 10 0 -2.5 25
1 5 12.5 11 1.5 1.5 -15
3 3 15.5 16 0 -0.5 5
41 2 20
LFT
Job Job
Processin Flow Due Difference Penalty/Rewar
Sequenc Tardines
g Time time Date in due date d
e s
1 5 5 11 0 -6 60
2 4 9 10 0 -1 10
3 3 12 16 0 -4 40
6 2 14 3 11 11 -110
4 1 15 2 13 13 -130
5 0.5 15.5 1 14.5 14.5 -145
70.5 38.5 -275

d) EDD schedule should be followed since the penalty is minimum i.e. Rs. -10
FCFS
Job Job
Processin Flow Due Penalty/Rewar
Sequenc Tardines
g Time time Date d
e s
1 5 5 11 0 0
2 4 9 10 0 0
3 3 12 16 0 0
4 1 13 2 11 -110
5 0.5 13.5 1 12.5 -125
6 2 15.5 3 12.5 -125
68 36 -360

SPT
Job Job
Processin Flow Due Penalty/Rewar
Sequenc Tardines
g Time time Date d
e s
5 0.5 0.5 1 0 0
4 1 1.5 2 0 0
6 2 3.5 3 0.5 -5
3 3 6.5 16 0 0
2 4 10.5 10 0.5 -5
1 5 15.5 11 4.5 -45
38 5.5 -55

EDD
Job Job
Processin Flow Due Penalty/Rewar
Sequenc Tardines
g Time time Date d
e s
5 0.5 0.5 1 0 0
4 1 1.5 2 0 0
6 2 3.5 3 0.5 -5
2 4 7.5 10 0 0
1 5 12.5 11 1.5 -15
3 3 15.5 16 0 0
41 2 -20
LFT
Job Job
Processin Flow Due Penalty/Rewar
Sequenc Tardines
g Time time Date d
e s
1 5 5 11 0 0
2 4 9 10 0 0
3 3 12 16 0 0
6 2 14 3 11 -110
4 1 15 2 13 -130
5 0.5 15.5 1 14.5 -145
70.5 38.5 -385

You might also like