Consider the following scheduling problem: we have two machines, and a set of jobs j1, j2,...
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
Consider the following scheduling problem: we have two machines, and a set of jobs j1, j2, j3,. jn that we have to process one at a time. To process a job, we place it on a machine. Each job j; has an associated running time r;. The load on the machine is the sum of the running times of the jobs placed on it. The goal is to minimize the completion time, which is the maximum load over all machines. Suppose we adopt a greedy algorithm: each job j; is put on the machine with the minimum load after the first i- 1 jobs. (Ties can be broken arbitrarily.) Show that this strategy yields a completion time within a factor of 3/2 of the best possible placement of jobs. (Hint: Think of the best possible placement of jobs. Even for the best placement, the completion time is at least as big as the biggest job, and at least as big as half the sum of the jobs. You may want to use both of these facts.) Give an example where a factor of 3/2 is achieved. Suppose now instead of 2 machines we have m machines. What is the performance of the greedy solution, compared to the optimal, as a function of m? Give a family of examples (that is, one for each m if they are very similar, it will be easier to write down!) where the factor separating the optimal and the greedy solutions is as large as you can make it. Consider the following scheduling problem: we have two machines, and a set of jobs j1, j2, j3,. jn that we have to process one at a time. To process a job, we place it on a machine. Each job j; has an associated running time r;. The load on the machine is the sum of the running times of the jobs placed on it. The goal is to minimize the completion time, which is the maximum load over all machines. Suppose we adopt a greedy algorithm: each job j; is put on the machine with the minimum load after the first i- 1 jobs. (Ties can be broken arbitrarily.) Show that this strategy yields a completion time within a factor of 3/2 of the best possible placement of jobs. (Hint: Think of the best possible placement of jobs. Even for the best placement, the completion time is at least as big as the biggest job, and at least as big as half the sum of the jobs. You may want to use both of these facts.) Give an example where a factor of 3/2 is achieved. Suppose now instead of 2 machines we have m machines. What is the performance of the greedy solution, compared to the optimal, as a function of m? Give a family of examples (that is, one for each m if they are very similar, it will be easier to write down!) where the factor separating the optimal and the greedy solutions is as large as you can make it.
Expert Answer:
Answer rating: 100% (QA)
Step 1 of 7 a In the best case each job has its own machine ... View the full answer
Related Book For
Posted Date:
Students also viewed these mathematics questions
-
Produce use case diagrams and a set of associated sequence diagrams for the DreamHome case study documented in Appendix A.
-
Produce use case diagrams and a set of associated sequence diagrams for the University Accommodation Office case study documented in Appendix B.1.
-
Produce use case diagrams and a set of associated sequence diagrams for the Easy Drive School of Motoring case study documented in Appendix B.2.
-
If the arch rib \(A B C D E\) in Figure \(\mathrm{P} 6.30\) is to be funicular for the dead loads shown at the top joints, establish the elevation of the lower chord joints at \(B\) and \(D\). 40...
-
Water at a pressure of 250 psia has a quality of 0.4. Determine the temperature, the average internal energy, and the average enthalpy for this mixture. Use the steam tables.
-
A truck for hauling coal has an estimated net cost of $85,000 and is expected to give service for 250,000 miles, resulting in a salvage value of $5,000. Compute the allowed depreciation amount for...
-
Stone Brewing Co. is a San Diego brewer that has sold its beers for over two decades. Stone has maintained its trademark and brand from the beginning, registering the STONE mark in 1998. Stone has...
-
Depreciation ComputationReplacement, Nonmonetary Exchange Goldman Corporation bought a machine on June 1, 2008, for $31,800, f.o.b. the place of manufacture. Freight to the point where it was set up...
-
A clinical resear would like to know if his diet program is effective in lowering patients blood pressure. The following patient. Blood pressure before diet blood pressure after diet 1. 15. 12 2. 15....
-
You are a CPA student working in the accounting department of Reynolds Liquor Distributors Ltd. (RLDL) for the year ended December 31, 2019. Your role requires you to prepare and analyze the annual...
-
If a time-invariant dynamical system presents complex eigenvalues with negative real part. What is the nature of your time response. x2 Ix
-
Explain at least one risk control procedures that you would follow for the hazards listed out in the table below Hazards Risk control procedures (at least one) Slip hazards while working on scaffolds...
-
does the principle of diminishing marginal rate of substitution depend on the diminishing marginal utility of X and Y?
-
What is the break event point for the following costs fixed operating cost $156,917 per mouth, variable operating cost $16583, average price $90? Explain briefly
-
Could you elucidate the Thomas theorem and elaborate on its implications regarding our understanding of reality?
-
How do you ask for help with your partner for money in paying rent? Explain
-
According to the College Board, the average in-state tuition and fees at public 4-year colleges and universities increased from $1780 in 1990 to $10,560 for the 20202021 school year (per full-time...
-
Explain the differences and similarities between fringe benefits and salary as forms of compensation.
-
Prove that the class of decidable languages is not closed under homomorphism.
-
Use the result of Problem 6.21 to give a function f that is computable with an oracle for A TM , where for each n, f(n) is an incompressible string of length n. Problem 6.21 Show how to compute the...
-
Let INFINITE PDA = {M| M is a PDA and L(M) is an infinite language}. Show that INFINITE PDA is decidable.
-
The Milham Theatre Club has been in existence for a number of years. Members pay an annual subscription of 15 which entitles them to join trips to professional productions at a reduced rate. On 1...
-
The accounting records of the Happy Tickers Sports and Social Club are in a mess. You manage to find the following information to help you prepare the accounts for the year to 31 December 2015. (1)...
-
A business both buys loose tools and also makes some itself. The following data is available concerning the years ended 31 December 2014, 2015 and 2016. You are to draw up the Loose Tools Account for...
Study smarter with the SolutionInn App