8. Operations times of servicing of Washing Machines are given below. The first operationinvolves cleaning in Machine 1 and the second operation involves oiling in Machine 2.a. Determine a sequence that will minimize the total completion time for thisgroup of jobs, following Johnson's Rule.b. Construct a chart of the operations of the jobs at the two work centers anddetermine idle time of each line, assuming no other activities are involved.Processing times (Hrs.) is as follows:JOBS: AEFMachine 1: 548.6.12Machine 2:5 39.8.15

Answered: 8. Operations times of servicing of…

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

I only need help with question 4, but question 3 explains how to do 4 but I'm lost. I already have question 3 done. 3. Sequence the jobs shown below by using a Gantt chart. Assume that the move time between machines is one hour. Sequence the jobs in priority order 1, 2, 3, 4. Job Work Center/Machine Hours Due Date (days) Job 1 A/3, B/2, C/2 Job 2 C/2, A/4 Job 3 B/6, A/1, C/3 Job 4 C/4, A/1, B/2 a. What is the makespan? b. How much machine idle time is there? c. When is each job delivered compared with its due date? d. How much idle time (waiting time) is there for each job? e. Devise a better job sequence for processing. 4. In problem 3, assume there are two machines of type A, two of type B, and two of type C. a. Prepare a finite capacity schedule. b. Compare the FCS to the Gantt chart in problem 3.
The times required to complete each of eight jobs in a two-machine flow shop are shown in thetable that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B.a. Determine a sequence that will minimize makespan time.b. Construct a chart of the resulting sequence, and find machine B’s idle time. c. For the sequence determined in part a, how much would machine B’s idle time be reduced bysplitting the last two jobs in half?TIME (hours)Job Machine A Machine Ba 16 5b 3 13c 9 6d 8 7e 2 14f 12 4g 18 14h 20 11
The times required to complete each of eight jobs in a two-machine flow shop are shown in the table that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B. TIME (hours) Job Machine A Machine B a 16 5 b 3 13 c 8 7 d 9 6 e 2 14 f 14 4 g 18 14 h 20 11 Find machine B’s idle time For the sequence determined in part a, how much would machine B's idle time be reduced by splitting the last two jobs in half?
Complete the table; find average lateness, average completion time, and average number of jobs in the system. Assume all durations are in days and that the jobs are processed at the shop in the order that they arrive (A then B then C then D). Today is day 1. Job Process Time Flow Time Due Date Lateness A 15 30 B 3 9 C 12 22 D 15 40 Sum (Average) 45 (11.25) Avg. lateness = ? days Avg. completion time = ?? days Avg. number of jobs in the system = ? jobs
2. The operations manager of an assembly and paint shop has five trucks to schedule for repair. He would like to minimize the throughput time (makespan) to complete all work on these cars. Each truck requires assembly prior to painting. The estimates of the times required to do the assembly and paint work on each are as follows:Use Johnson's rule to sequence these five jobs for minimum total duration. Show your step by step work in determining the job sequence and calculate the total duration of finishing assembly and painting operations on all the five trucks ?
Seven jobs are to be processed through a single machine. The processing times anddue dates are given here.Job 1 2 3 4 5 6 7Processing time 3 6 8 4 2 1 7Due date 4 8 12 15 11 25 21Determine the sequence of the jobs in order to minimizea. Mean flow time.b. Number of tardy jobs.c. Maximum lateness.d. What is the makespan for any sequence?
A shoe repair operation uses a two-step sequence that all jobs in a certain category follow. Alljobs can be split in half at both stations. For the group of jobs listed:a. Find the sequence that will minimize total completion time.b. Determine the amount of idle time for workstation B.c. What jobs are candidates for splitting? Why? If they were split, how much would idle time andmakespan time be reduced?JOB TIMES (minutes)A B C D EWorkstation A 27 18 70 26 15Workstation B 45 33 30 24 10
Which job sequence would be used if ordered using the rule "Shortest Job First"? Group of answer choices a. 1,2,3,4 b. 4,3,1,2 c. 2,1,3,4 d. 2,3,4,1 e. 2,3,1,4
Develop a Gantt chart to schedule the 6 jobs. Suppose you want to schedule the jobs in order 1 through 6.
Raquel’s Landscaping Company has contracted forseveral landscaping jobs. Each job requires preparing the areas(identifying the locations and types of plants, preparing the soil,etc.) and then planting the trees, bushes, and shrubs. Th e expectedtime for each of the jobs is shown next. (a) Using FCFS (fi rst come, fi rst served), assume the jobsarrive in the order shown (R, then S, then T, etc.). Showthe beginning and ending time for each job.(b) Calculate the makespan, the mean job fl ow time, and theaverage number of jobs in the system.
Dave Grubbs of Grubbs Auto Body has ﬁve cars waiting for Economy Detailing. An Economy Detailing consists of a wash and then a hand wax. Cars cannot be waxed until they are washed. ROUND UP (39/5) & (39/10). Wash (hours) Wax (hours) (J)aguar 39/5 5 (C)adillac 5 3 (F)ord 1 39/10 (H)onda 2 1 (L)exus 4 4 What schedule produces the shortest time span in which these orders can be completed? Sequence: ____ , _____ , _____ , ______ , ______ Create a Gantt chart for the optimal sequence (shortest time span). How many hours does it take to complete the ﬁve orders? For the schedule in question “a”, how many hours is the waxing task idle? When will Dave ﬁnish the Cadillac? What is the average order completion time?
Job Printing(hrs) Binding(hrs) T 15 3 U 7 9 V 4 10 W 7 6 X 10 9 Y 4 5 Z 7 8 The following set of seven jobs is to be processed through two work centres at a printing company. The sequence is first printing, then binding. Processing time at each work centre is as shown: Determine the optimal job sequence. Chart the jobs and determine total idle time at binding.

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