Operations Management
13th Edition
ISBN: 9781259667473
Author: William J Stevenson
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
Chapter 16, Problem 11P
a)
Summary Introduction
To determine: The processing sequence required to minimize the time.
Introduction: Johnson’s rule helps to determine the processing sequence that would minimize the overall time of the process. It would
b)
Summary Introduction
To construct: The chart of the resulting sequence to determine the idle time.
Introduction:Johnson’s rule helps to determine the processing sequence that would minimize the overall time of the process. It would schedule the jobs in two work centers and it would determine the optimal sequence.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Given the operation times provided:
Develop a job sequence that minimizes idle time at the two work centers.
b. Construct a chart of the activities at the two centers, and determine each one’s idle time, assuming no other activities are involved
Given the operation times provided:a. Develop a job sequence that minimizes idle time at the two work centers.b. Construct a chart of the activities at the two centers, and determine each one’s idle time,assuming no other activities are involved.JOB TIMES (minutes)A B C D E FCenter 1 20 16 43 60 35 42Center 2 27 30 51 12 28 24
Karina Nieto works for New Products Inc., and one of hermany tasks is assigning new workers to departments. Thecompany recently hired six new employees and would likeeach one to be assigned to a different department. The em-ployees have completed a two-month training session ineach of the six departments from which they received theevaluations shown below (higher numbers are better).Determine how the new employees should be assigned todepartments so that overall performance is maximized.
Chapter 16 Solutions
Operations Management
Ch. 16 - Why is scheduling fairly simple for repetitive...Ch. 16 - Prob. 2DRQCh. 16 - What are Gantt charts? How are they used in...Ch. 16 - Prob. 4DRQCh. 16 - Briefly describe each of these priority rules: a....Ch. 16 - Why are priority rules needed?Ch. 16 - What problems not generally found in manufacturing...Ch. 16 - Explain forward and backward schedulings and each...Ch. 16 - Prob. 9DRQCh. 16 - Prob. 10DRQ
Ch. 16 - Prob. 11DRQCh. 16 - What general trade-offs are involved in sequencing...Ch. 16 - Prob. 2TSCh. 16 - Prob. 3TSCh. 16 - One approach that can be effective in reducing the...Ch. 16 - Doctors and dentists offices frequently schedule...Ch. 16 - Prob. 3CTECh. 16 - Use the assignment method to determine the best...Ch. 16 - Rework Problem 1, treating the numbers in the...Ch. 16 - Assign trucks to delivery routes so that total...Ch. 16 - Develop an assignment plan that will minimize...Ch. 16 - Use the assignment method to obtain a plan that...Ch. 16 - The following table contains information...Ch. 16 - Using the information presented in the following...Ch. 16 - The following table shows orders to be processed...Ch. 16 - A wholesale grocery distribution center uses a...Ch. 16 - The times required to complete each of eight jobs...Ch. 16 - Prob. 11PCh. 16 - A shoe repair operation uses a two-step sequence...Ch. 16 - The following schedule was prepared by the...Ch. 16 - The production manager must determine the...Ch. 16 - A foreman has determined processing times at a...Ch. 16 - Given the information in the following table,...Ch. 16 - Given the following information on job times and...Ch. 16 - Prob. 18PCh. 16 - The following table contains order-dependent setup...Ch. 16 - The following table contains order-dependent setup...Ch. 16 - Prob. 21PCh. 16 - Given this information on planned and actual...Ch. 16 - Given the following data on inputs and outputs at...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Determine the minimum number of workers needed,...Ch. 16 - Prob. 1CQ
Knowledge Booster
Similar questions
- The following table contains information regarding jobs that are to be scheduled through one machine. Assume jobs are listed in order of arrival (i.e., A, then B, then C, etc.). PROCESSING JOB TIME (DAYS) ABCDEFG Α 3 16 с 11 622845 DUE DATE 24 21 19 18 17 6 8 (Round your answers to Part e to 1 decimal place. Enter your answers to Parts a-d as whole numbers.) a. What is the first-come, first-served (FCFS) schedule? Job Flow Timearrow_forwardHow is the scheduling of patients in a doctor’s clinic similar to and different from the scheduling of jobs in a factory?arrow_forwardGiven this list of tasks, how much idle time is at station 3 if the cycle time is 15 minutes and the Longest Operation Time heuristic is used? Task Duration (min) Predecessor A 8 -- B 7 A C 9 B D 6 C E 7 C F 7 D,E G 9 F H 12 G ANSWER Unselected 3 minutes Unselected 2 minutes Unselected 1 minute Unselected I DON'T KNOW YETarrow_forward
- Eight jobs have arrived in the following order: Job Processing Time Due Date 1 25 11 12 9 2 3 4 5 6 7 8 9 5 11 st 4 10 7 16 6 18 16 Find and compare the performance measures for the following sequencing rules using the Excel Sequencing template. Round your answers to two decimal places. A. Process in the order they have arrived 24 42 Average Flow Time Lateness Tardiness Average B. Shortest processing time The SPT sequence is 4, 2, 8, 6, 1, 5, 3, 7 Flow Time Lateness Tardiness Average Earliest due date The EDD sequence is 4, 2, 3, 8, 5, 6, 1, 7 Flow Time Lateness Tardinessarrow_forwardnumber 1 Dayagsky, pls answer a-c.arrow_forward1. A production department of a textile firm received six different orders this week. They have calculated the processing time presented as a table (below). They have also put the due dates for each job. Job A с E B D F Process. Time 2 4 5 8 10 12 Due Date 7 4 15 16 17 18 Based on the table please provide four sequences to complete the jobs: a) Using first come first served (FCFS) assuming the letters represent the order they arrive (A first, B next, then C, etc..) b) Using shortest processing time c) Using longest processing time d) Using due dates Calculate "average completion time", "average number of jobs in the system" and "average job lateness" for all the sequences you have generated above.arrow_forward
- 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 11arrow_forwardThe day when the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average past due days. Make a comment.arrow_forward17-13. Jobs processed through Percy's machine shop pass through three operations: milling, grinding, and turning. The hours required for each of these operations is as follows: Job Milling Grinding Turning A 5 1 4 B 2 2 5 C 3 2 1 D 1 3 E 1 2 Sequence the job by (a) FCFS and (b) shortest processing time (SPT). Make a Gantt chart for each machine and each rule. Which sequencing rule would you recommend?arrow_forward
- If the cycle time is 65.4 seconds and A is assigned as the first task in Workstation #1, what is the idle time after assigning task A? Task Task Time (seconds) Tasks That Must Precede Other Tasks Number of Following Tasks A 28 - 7 B 13 - 8 C 35 B 7 D 11 A 6 E 20 C 6 F 6 D, E 5 G 23 F 3 H 25 F 2 I 37 G 1 J 11 G, H 1 K 27 I, J 0 Total 236 a. 26.9 minutes b. 37.4 seconds c. 28.5 seconds d. 31.6 seconds e. 57.6 secondsarrow_forwardWhat problems not generally found in manufacturing systems do service systems present in termsof scheduling the use of resources?arrow_forwardSequence Job 1 2 3 4 5 The total flow time for the sequence developed using the EDD rule = response to two decimal places). days (round your The percentage utilization for the sequence developed using the EDD rule = ☐ % (enter your response as a percentage rounded to two decimal places). The average number of jobs in the system for the sequence developed using the EDD rule = jobs (round your response to two decimal places). The average tardiness (job lateness) for the sequence developed using the EDD rule = (round your response to two decimal places). days Using the SPT (shortest processing time) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which the jobs were received):arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill EducationOperations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
- Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage LearningProduction and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
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
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.