4. Use Smith's rule to solve the problem 1 || F subject to Tx <4 with data:JobProcessing timeDue date3514729.38331322313814Then, find the optimal mean flow time.

Find the given details below: Given details: Job Processing time Due date 1 7 33 2 2 13 3…

Answered: 4. Use Smith's rule to solve the…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Suppose a network contains a finite number of arcs andthe capacity of each arc is an integer. Explain why theFord–Fulkerson method will find the maximum flow in thefinite number of steps. Also show that the maximum flowfrom source to sink will be an integer.
Four doctors work in a hospital emergency room thathandles three types of patients. The time a doctor spends with each type of patient is exponentially distributed, witha mean of 15 minutes. Interarrival times for each customertype are exponential, with the average number of arrivalsper hour for each patient type being as follows: type 1, 3patients; type 2, 5 patients; type 3, 3 patients. Assume thattype 1 patients have the highest priority, and type 3 patientshave the lowest priority (no preemption is allowed). What isthe average length of time that each type of patient mustwait before seeing a doctor?
(b) A company produces 3 products A, B and C processed on 3 machines P, Q, R before completion. Machine P can process 25 units of A or 50 unit of B or 75 units of C per hour. Machine Q can process 50 units of any of the products per hour. Machine R can process 50 units of A or 25 unit of B or 100 units of C per hour. The processing hours available on machines P, Q and R are 12, 12 and 13 respectively. Use matrix method, find (i) How many units of each of the three products can be produced per day (ii) The production cost per unit, if cost per hour of operating machines A,B and C are N$500, N$1,000 and N$1,500 respectively. (iii) The total cost of production.
What is Machine Scheduling in Integer linear optimization and put example.
What is the shift scheduling in Integer linear optimization and pud example
Vollmer Manufacturing makes three components for sale to refrigeration companies. The components are processed on two machines: a shaper and a grinder. The times (in minutes) required on each machine are as follows: Machine Component Shaper Grinder 1 6 4 2 4 5 3 4 2 The shaper is available for 120 hours, and the grinder is available for 110 hours. No more than 200 units of component 3 can be sold, but up to 900 units of each of the other components can be sold. In fact, the company already has orders for 600 units of component 1 that must be satisfied. The profit contributions for components 1, 2, and 3 are $8, $6, and $9, respectively. (a) Formulate and solve for the recommended production quantities. component 1 unitscomponent 2 unitscomponent 3 units (b) What are the objective coefficient ranges for the three components? (If there is no upper or lower limit, enter NO LIMIT. Round your answers to the nearest integer.) component 1 to unitscomponent 2 to…
Vollmer Manufacturing makes three components for sale to refrigeration companies. The components are processed on two machines: a shaper and a grinder. The times (in minutes) required on each machine are as follows: Machine Component Shaper Grinder 1 6 4 2 4 5 3 4 2 The shaper is available for 120 hours, and the grinder is available for 110 hours. No more than 200 units of component 3 can be sold, but up to 800 units of each of the other components can be sold. In fact, the company already has orders for 600 units of component 1 that must be satisfied. The profit contributions for components 1, 2, and 3 are $8, $6, and $9, respectively. (a) Formulate and solve for the recommended production quantities. component 1 unitscomponent 2 unitscomponent 3 units (b) What are the objective coefficient ranges for the three components? (If there is no upper or lower limit, enter NO LIMIT. Round your answers to the nearest integer.) component 1 blank to blank units…
Five workers are available to perform four jobs. Thetime it takes each worker to perform each job is given inTable 65. The goal is to assign workers to jobs so as tominimize the total time required to perform the four jobs.Use the Hungarian method to solve the problem.
A leatherworks factory has two punch presses for punching holes in the various leathergoods produced in the factory prior to sewing. Suppose that 12 different jobs must beprocessed on one or the other punch press (i.e., parallel processing). The processingtimes (in minutes) for these 12 jobs are given in the following table.Job 1 2 3 4 5 6 7 8 9 10 11 12Time 26 12 8 42 35 30 29 21 25 15 4 75Assume that both presses are initially idle. Compare the performance of SPT andLPT (longest processing time) rules for this example. (In parallel processing the nextjob is simply scheduled on the next available machine.)
At a manufacturing assembly line, 30 jobs arrive perhour. Each job must pass through two production stages:stage 1 and stage 2. Stage 1 takes an average of 1 minute tocomplete, and 1 worker is available to perform stage 1.After completing stage 1, the job immediately passes tostage 2. Stage 2 takes an average of 2 minutes to complete,and 2 workers are available to work on stage 2. Aftercompleting stage 2, each job is inspected. Inspection takesan average of 3 minutes, and 3 workers are available toperform inspection. After inspection, 10% of the jobs mustbe returned to stage 1, and they then repeat both stages 1and 2. After inspection, 20% of all jobs return to stage 2 andrepeat stage 2. Assume that interarrival times and servicetimes are exponential.a What is the average time a job spends in the systemfrom arrival to completion?b What percentage of the time is each worker busy?
A medical clinic performs three types of medical tests that use the same machines. Tests A, B, and C take 15 minutes, 30 minutes, and 1 hour, respectively, with respective profits of $120, $240, and $500. The clinic has four machines and four workers available. One person is qualified to do test A, two to do test B, and one to do test C. If the clinic has a rush of customers for these tests, how many of each type should it schedule in a 10-hour day to maximize its profit?
Five employees are available to perform four jobs. Thetime it takes each person to perform each job is given inTable 50. Determine the assignment of employees to jobsthat minimizes the total time required to perform the fourjobs. Please also provide the graph.

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Operations Management

ISBN:

9781259667473

Author:

William J Stevenson

Publisher:

McGraw-Hill Education

Operations and Supply Chain Management (Mcgraw-hi…

Operations Management

ISBN:

9781259666100

Author:

F. Robert Jacobs, Richard B Chase

Publisher:

McGraw-Hill Education

Business in Action

Operations Management

ISBN:

9780135198100

Author:

BOVEE

Publisher:

PEARSON CO

Purchasing and Supply Chain Management

Operations Management

ISBN:

9781285869681

Author:

Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson

Publisher:

Cengage Learning

Production and Operations Analysis, Seventh Editi…

Operations Management

ISBN:

9781478623069

Author:

Steven Nahmias, Tava Lennon Olsen

Publisher:

Waveland Press, Inc.

SEE MORE TEXTBOOKS

4. Use Smith's rule to solve the problem 1 || F subject to Tx <4 with data: max 6. Job Processing time Due date 1 4 7 2 5 9. 3 2 8 33 13 22 31 38 14 Then, find the optimal mean flow time.