subject

For each 1 <= i<= njob jiis given by two numbers diandpi, where diis the deadline and piis the penalty. The length of each job is equal to 1 minuteand once the job starts it cannot be stopped until completed. We want to schedule all jobs, but only one job can run at any given time. If job i does not complete on orbefore its deadline, we willpay its penalty pi. a)Design a greedy algorithm to find a schedule such that all jobs are completed and the sum of all penaltiesis minimized. Provide averbal description and pseudocode. b)What is the running time of your algorithm?

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 22.06.2019 10:20
Print "usernum1 is negative." if usernum1 is less than 0. end with newline. convert usernum2 to 0 if usernum2 is greater than 10. otherwise, print "usernum2 is less than or equal to 10.". end with newline
Answers: 3
question
Computers and Technology, 23.06.2019 17:30
Per the municipal solid waste report, what are the most common sources of waste (trash
Answers: 3
question
Computers and Technology, 23.06.2019 18:00
Which is a possible benefit of having a good credit history? having a checking account low interest rate on a car loan high interest rate on a credit card offer bankruptcy
Answers: 1
question
Computers and Technology, 23.06.2019 18:30
Janice recently received her college degree and is looking for a job. she is worried that since she just finished school, she will be required to repay her perkins and direct subsidized loans immediately. janice pulls out the paperwork she signed and reviews it again for repayment information. after reading all of the information, janice discovers that
Answers: 2
You know the right answer?
For each 1 <= i<= njob jiis given by two numbers diandpi, where diis the deadline and piis the...
Questions
question
Mathematics, 23.03.2020 05:25
Questions on the website: 13722363