* A group of six jobs is to be processed through a two-machine flow shop. The firstoperation involves cleaning and the second involves painting. Determine a sequence thatwill minimize the total completion time for this group of jobs. Find out the idle time forwork station 2. Processing times are as follows:Processing Time (hours)Work Station 1JobWork Station 2A5В43D7E8F1215To employ Johnson's rule, create a "blank" sequence first, such as:1st2nd3rd4th5thбth

For decreasing the inactive time for N occupations booking on two workstations Johnson's Rule is…

Answered: * A group of six jobs is to be…

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

The following six jobs are to be scheduled on a single machine: Job 1 2 3 Processing time 70 160 220 (min.) a. Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number. Job Flow Time (min) 1 2 3 st 4 5 6 4 5 6 90 130 110 minutes Makespan: Average flow time: minutes b. In what order would the jobs be processed using the SPT rule? The SPT sequence is -Select- -Select- -Select-- -Select- ✓ -Select- -Select- Compute the average flow time after each job is completed. Round your answer to the nearest whole number. Average flow time: minutes
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
Given the following information on job times and due dates, determine the optimal processingsequence using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, find the average jobflow time and the average job tardiness. Jobs are listed in order of arrival.JobJob Time(hours)Due Date(hours)a 3.5 7b 2.0 6c 4.5 18d 5.0 22e 2.5 4f 6.0 20
The following six jobs are to be scheduled on a single machine: Job 1 2 3 4 5 6 Processing time (min.) 110 120 220 90 180 80 Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number. Job Flow Time (min) 1 2 3 4 5 6 Makespan: minutes Average flow time: minutes In what order would the jobs be processed using the SPT rule? The SPT sequence is - - - - - . Compute the average flow time after each job is completed. Round your answer to the nearest whole number. Average flow time: minutes Compare this answer with your answer to part a. The minimizes flow time and gets the most work done in the least amount of time.
WorkPro is a small manufacturer. It uses a job process for production. The following sample of jobs are listed in the order that they were received. Job Due Date Operation Time P 5 1 Q 20 8 R 8 5 S 11 6 T 3 12 When the shortest operating time (SOT) rule is applied to the sample of jobs, the resulting sequence is: A. Choos the following answer choice. T, P, R, S, Q R, S, T, P, Q P, Q, R, S, T P, R, S, Q, T B. In the WorkPro example above, average flow time for the sample of jobs when sequenced by the shortest operating time (SOT) rule is approximately: 19.8 14.2 4.8 6.4 C. In the WorkPro example above, average lateness for the sample of jobs when sequenced by the earliest due date (EDD) rule is approximately: Group of answer choices 10.4 4.8 7.8 5.8 D. Using the sample of jobs in the WorkPro example above, the shortest operating time (SOT) rule appears more attractive than the earliest due date (EDD) rule…
K Courtney is a programmer receiving requests each week to analyze a large data base. Five jobs were on her desk Monday morning, and she must decide in what order to write the code. Assume that all jobs arrived today (day 1 and hour 1), in the order shown below. Courtney has assigned the number of hours required to do the coding as noted. Note that Courtney works an 8-hour day and today is a work day. JOB A C D E DUE DATE (HOURS HENCE) 10 16 14 36 26 DURATION (HOURS REQUIRED) 6 3758 a) Sequence the jobs according to EDD. According to the EDD rule, the sequence of jobs should be A, C, B, E, D b) What is the average completion (flow) time? The average completion (flow) time is days (round your response to one decimal place).
Dan's Auto Detailing business performs two major activities: exterior cleanup and interior detailing. Based on the size of car and condition, time estimates for six cars on Monday morning are as shown in the accompanying table. Car Number 1 5 6 Exterior Interior 55 75 4 65 35 50 60 45 90 35 40 a. Sequence the cars so that all exterior cleanup is done first and total completion time is minimized. The sequence is -Select-- -Select- -Select- -Select- -Select-- -Select- 2 3 80 20
Five customers brought in computers to be repaired to a small shop. Estimated repair times (in days) and dates promised are given below. Due dates were set based on available technicians; however, one technician had a medical emergency and will be unavailable for at least two weeks so processing times were adjusted. Customer job 1 Processing time (days) Due date (days) 6 Use the EDD rule and compute the start time, flow time, lateness, and tardiness for each job. Use minus sign to enter negative lateness values, if any. If your answer is zero, enter "0". Sequence Start Time, days Flow Time, days Lateness, days Tardiness, days -Select- -Select- -Sclect. -Select- -Select- UI 5 LI TE 10 MA
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?
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
(Please do not give solution in image format thanku) Develope a 3 level work breakdwon structure (including level 1,2 and 3) the work break down structure is based on the following project. Improving Customer Service Response Time for a clothing company. additional informationa can be added to the work break down struture to create the different levels The motivation behind this project is to improve customer satisfaction by reducing response time for customer service inquiries. Currently, customers are waiting an average of 48 hours to receive a response to their inquiries, resulting in frustration and dissatisfaction. By implementing a new customer service ticketing system and training customer service agents on effective communication and problem-solving techniques, response time can be reduced to 24 hours or less.
Find the value of X in the following Flow Shop data consisting of 5 jobs which are to be processed on two machines M1 & M2 in that order. M2 Jobs A 7 B 5 C D E M1 5 2 1 4 13 3 6 3 For the sequence using Johnson's Rule, the Average Flow Time X

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