Principles Of Operations Management
11th Edition
ISBN: 9780135173930
Author: RENDER, Barry, HEIZER, Jay, Munson, Chuck
Publisher: Pearson,
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 15, Problem 23P
Summary Introduction
To determine: Thesequence that would minimize the total completion time.
Introduction: The Gantt chart is the kind of chart that is used to represent the amount of job done within a particular period. It is used to graphically represent the amount of job planned and done in a certain period.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Six jobs are to be processed through a two-step operation. The first operation involves sanding, and the second involves painting. Processing times are as follows: Determine a sequence that will minimize the total completiontime for these jobs. Illustrate graphically.
Six jobs are to be processed through a two-stepoperation. The first operation involves sanding, and the second involves painting. Processing times are as follows:
Determine a sequence that will minimize the total completiontime for these jobs. Illustrate graphically.
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
Chapter 15 Solutions
Principles Of Operations Management
Ch. 15 - Prob. 1EDCh. 15 - Prob. 1DQCh. 15 - Prob. 2DQCh. 15 - Prob. 3DQCh. 15 - Prob. 4DQCh. 15 - Prob. 5DQCh. 15 - Prob. 6DQCh. 15 - Prob. 7DQCh. 15 - Prob. 8DQCh. 15 - Prob. 9DQ
Ch. 15 - Prob. 10DQCh. 15 - Prob. 11DQCh. 15 - Prob. 12DQCh. 15 - Prob. 13DQCh. 15 - Prob. 1PCh. 15 - Prob. 2PCh. 15 - Prob. 3PCh. 15 - Prob. 4PCh. 15 - Prob. 5PCh. 15 - Prob. 6PCh. 15 - Prob. 7PCh. 15 - Prob. 8PCh. 15 - Prob. 9PCh. 15 - Prob. 10PCh. 15 - Prob. 11PCh. 15 - Prob. 12PCh. 15 - Prob. 13PCh. 15 - Prob. 14PCh. 15 - Prob. 15PCh. 15 - Prob. 16PCh. 15 - Prob. 17PCh. 15 - Prob. 18PCh. 15 - Prob. 19PCh. 15 - Prob. 20PCh. 15 - Prob. 21PCh. 15 - Prob. 22PCh. 15 - Prob. 23PCh. 15 - Prob. 24PCh. 15 - Prob. 25PCh. 15 - Prob. 26PCh. 15 - Prob. 27PCh. 15 - Prob. 28PCh. 15 - Daniels Barber Shop at Newark Airport is open 7...Ch. 15 - Given the following demand for waiters and...Ch. 15 - Prob. 1CSCh. 15 - Prob. 2CSCh. 15 - Prob. 3CSCh. 15 - Prob. 4CSCh. 15 - Prob. 1.1VCCh. 15 - Prob. 1.2VCCh. 15 - Prob. 1.3VCCh. 15 - Prob. 2.1VCCh. 15 - Prob. 2.2VCCh. 15 - Why is seniority important in scheduling servers?Ch. 15 - Prob. 2.4VC
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- There are following seven jobs and they must pass through Machine 1 and Machine 2. Operating time for both the machines is shown below for each of the job: Job Operations Time for machine 1 Operations Time for machine 2 A 4 5 B 16 13 C 8 7 D 12 11 E 3 9 Schedule (job sequence and show the arrangement in diagram for machine 1 & 2) the seven jobs through two machines in sequence to minimize the flow time using Johnson’s rule. Find the job completion time. Find the slack time or idle time for machine 1 & 2 separately.arrow_forwardFive jobs are planned to be scheduled. Each of the jobs must be processed on three machines (A, B, and C) in the same order. The processing times are listed below. Use Johnson's Rule to determine the optimal sequence of jobs. Job B 16 10 11 10 14 20 12 3 10 8 4 1 O a) 3-1-2-4-5 O b) Johnson's Rule is not an Optimal Technique O c) 1-2-3-4-5 O d) 5-4-3-1-2 O e) 5-4-3-2-1 O) 5-4-2-1-3 O e) 5-4-2-3-1 2345arrow_forwardAt the campus copy shop, six jobs have a rrived in the order shown (A, B, C, D, E, and F) at the beginning of the day (today, which is a workday). All of the jobs are due at varioustimes today. Your task is to evaluate four common sequencing rules. a) Sequence the jobs according to the following decision rules:FCFS, EDD, SPT, and LPT.b) For the FCFS sequence, compute the average completion (flow) time, average lateness, and average number of jobs in the system.c) For the EDD sequence, compute the average completion (flow) time, average lateness, and average number of jobs in the system.d) For the SPT sequence, compute the average completion (flow) time, average lateness, and average number of jobs in the system. e) For the LPT sequence, compute the average completion (flow)time, average lateness, and average number of jobs…arrow_forward
- Use Johnson's rule to determine the optimal processing sequence for the jobs listed in the following table JOB ان استرامادان اماه A B C D E F G Processing Time (mins) ST1 30 8 10 18 5 15 14 ST2 12 16 9 7. 4 5 20 Please write the optimal processing sequence for the six jobs:arrow_forward2. 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 ?arrow_forwardFive jobs are ready for processing at time zero through a workstation. The details regarding the processing time and the due date of completion is provided in the following table. Job Processing Time (days) Due Date A 6 10 B 5 17 C 2 13 D 3 9 E 4 15 Using the earliest due date (EDD) rule, the average tardiness of the five jobs is:arrow_forward
- The following jobs are waiting to be processed at Rick Solano’s machine center. Solano’s machine center has a relatively long backlog and sets a fresh schedule every 2 weeks, which does not disturb earlier schedules. Below are the jobs received during the previous 2 weeks. They are ready to be scheduled today, which is day 241 (day 241 is a workday). Job names refer to names of clients and contract numbers. Job Date job received Productiondays needed Date job due BR-02 228 15 300 CX-01 225 25 270 DE-06 230 35 320 RG-05 235 40 360 SY-11 231 30 310 a. Complete the following table. (Show your supporting calculations.) b.Which dispatching rule has the best score for flow time? c. Which dispatching rule would you select? Support your decision.arrow_forwardEvan Schwartz has six jobs waiting to be processedthrough his machine. Processing time (in days) and duedate information for each job are as follows:Sequence the jobs by FCFS, SPT, SLACK, and DDATE.Calculate the mean flow time and mean tardiness of the sixjobs under each sequencing rule. Which rule would yourecommend?arrow_forwardUsing the FCFS rule for scheduling, the sequence is 1-2-3 For the schedule developed using the FCFS rule, the total length of time taken to complete the three suits (including delivery) : hours (enter your response as a whole number). = G Sunny Park Tailors has been asked to make three different types of wedding suits for separate customers. The table below highlights the time taken in hours for cutting and sewing (process 1) and delivery (process 2) of each of the suits. Times Taken for Different Activities (hours) Cut and Sew 3 5 6 Suit 1 2 7 3 Deliver 4 2 ∞ N 8 Assume that orders for suits have been listed in the above table in the order in which they were received.arrow_forward
- Please walk me through each step and the reasoning behind the step I don't understandarrow_forwardEva, the owner of Eva's Second Time Around Wedding Dresses, currently has five dresses to be altered, shown in the order in which they arrived: Job VWX Y Z Processing Time (hrs) 7 1 9 3 5 Due (hrs from now) 5 1 4 2 3 If Eva uses the shortest processing time first (SPT) priority rule to schedule these jobs, what will be the average completion time?arrow_forwardThe 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.44arrow_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 Education
Operations 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 Learning
Production 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.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY