Principles of Operations Management: Sustainability and Supply Chain Management (10th Edition)
10th Edition
ISBN: 9780134181981
Author: Jay Heizer, Barry Render, Chuck Munson
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 15, Problem 3CS
Summary Introduction
Case summary:
The case deals about the store that manufactures old Oregon tables. There are four employees (Person T, Person G, Person L, and Person C), who deal with the operations such as preparation, assembly, finishing, and packaging. Each one would deal with a specific operation. However, all the four are able to do all the four operations. Person R is hired to perform major duties and help when the employees are absent. The time taken by each employee to perform every task is as follows:
Preparation | Assembly | Finishing | Packaging | |
Person T | 100 | 60 | 90 | 25 |
Person G | 80 | 80 | 60 | 10 |
Person L | 110 | 90 | 80 | 10 |
Person C | 120 | 70 | 100 | 25 |
Person R | 110 | 80 | 100 | 10 |
To determine: The fastest way to manufacture the tables using original crew if Person C is moved to either finishing or preparation.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
3:34
Done
Chapter 16 Assessment i
25
eBook
References
Mc
Graw
Hill
P
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
Question 1) Scheduling
If the following jobs are sequenced according to the FCFS rule
Job
Processing Time (days)
Due Date
A
8
12
B
6
15
C
11
17
D
5
10
E
3
8
What is the mean tardiness (in days) for all jobs?
What is the mean completion time in days for all jobs?
What is the maximum job tardiness (in days)
Chapter 15 Solutions
Principles of Operations Management: Sustainability and Supply Chain Management (10th Edition)
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. 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 - 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
- Explain what is the main aim of task calculation to define working time standard ?arrow_forwardQUESTIONS: 1. 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 с 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_forwardWhat is Workload method?arrow_forward
- Question 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_forwardsniparrow_forwardDevelop a solution for the following line balancing problem, allowing a cycle time of 5 minutes. Question: Balance this line using the longest task time heuristic. Work Task Task Time (seconds) Task Predecessor(s) A 70 - B 60 A C 120 B D 60 - E 240 C, D F 100 A G 190 E, Farrow_forward
- 3. The table below shows the ready time, process time and due date of 7 jobs. Job ID Ready Time Process Time Due Date 3 24 2 9 13 3 7 3 23 4 12 2 17 5 1 4 20 6 3 14 7 3 18 • Find a sequence to minimize total tardiness as much as possible (preferably below 21). • Draw your sequence on a Gantt-Chart like time-line.arrow_forwardQuestion3: Two processes are applied in the same order to the jobs coming to a workstation. The durations of both processes for the six jobs coming to the workstation are as seen in the table. In order to minimize the total time to be spent on the jobs, the order in which the jobs should be done will be determined by the "johnson" rule. Accordingly, in the table below, write the order in which the business should do the work, in order, with the first things to be done on the far left, and one action to be written in each blank.1-) When the jobs are done in this order, how many minutes will it take to complete all the jobs?2-)1. How many minutes of space will there be in total in the process and the 2nd process?arrow_forwardQuestion 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? Tip: create a Gantt chart schedule before answering Questions 4 & 5. a. Jobs 2 & 3 b. Jobs 3 & 4 c. Job 3 d. Job 4 e. None of the jobs will be latearrow_forward
- Question 4: Six jobs waiting at a workstation will be processed in order, starting with the one with the shortest break time. In the table below, the time elapsed since the arrival of the works, the time remaining to the delivery and the processing time are given. According to this, create the work order and fill in the data in the relevant table.(fill in the second table in the photos)a) What is the average delay time with the generated order?b) How many hours is the average flow time?c) How many jobs will be delayed?d) How many jobs will not be delayed?arrow_forwardQuestion 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_forwardAllocate the tasks to workstations taking into consideration the precedence requirements and using the LOT rule to break ties between feasible tasks.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.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY