EBK PRINCIPLES OF OPERATIONS MANAGEMENT
11th Edition
ISBN: 9780135175859
Author: Munson
Publisher: VST
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 9, Problem 10P
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
Evan 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?
Compare the differences between flow classification and flow scheduling?
Assign the 4 departments in Table X to locations A, B, C, and D, which are separated by the distances shown in Table y, in such a way that transportation cost is minimized. Use this heuristic: assign departments with the greatest interdepartmental workflow first.
See attached tables.
Chapter 9 Solutions
EBK PRINCIPLES OF OPERATIONS MANAGEMENT
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 - Prob. 9PCh. 9 - Six processes are to be laid out in six areas...Ch. 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. 25PCh. 9 - Prob. 26PCh. 9 - Prob. 27PCh. 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_forwardhomework - need helparrow_forwardsniparrow_forward
- A service process is described by the above flowchart. After going through workstation A, an order needs to be processed by one of the three lines, B1-C1-D1, B2-C2-D2, or B3-C3-D3 (in other words, they are substitutable). Finally, all orders need to go through workstation E. The capacities of the individual workstations are given as follows: Workstation A has a capacity of 2 orders/hour Workstation B1, B2, and B3 have the same capacity of 3 orders/hour Workstation C1, C2, and C3 have the same capacity of 3 orders/hour Workstation D1, D2, and D3 have the same capacity of 3 orders/hour Workstation E has a capacity of 4 orders/hour What is capacity of the service process in orders/hour? Note: Please do not include the unit of measure. For example, if your answer is 10 orders/hour, enter 10.arrow_forwardGiven the following information, assign tasks to work stations using the most followers rule. Assume the cycle time is 60 seconds and the minimum number of workstations is 3. Submit for each workstation (1,2,3,4 etc.), the tasks assigned in order of assignment, the idle time for each work station and the total idle time. (It will help for you to make the diagram but you are not required to submit the diagram) Task A D w Immediate Predecessor D CE Task Time (seconds) 35 50 20 10 25 40arrow_forwardTrue or False? Activity relationships is one of the most critical aspects of designing department layouts within a facility.arrow_forward
- Solve the following questions USING EXCEL: I HAVE ATTACHED TABLES An IT analyst found four project “tickets” in their inbox at 8:00 AM. The estimated times to complete the tickets and the due dates requested are given below. Ticket 1 2 3 4 Processing time (minutes) 42 25 70 50 Due date 10:00 AM 9:00 AM 12:00 PM 9:30 AM Compute tardiness for each ticket and compare average flow time for all tickets under the following processing orders: FCFS SPT EDDarrow_forwardK Amelio Rodríguez Computing wants to establish an assembly line for producing a new product, the Personal Digital Assistant (PDA). The tasks, task times, and immediate predecessors for the tasks are as follows: Task A B C D E Amelio's goal is to produce 180 PDAs per hour. a) The cycle time for the production of a PDA = Time (sec) 12 14 8 5 20 Immediate Predecessor I A A B, C D seconds (round your response to two decimal places). riarrow_forwardMo. The I Love Operations Management (ILOM) Conference, a major international conference, is staffed by student volunteers. One of the tasks of the student volunteers is to register conference attendees. The registration process involves confirming that fees have been paid, retrieving a conference package specific to that person (filed under their last name), and passing on relevant information about the conference. In 2023, conference registration will be handled by a group of 10 student volunteers who work in five pairs to register the attendees (i.e., each pair will together register one attendee at a time). Attendees line up in a common line to be served by the next available pair of volunteers. Attendees arrive at an average rate of 139 per hour (assume Poisson arrival distribution) and the service time is, on average, two minutes (following a negative exponential distribution). What is the average time needed to register (includes waiting and registering), in minutes (round…arrow_forward
- In variable routing of the material transport system, the processing sequence for all work units is very similar. T or Farrow_forwardAnswer the following problems in Job Sequencing 1. There are five jobs, each of which must go through machines A, B and C in the order ABC. Processing time (in hours) are given below: Job 1 2 4 Machine A 10 11 8 7 6. Machine B 6 4 5 3 Machine C 9 6. 8 Determine the optimal processing sequence and . total elapsed time?arrow_forwardThe three-station work cell illustrated in the figure below has a product that must go through one of the two machines at station 1 (they are parallel) before proceeding to station 2. Capacity: 30 units/hr Station 1 Machine A Station 1 Machine B Capacity: 30 units/hr a) The bottleneck time of the system is is the bottleneck station. Station 2 Capacity: 5 units/hr Station 3 Capacity: 2 units/hr G minutes per unit (enter your response as a whole number). b) c) The throughput time is minutes (enter your response as a whole number). d) If the firm operates 8 hours per day, 5 days per week, the weekly capacity of this work cell is response as a whole number). units (enter yourarrow_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