Consider the problem (Pm): Om||Cmax of minimizing maximum completion time on a set of m machines....
Fantastic news! We've Found the answer you've been seeking!
Question:
Transcribed Image Text:
Consider the problem (Pm): Om||Cmax of minimizing maximum completion time on a set of m machines. We further consider the problem (Qm): Om/pmtn Cmax of minimizing maximum comple- tion time on a set of m machines, where we allow jobs to be preempted. (a) Consider an arbitrary instance I of P₂. So we have say n jobs, each consisting of two operations, to be processed on two machines, where pj denotes the processing time required by job jon machine i, for i=1, 2, and j = 1,...,n. Describe how to compute an optimal schedule in a number of steps that is linear in n. Prove that your approach yields a minimum length schedule. (b) Apparently the problem is much more difficult for three machines than for two machines. Provide an instance I' with three machines and three or four jobs (each with three operations), such that problems P3(I) and Qs(1') have solutions of different values. Prove that your solution of Q3(I') is indeed optimal, and argue that any solution to Ps(1') has a strictly higher value than the optimal solution to Q3(1'). (c) Consider the instance I" of Q₁, defined by the following 4 by 4 matrix of processing times, where rows correspond to machines. jobs j1234 Plj P2j P3j 2377 8 417 4674 Compute an optimal solution for this instance, minimizing makespan, and allowing for preemption. Consider the problem (Pm): Om||Cmax of minimizing maximum completion time on a set of m machines. We further consider the problem (Qm): Om/pmtn Cmax of minimizing maximum comple- tion time on a set of m machines, where we allow jobs to be preempted. (a) Consider an arbitrary instance I of P₂. So we have say n jobs, each consisting of two operations, to be processed on two machines, where pj denotes the processing time required by job jon machine i, for i=1, 2, and j = 1,...,n. Describe how to compute an optimal schedule in a number of steps that is linear in n. Prove that your approach yields a minimum length schedule. (b) Apparently the problem is much more difficult for three machines than for two machines. Provide an instance I' with three machines and three or four jobs (each with three operations), such that problems P3(I) and Qs(1') have solutions of different values. Prove that your solution of Q3(I') is indeed optimal, and argue that any solution to Ps(1') has a strictly higher value than the optimal solution to Q3(1'). (c) Consider the instance I" of Q₁, defined by the following 4 by 4 matrix of processing times, where rows correspond to machines. jobs j1234 Plj P2j P3j 2377 8 417 4674 Compute an optimal solution for this instance, minimizing makespan, and allowing for preemption.
Expert Answer:
Answer rating: 100% (QA)
a Lineartime algorithm for P on two machines Let I be an instance of P with n jobs and two machines We can compute an optimal schedule in a number of steps that is linear in n as follows Sort the jobs ... View the full answer
Related Book For
College Mathematics for Business Economics Life Sciences and Social Sciences
ISBN: 978-0321614001
12th edition
Authors: Raymond A. Barnett, Michael R. Ziegler, Karl E. Byleen
Posted Date:
Students also viewed these finance questions
-
A rod of mass m and length L rests on two pulleys A and B which rotate in opposite directions as shown. Denoting by k the coefficient of kinetic friction between the rod and the pulleys, determine...
-
Jobs processed through Percys machine shop pass through three operations: milling, grinding, and turning. The hours required for each of these operations is as follows: Sequence the job by (a) FCFS...
-
Each matrix i n Problems 1 to 3 corresponds to one of the linear transformations in Problem 54. Match each matrix with the corresponding image from Fig. 5. 1.9. 1. 2. 3. 0 and 0 0
-
Anon Amus Inc. operates a woodworking shop that makes tables and chairs. He has 25 employees working 40 hours per week and he has 750 hours per week available in machine time. Ralph knows that he...
-
Explain how to account for an interest in a joint operation.
-
Patz Company has just received a franchise to distribute air conditioners. The company began business on January 1 with the following assets: Cash...
-
You want to retire in 30 years. You are starting to invest in a growth income fund that promises an ambitious rate of $15 \%$. You can put in $\$ 200$ per month. How much will you have in 30 years?
-
Because of rapidly advancing technology, Southern Publications Corporation is considering replacing its existing typesetting machine with leased equipment. The old machine, purchased two years ago,...
-
1. Given the matrices A and B of sizes m x 1 and 1 x n respectively. 1. a) Write the pseudocode to compute the matrix C = A x B 2. b) What is the complexity of the code that you wrote? 2. Consider...
-
K Ltd. paid an employee a tax-free travel allowance of $5,200 based on 9,000 kilometres of out-of-town driving. What amount can K deduct for tax purposes?
-
Please provide a brief introduction to the Taj hotel in cape town.
-
Joe Levi bought a home in Arlington, Texas, for $127,000. He put down 25% and obtained a mortgage for 30 years at 6%. a. What is Joe's monthly payment? (Do not round intermediate calculations. Round...
-
Module Six Assignment For each scenario listed below, identify the steps the consumer should take in order to get a refund or replacement based on consumer protection laws. Explain what might happen...
-
1. Explain why scarcity is a problem (in different words). Give an example from the Marvel Universe or the real world to support your answer. 2. Why does scarcity make it impossible for Wakanda to...
-
1) Mount Carmel Company operates out of a facility located in Sault Ste. Marie, Ontario. The 10-year-old company sells only two products, Product A and Product B. Product A Product B Total Selling...
-
CASE STUDY: Jol Transport has been around since 1965, a household name with hundreds of satisfied customers. Jol Transport is based in Centurion, Gauteng, and service domestic relocations in the...
-
Figure above shows a simply supported beam being loaded a shown. The cross-section of the beam is also shown above. It is doubly symmetrical. Determine the vertical reactions at A and D in kN. Draw...
-
Subprime loans have higher loss rates than many other types of loans. Explain why lenders offer subprime loans. Describe the characteristics of the typical borrower in a subprime consumer loan.
-
Solve Problem using Gauss-Jordan elimination. 4x1 - 2x2 + 2x3 = 5 -6x1 + 3x2 - 3x3 = -2 10x1 - 5x2 + 9x3 = 4
-
A cable company offers its 10,000 customers two special services: high-speed internet and digital phone. If 3,770 customers use high-speed internet, 3,250 use digital phone, and 4,530 do not use...
-
In Problem, solve for t or r to two decimal places. 2 = e0.03t
-
Due to the Covid recession of 2020, the U.S. government budget changed from smaller deficits to very large deficits. What impact would this have on the net exports and private sector balances, all...
-
Verify the likelihood in equation (16.5) for the two-part model. n2. (16.5) -(-)-(-2)/02 L = [] {(p;)" (1 p; )'-'} [[ ( i=1 ri=1
-
Two Population Poissons. We can express the two population problem in a regression context using one explanatory variable. Specifically, suppose that \(x_{i}\) only takes on the values of zero and...
Study smarter with the SolutionInn App