Operations Management: Sustainability and Supply Chain Management (12th Edition)
12th Edition
ISBN: 9780134130422
Author: Jay Heizer, Barry Render, Chuck Munson
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 15, Problem 23P
Summary Introduction
To determine: Thesequence that would minimize the total completion time.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Question attached
Question 33
The processing times of five jobs are given as follows:
Job
Processing time (minutes)
A
20
B
60
C
30
D
75
E
15
Assume the jobs arrived in alphabetical order of the job name and no other job arrives in the next 200 minutes. What is the average inventory if the jobs are processed in shortest processing time (SPT) order?
Group of answer choices
3.00
2.92
1.97
2.20
Question E only.
Chapter 15 Solutions
Operations Management: Sustainability and Supply Chain Management (12th Edition)
Ch. 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. 9DQCh. 15 - Prob. 10DQ
Ch. 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. 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. 26PCh. 15 - Prob. 27PCh. 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 - Prob. 2.3VCCh. 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
- Question 1: the following table contains information concerning four jobs that are awaiting processing at a work center. Job Time Due Date Job A (Days) 15 (Days) 21 7 15 16 10 17 a. Sequence the jobs using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. ASsume the list is by order of arrival. b. For each of the methods in part a, determine (1) the average job flow time, (2) the average tardiness, and (3) the average number of jobs at the work center. c. Is one method superior to the others?arrow_forwardQuestion 34 Consider the processing times and priorities for four jobs: Job Processing time (minutes) Weight/Priority (cost per minute) A 10 6 B 2 1 C 50 2 D 16 10 Assume the weighted shortest processing time (WSPT) rule is used. Which job should be processed third? Group of answer choices A B C Darrow_forwardAllocate the tasks to workstations taking into consideration the precedence requirements and using the LOT rule to break ties between feasible tasks.arrow_forward
- Question 3 of 19 The following table contains information concerning four jobs that are awaiting processing at a work center. Job Time Due date (days) (days) 14 10 7 6 Job A B C D Determine the average flow time using the EDD rule. Select the correct response: 20 20.5 19.75 21 20 16 15 17 ProviQUSarrow_forwardQuestion 32 The processing times of four jobs are given as follows: Job Processing time (minutes) A 10 B 30 C 16 D 24 Assume the jobs arrived in alphabetical order of the job name and no other job arrives in the next 70 minutes. What is the average flow time in minutes if the jobs are processed in shortest processing time (SOP) order? Group of answer choices 166 41.5 38 20.5arrow_forwardQ. 3 What is the total makespan from Question 1? Question 1: Four floral arranging jobs are to be carried out across three stations: A (Arrange), B (Bag), C (crop) shown. The station sequences and job times in minutes are shown below, along with the due dates for each job. Using an "earliest due date" job dispatching priority rule, which, if any, of the jobs in will be late? Answer was Job 4 Group of answer choices a. 100 b. 130 c. 150 d. 170 e. 200arrow_forward
- QUESTION 5a. A Chef bakes and decorates cakes in a two-stage process. The cakes are baked and once cooledthey are then decorated based on the clients’ requirements. The Chef received seven orders forfully decorated cakes and has documented the orders with respective processing times for bakingand decorating, as shown in Table 7 that follows:.Table 7. Cake Job Orders received by the Chef with the respective processing times for Baking andDecoratingCake Job Order Baking Processing Time Decorating Processing TimeA 2 1B 8 5C 4 6D 9 7E 7 8F 9 6G 3 5 (ii) Illustrate the flow (throughput) times to complete the baking and decorating on atimeline chart.arrow_forwardQUESTION 5a. A Chef bakes and decorates cakes in a two-stage process. The cakes are baked and once cooledthey are then decorated based on the clients’ requirements. The Chef received seven orders forfully decorated cakes and has documented the orders with respective processing times for bakingand decorating, as shown in Table 7 that follows:.Table 7. Cake Job Orders received by the Chef with the respective processing times for Baking andDecoratingCake Job Order Baking Processing Time Decorating Processing TimeA 2 1B 8 5C 4 6D 9 7E 7 8F 9 6G 3 5 (i) Using Johnson’s Rule, determine the optimum sequence for processing the cake joborders through the baking and decorating stages.arrow_forwardQuestion 35 Consider the processing times and due dates of the following jobs: Job Processing time (days) Due date (days) 1 3 29 2 19 25 3 24 40 4 8 20 What is the average lateness if the earliest due date (EDD) is used to sequence the jobs? Group of answer choices 0.75 1.25 4.25 5.67arrow_forward
- Questionarrow_forwardQuestion 16 An activity on a PERT network has an optimistic time of 2 hours, a most likely time of 4 hours, and a pessimistic time of 14 hours. Find its STANDARD DEVIATION. O 2.5 hours O 1 hour O 0.5 hour 2 hours O 1.5 hoursarrow_forwardQUESTION 2 Six processes are to be laid out in six areas in a company. The distance between adjacent work centres is 40 feet. The number of trips between work centres is given in the following table: FROM A B с D E F A TRIPS BETWEEN PROCESSES TO с 25 96 B 18 D 73 23 41 a) Assign the processes to the initial work areas and draw the total flow. E 12 31 22 19 F 54 45 20 57 48arrow_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.