Please do fast ASAP The operations manager of a body and paint shop has five cars to schedule for repair. He would like to minimize the makespanto complete all work on these cars. Each car requires body work prior to painting. The estimates of the times required to do thebody and paint work on each are as follows:Body Work(hrs)PaintCar(hrs)A10B4D.3EWhat is the idle time at the paint work center for the optimal schedule? 10 hours1 hour7 hours4 hours2 hours

The smallest time is located in Job E (1 hour). Since the time is in First Work Center (Body),…

Answered: What is the idle time at the paint work…

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

Thomas has four assignments due in class tomorrow, and his class times are as follows. Class Time Marketing 304 8 am OM 385 10 am Finance 216 2 pm Psychology 4:30 pm Each class lasts one hour, and Thomas has no other classes. It is now midnight, and Thomas estimates that the marketing, OM, finance, and psychology assignments will take him six, three, four, and two hours, respectively. Use the Excel Sequencing template to determine how he should schedule the work. Can he complete all of it on time? (Hint: Using SPT and EDD. First, convert times to due dates past midnight).
A group of six jobs is to be processed through a two-machine flow shop. The first operation involves cleaning and the second involves painting. Determine a sequence that willminimize the total completion time for this group of jobs. Processing times are as follows:PROCESSING TIME (hours)Job Work Center 1 Work Center 2A 5 5B 4 3C 8 9D 2 7E 6 8F 12 15 To employ Johnson’s rule, create a “blank” sequence first, such as:mhhe.com/stevenson13eEXAMPLE 41st 2nd 3rd 4th 5th 6th
The following set of seven jobs is to be processed through two work centers at George Heinrich's printing company. The sequence is first printing, then binding. Processing timeat each of the work centers is shown in the following table: a) What is the optimal sequence for these jobs to be scheduled?b) Chart these jobs through the two work centers.c) What is the total length of time of this optimal solution?d) What is the idle time in the binding shop, given the optimal solution?e) How much would the binding machine's idle time be cut by splitting Job Z in half?
A mortgage service office has the following four activities involved in approving a loan application. Note that a working day is 8 hours and there are 60 minutes in one hour. Activity Time (minutes) A. Property survey 24 B. Credit report 19 C. Title search 18 D. Final decision 20 The office has three employees, activities A, B and C are combined together and assigned to two employees, while the other employee is responsible for the last activity D. Under this setting, what would be the maximum number of loan applications the office can process per day? Numbers only, keep three decimals if not exact, either round up or down is ok
Mike Reynolds has four assignments due in class tomorrow, and his class times are as follows: Class Time OM 304 8 a.m. Marketing 385 10 a.m. Psychology 216 1 p.m. Finance 200 4:30 p.m. Each class lasts one hour, and Mike has no other classes. It is now midnight, and Mike estimates that the psychology, marketing, OM, and finance assignments will take him five, two, three, and four hours, respectively. Assume that all time till the last class begins can be spent on completing assignments but each assignment should be done till the time of the class on the same subject. (Mike can prepare assignments for the next classes during previous classes.) Use the Excel Sequencing template to determine how he should schedule the work. Use minus sign to enter negative lateness values, if any. Enter the half an hour value as 0.5, e.g., 3:30 p.m. should be entered as 15.5. If your answer is zero, enter "0". Round your answers for the due date, lateness, and tardiness to one decimal…
The chief of police, Karen Stanley, of the Make-BelievePolice Department needs to assign five detective squadsto five pending criminal cases. Karen wants to comeup with an optimum assignment that will minimize thetotal time it takes to conclude the cases. Data on past performance of each detective squad to complete each case assigned in terms of average number of days ispresented in the following table.Average Completion Time (in Days)Detective Squad Case-1 Case-2 Case-3 Case-4 Case-5A 15 8 4 8 28B 21 8 13 7 32C 11 4 5 6 20D 9 12 8 13 20E 14 24 25 27 9Use the assignment method to solve the problemIf Squad D cannot be assigned to Case-5 as a result ofa conflict of interest, solve the problem given this new constraint.
Five sorority sisters plan to attend a social function. Each requires hair styling andfitting for a gown. Assume that the times required are independent exponentiallydistributed random variables with the mean times for the fittings of 0.6, 1.2, 1.5,0.8, and 1.1 hours, respectively, and mean times for the stylings of 0.8, 1.6, 1.0,0.7, and 1.3 hours, respectively. Assume that the fittings are done before thestylings and that there is only a single hair stylist and a single seamstress available.In what sequence should they be scheduled in order to minimize the total expectedtime required for fittings and stylings?
Prove Proposition U. The critical path method solves the parallel precedenceconstrained scheduling problem in linear time
A plant has four operators to be assigned to four machines. The time (minutes) required by each worker to produce a product on each machine is shown in the following table: Determine the optimal assignment and compute total minimum time.
Four workers are available to perform jobs 1–4.Unfortunately, three workers can do only certain jobs:worker 1, only job 1; worker 2, only jobs 1 and 2; worker3, only job 2; worker 4, any job. Draw the network for themaximum-flow problem that can be used to determinewhether all jobs can be assigned to a suitable worker.
Six ships are docked in a harbor awaiting unloading. The times required to unload the ships are random variables with respective means of 0.6, 1.2, 2.5, 3.5, 0.4, and 1.8 hours. The ships are given a priority weighting based on tonnage. The respective tonnages are 12, 18, 9, 14, 4, and 10. In what sequence should the ships be unloaded in order to minimize the expected weighted time?
The first five columns of the following table contain information about a set of four jobs that just arrived (end of Hour 0 or beginning of Hour 1) at an engine lathe. They are the only ones now waiting to be processed. Several operations, including the one at the engine lathe, remain to be done on each job. Determine the schedule by using (a) the CR rule and (b) the S/RO rule. Compare these schedules to those generated by FCFS, SPT, and EDD. Job ProcessingTime at EngineLathe (hours) TimeRemainingUntil Due Date(days) Number ofOperationsRemaining Shop TimeRemaining(days) CR S/RO 1 2 3 4 2.3 10.5 6.2 15.6 15 10 20 8 10 2 12 5 6.1 7.8 14.5 10.2 2.46 1.28 1.38 0.78 0.89 1.10 0.46 -0.44

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