Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Consider the problem of scheduling n jobs with processing times p1pn on m identical machines to minimize completion time. We know that the greedy (list
Consider the problem of scheduling n jobs with processing times p1pn on m identical machines to minimize completion time. We know that the greedy (list scheduling) algorithm is a (4/3)(1/3m) approximation algorithm. The proof of this result contains a detailed case analysis. This problem is about giving a much simpler proof of a weaker result. Show that the same algorithm is a 3/2-approximation algorithm. Start with proving the following claim. Let us assume that job j finishes last and its machine has at least two jobs. Then jm+1 and pjpm+1OPT/2
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started