Assignment on Job Sequencing with Deadlines Using Greedy Method
Assignment on Job Sequencing with Deadlines Using
Greedy Method
1.What is Job
Sequencing with Deadlines problem? Let n=5, profits[10,3,33,11,40] and
deadlines[3,1,1,2,2] respectively. Find the optimal solution using Greedy
.
2.
Four Jobs with following deadlines and profits Find the optimal
solution using greedy method.
|
JobID
|
Deadline
|
Profit
|
|
A
|
4
|
20
|
|
B
|
1
|
10
|
|
C
|
1
|
40
|
|
D
|
1
|
30
|
3. Consider the following 5 jobs and their associated deadline and
profit.And Find optimal job sequence
|
JOB
|
j1
|
j2
|
j3
|
j4
|
j5
|
|
DEADLINE
|
2
|
1
|
3
|
2
|
1
|
|
PROFIT
|
60
|
100
|
20
|
40
|
20
|
In Above Q. no.3 ,
ReplyDeleteNote! If two or more jobs are having the same profit then sort them as per their entry in the job list.
Is is right ma'am?