Joined
Last Seen
0 Reputation Points
Unknown Quality Score
No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
0 Endorsements
Ranked #107.40K
~9K People Reached
Favorite Forums
Computer Science
x
1
|
The problem of scheduling unit-time tasks with deadlines and penalities for a single processor has following inputs S={a1,a2,...,an} of n unit-time task. A unit-time task requires exactly 1 unit of time to complete deadlines d1,d2,...,dn, 1<=di<=n penalities w1,w2,...,wn. A penality wi is incurred if task ai is not finished by …
|