subject

We are given as input a set of n jobs, where job j has a processing time pj, a deadline dj. Given a schedule (i. e., an ordering of the jobs), consider that each job j has the completion time C; we define the lateness l of job j as the amount of time C - d, after its deadline that the job completes, or as 0 if C; < dj. Our goal is to minimize the maximum lateness, maxlj. Consider the following greedy rules for producing an ordering that minimizes the maximum lateness. For each rule, please explain why it gives the optimal ordering or give a counterexample. You can assume that all processing times and dead- lines are distinct.
(a) Schedule the requests in increasing order of processing time Pj.
(b) Schedule the requests in increasing order of the product d; * Pj.
(c) Schedule the requests in increasing order of deadline di.

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 23.06.2019 06:00
When is a chart legend used a. all the time b. whenever you are comparing data that is the same c. whenever you are comparing multiple sets of data d. only for hand-drawn charts
Answers: 2
question
Computers and Technology, 24.06.2019 15:30
Python. primary u.s. interstate highways are numbered 1-99. odd numbers (like the 5 or 95) go north/south, and evens (like the 10 or 90) go east/west. auxiliary highways are numbered 100-999, and service the primary highway indicated by the rightmost two digits. thus, the 405 services the 5, and the 290 services the 90. given a highway number, indicate whether it is a primary or auxiliary highway. if auxiliary, indicate what primary highway it serves. also indicate if the (primary) highway runs north/south or east/west.
Answers: 1
question
Computers and Technology, 24.06.2019 23:30
What is the opening page of a website called? a. web page b. landing page c. homepage d. opening page
Answers: 1
question
Computers and Technology, 25.06.2019 03:30
What best describes the purpose of occupational safety and health administration
Answers: 1
You know the right answer?
We are given as input a set of n jobs, where job j has a processing time pj, a deadline dj. Given a...
Questions
question
English, 07.09.2021 19:40
question
Mathematics, 07.09.2021 19:40
question
English, 07.09.2021 19:40
Questions on the website: 13722362