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...
-
Lisali Company gathered the following information related to inventory that it owned on December 31, 2011: Historical cost ......... $100,000 Replacement cost ....... 95,000 Net realizable value...
-
On July 31, 2016, the payroll register of Reed Wholesale Company showed the following totals for the month: gross earnings, $39,600; social security tax, $2,455.20; Medicare tax, $574.20; income tax,...
-
Scott Badger and Maxine Giesen are partners in a business. On December 31 of the current year, the partners equities are Scott, \($60,000.00\) and Maxine, \($90,000.00.\) The net income for the year...
-
Macys, Inc., operates over 850 Macys and Bloomingdales department stores nationwide. The company does more than $26 billion in sales each year. Assume that as part of its cash management strategy,...
-
What models of capacity management are applicable for the company LIPTON Tea? In operations management choose between the Level Capacity model, Chase Demand model, Demand management model and...
-
The Alfredo Fragrance Company produces only one product, a perfume called Hint of Elegance. Hint of Elegance consists of two secret ingredients blended into an exclusive fragrance, which is marketed...
-
Sketch the vector function and compute its divergence. The answer may surprise you...can you explain it?
-
Toys Galore Company provided the following balance sheet and income statement information: Balance Sheet at December 31 Year 2 Year 1 Cash $ 1,400 $ 6,000 Accounts receivable 13,500 12,000 Inventory...
-
Getting students to understand the benefits of donation can motivate them to become involved in the society. Plus, it allows teachers to emphasize the value and impact of their donations on other...
-
In the 2016 federal election, California voted 62% Democrat, 32% Republican, and 6% Other parties. Suppose that voter retention in future elections is predicted as follows: (i) 90% of Democrat voters...
-
Find fx, fy, fx(-3,-5), and f,(-4,4) for the following equation. 2 f(x,y) = x + y
-
b. Provide the Accounting Equation for Tesla, as of December 31, 2020. c. Who are the auditors of Tesla? Who is responsible for the preparation of Tesla's financial statements? In auditing Tesla's...
-
Problem 3-5 (Algo) The following table contains the number of complaints received in a department store for the first 6 months of operation: Note: Round final answer to a whole number. MONTH...
-
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
-
Write a computing procedure to make draws from a univariate truncated normal density T N [ a , b ] [ , 2 ] using the inverse transform method given in Section 12.8.2. Here [ a , b ] are lower and...
-
Consider the standard binary logit regression model (see Section 14.3). (a) Write down the log-likelihood function. (b) Introduce a random intercept assumption in which the intercept is drawn from a...
-
Show that if N [ , 1 ] , and Gamma [ / 2 , / 2 ] , then the unconditional distribution of is a multivariate t -distribution with parameters ( , , ) .
Study smarter with the SolutionInn App