Register

job scheduling

• retagged by
2,368 views

3 Answers

Best answer
1 votes
1 votes

DEADLINE   1        2       3         4           5         6       7        8

JOB               J3      J7     J4       J5        J6        J1     J2      J8

PROFIT        15       29    17        16        24        21     0        0

max profit is(15+29 + 17+16+24+21 )=122

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
iita asked Dec 16, 2016
689 views
machine scheduling problem
User Avatar
4 votes
4 votes
3 answers
2
Lakshman Bhaiya asked Nov 10, 2018
12,529 views
Job Sequencing Problem (Greedy Algorithm)
If job $J=(J_{1},J_{2},J_{3},J_{4})$ are given their processing time $T_{i}=(1,1,2,3)$ and deadline are $D_{i}=(3,4,2,3)$ maximum how many job can be done$?$ $A)1$ $B)2$ $C)3$ $D)All$
If job $J=(J_{1},J_{2},J_{3},J_{4})$ are given their processing time $T_{i}=(1,1,2,3)$ and deadline are $D_{i}=(3,4,2,3)$ maximum how many job can be done$?$$A)1$ ...
User Avatar
Link Copied!