Principles of Operations Management: Sustainability and Supply Chain Management, Student Value Edition (10th Edition)
10th Edition
ISBN: 9780134183954
Author: HEIZER
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 9, Problem 9P
Six processes are to be laid out in six areas along a long corridor at Rita Gibson Accounting Services in Daytona Beach. The distance between adjacent work centers is 40 feet. The number of trips between work centers is given in the following table:
a) Assign the processes to the work areas in a way that minimizes the total flow, using a method that places processes with highest flow adjacent to each other.
b) What assignment minimizes the total traffic flow?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
As part of a major plant renovation project, the industrial engineering department has been asked to balance a revised assembly operation to achieve an output of 250 units per 8-hour day. Task times and precedence relationships are as follows:
Task
Duration(minutes)
ImmediatePredecessor
a
0.5
-
b
0.4
a
c
0.5
b
d
0.3
-
e
1.8
d
f
1.9
c
g
2
e, f
Do each of the following: a. Determine the number of followers for each task.
(Please answer number of tasks following task for A-G)
As part of a major plant renovation project, the industrial engineering department has been asked to balance a revised assembly operation to achieve an output of 240 units per eight-hour day. Task times and precedence relationships are as follows:
Task
Duration(minutes)
ImmediatePredecessor
a
0.2
-
b
0.4
a
c
0.2
b
d
0.4
-
e
1.2
d
f
1.2
c
g
1.0
e, f
Click here for the Excel Data File
Do each of the following: a. Determine the minimum cycle time, the maximum cycle time, and the calculated cycle time. (Round your answers to 1 decimal place.)
b. Determine the minimum number of stations needed. (Round your answer to the next whole number.)
c. Assign tasks to workstations on the basis of greatest number of following tasks. Use longest processing time as a tiebreaker. If ties still exist, assume indifference in choice.
d. Compute the percentage of idle time for the assignment in part d. Use the actual bottleneck cycle time in your calculation.…
As part of a major plant renovation project, the industrial engineering department has been asked to balance a revised assembly operation to achieve an output of 230 units per 8-hour day. Task times and precedence relationships are as follows:
Task
Duration(minutes)
ImmediatePredecessor
a
0.2
-
b
0.6
a
c
0.4
b
d
0.7
-
e
1.6
d
f
1.8
c
g
2
e, f
Chapter 9 Solutions
Principles of Operations Management: Sustainability and Supply Chain Management, Student Value Edition (10th Edition)
Ch. 9 - Prob. 1EDCh. 9 - Prob. 1DQCh. 9 - Prob. 2DQCh. 9 - Prob. 3DQCh. 9 - Prob. 4DQCh. 9 - Prob. 5DQCh. 9 - Prob. 6DQCh. 9 - Prob. 7DQCh. 9 - Prob. 8DQCh. 9 - Prob. 9DQ
Ch. 9 - Prob. 10DQCh. 9 - Prob. 11DQCh. 9 - Prob. 12DQCh. 9 - Prob. 13DQCh. 9 - Prob. 14DQCh. 9 - Prob. 15DQCh. 9 - Prob. 16DQCh. 9 - Prob. 17DQCh. 9 - Prob. 18DQCh. 9 - Prob. 1PCh. 9 - Prob. 2PCh. 9 - Prob. 3PCh. 9 - Roy Creasey Enterprises, a machine shop, is...Ch. 9 - Adam Munson Manufacturing, in Gainesville,...Ch. 9 - Prob. 6PCh. 9 - Prob. 7PCh. 9 - Prob. 8PCh. 9 - Six processes are to be laid out in six areas...Ch. 9 - Prob. 11PCh. 9 - Stanford Rosenberg Computing wants to establish an...Ch. 9 - Illinois Furniture, Inc., produces all types of...Ch. 9 - Prob. 14PCh. 9 - The Action Toy Company has decided to manufacture...Ch. 9 - Prob. 16PCh. 9 - Prob. 17PCh. 9 - Prob. 18PCh. 9 - Prob. 19PCh. 9 - Prob. 20PCh. 9 - Prob. 21PCh. 9 - Prob. 22PCh. 9 - Prob. 23PCh. 9 - Prob. 1CSCh. 9 - Prob. 2CSCh. 9 - Henry Coupe, the manager of a metropolitan branch...Ch. 9 - Prob. 4CSCh. 9 - Prob. 1.1VCCh. 9 - Prob. 1.2VCCh. 9 - Prob. 1.3VCCh. 9 - Prob. 1.4VCCh. 9 - Prob. 1.5VCCh. 9 - Prob. 1.6VCCh. 9 - Prob. 2.1VCCh. 9 - Prob. 2.2VCCh. 9 - Prob. 2.3VC
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
- Twelve tasks, with times and precedence requirements as shown in the following table, are tobe assigned to workstations using a cycle time of 1.5 minutes. Two heuristic rules will be tried:(1) greatest positional weight, and (2) most following tasks.In each case, the tiebreaker will be shortest processing time. TaskLength(minutes)ImmediatePredecessora 0.1 —b 0.2 ac 0.9 bd 0.6 ce 0.1 —f 0.2 d, eg 0.4 fh 0.1 gi 0.2 hj 0.7 ik 0.3 jl 0.2 k a. Draw the precedence diagram for this line.b. Assign tasks to stations under each of the two rules.c. Compute the percentage of idle time for each rulearrow_forwardThe Mowry Machine Shop still has five jobs to be processed as of 8 A.M. today (day 30) at its bottleneck operation. The time since the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 8 3 23 B 6 10 15 C 4 8 6 D 2 4 12 E 1 6 9 a. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due. Using the FCFS (first come, first served) decision rule for sequencing the jobs, the order is: Sequence 1 2 3 4 5 Job ▼ E A C B D ▼ A E B C D ▼ D B C E A ▼ E A B D C ▼ E D A B Carrow_forwardThe Mowry Machine Shop still has five jobs to be processed as of 8 A.M. today (day 30) at its bottleneck operation. The time since the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 8 3 23 B 6 10 15 C 4 8 6 D 2 4 12 E 1 6 9 a. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due. Using the FCFS (first come, first served) decision rule for sequencing the jobs, the order is: Sequence 1 2 3 4 5 Job A B C D E Using the EDD (earliest due date) decision rule for sequencing the jobs, the…arrow_forward
- The Mowry Machine Shop still has five jobs to be processed as of 8 A.M. today (day 30) at its bottleneck operation. The time since the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 8 3 23 B 6 10 15 C 4 8 6 D 2 4 12 E 1 6 9 a. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due. Using the FCFS (first come, first served) decision rule for sequencing the jobs, the order is: Sequence 1 2 3 4 5 Job A B C D E Using the EDD (earliest due date) decision rule for sequencing the jobs, the…arrow_forwardThe Mowry Machine Shop still has five jobs to be processed as of 8 A.M. today (day 23) at its bottleneck operation. The time since the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 11 10 22 B 10 8 13 C 8 4 19 D 6 4 16 E 1 3 30 a. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due. Using the FCFS (first come, first served) decision rule for sequencing the jobs, the order is: Sequence 1 2 3 4 5 Job A B C D E Using the EDD (earliest due date) decision rule for sequencing the jobs,…arrow_forwardThe Mowry Machine Shop still has five jobs to be processed as of 8 A.M. today (day 23) at its bottleneck operation. The time since the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 11 10 22 B 10 8 13 C 8 4 19 D 6 4 16 E 1 3 30 a. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average days past due. Using the FCFS (first come, first served) decision rule for sequencing the jobs, the order is: Sequence 1 2 3 4 5 Job ▼ A E B C D ▼ E C B D A ▼ A B C E D ▼ A B D C E ▼ C B D E Aarrow_forward
- The mowry machine shop still has five jobs to be processed as of 8A.M today (day 29) at its bottleneck operation. The time since the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in order of arrival: Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 12 4 10 B 7 3 24 C 5 10 16 D 3 8 7 E 1 4 13 Develope serpate schedules by using the FCF and EDS rules. Using FCF, the order is Using EDS, the order is The average flow time and average days past due are. Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.arrow_forwardFrancis Johnson’s plant needs to design an efficient assembly line to make a new product. The assembly line needs to produce 15 units per hour, and there is room for only four workstations. The tasks and the order in which they must be performed are shown in the following table. Tasks cannot be split, and it would be too expensive to duplicate any task. TASK TASK TIME (MINUTES) IMMEDIATE PREDECESSOR A 1 — B 2 — C 3 — D 1 A, B, C E 3 C F 2 E G 3 E What is the workstation cycle time required to produce 15 units per hour? Note: Round your answer to 1 decimal place. Balance the line to use the fewest possible workstations to meet the cycle time found in part (b). Use whatever method you feel is appropriate. What is the efficiency of your line balance, assuming the line operates at the cycle time from part (b)? Note: Round your answer to 1 decimal place.arrow_forwardUdesign is a plant producing mass production dresses. The following table shows the tasks needed to be preformed, their task times and proceeding tasks. It is required to produce 30 dresses per hour. Task Immediate predecessor Task time (sec) A - 30 B - 40 C - 20 D A 100 E B,D 25 F C,D 50 G D,E,F 50 H G 90 a- Compute the cycle time and minimum number of workstations required b- Draw the precedence diagram c- What is the maximum output for this line d- Assign tasks to workstations using most number of followers e- Compute efficiency of such linearrow_forward
- Using the assembly-line balancing procedure, which of the following is the theoretical minimum number of workstations if the task times for the eight tasks that make up the job are 7, 4, 7, 8, 9, 4, 3, and 6 minutes, and the cycle time is 8 minutes? Multiple Choice None of these choices are correct. 3 8 5 6arrow_forwardManagers at the First Community Bank are attempting to shorten the time it takes customers with approvedloan applications to get their paperwork processed. The flowchart for this process, consisting of several differ-ent activities, each performed by a different bank employee, is shown in Figure 5.1. Approved loan applicationsfirst arrive at activity or Step 1, where they are checked for completeness and put in order. At Step 2, the loansare categorized into different classes according to the loan amount and whether they are being requested forpersonal or commercial reasons. While credit checking commences at Step 3, loan application data are enteredin parallel into the information system for record-keeping purposes at Step 4. Finally, all paperwork for setting upthe new loan is finished at Step 5. The time taken in minutes is given in parentheses.Which single step is the bottleneck, assuming that market demand for loan applications exceeds the ca-pacity of the process? The management…arrow_forwardWhy are process layouts plagued by routing and scheduling issues?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 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