EBK OPERATIONS MANAGEMENT
14th Edition
ISBN: 9781260718447
Author: Stevenson
Publisher: MCG COURSE
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 6, Problem 6P
Twelve tasks, with times and precedence requirements as shown in the following table, are 10 be 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.
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 tune fox each rule.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The times required to complete each of eight jobs in a two-machine flow shop are shown in thetable that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B.a. Determine a sequence that will minimize makespan time.b. Construct a chart of the resulting sequence, and find machine B’s idle time. c. For the sequence determined in part a, how much would machine B’s idle time be reduced bysplitting the last two jobs in half?TIME (hours)Job Machine A Machine Ba 16 5b 3 13c 9 6d 8 7e 2 14f 12 4g 18 14h 20 11
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.…
Chapter 6 Solutions
EBK OPERATIONS MANAGEMENT
Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.2 - MORTON SALT Introduction Morton Salt is a...Ch. 6.3 - FOXCONN SHIFTS ITS FOCUS TO AUTOMATION Foxconn...Ch. 6.3 - FOXCONN SHIFTS ITS FOCUS TO AUTOMATION Foxconn...Ch. 6.3 - Prob. 2.1RQCh. 6.3 - Prob. 2.2RQ
Ch. 6.3 - Prob. 3.1RQCh. 6.3 - Prob. 3.2RQCh. 6.5 - Prob. 1.1RQCh. 6.5 - Prob. 1.2RQCh. 6 - Explain the importance of process selection in...Ch. 6 - Briefly describe the five process types, and...Ch. 6 - Prob. 3DRQCh. 6 - Briefly describe computer-assisted approaches to...Ch. 6 - What is a flexible manufacturing system, and under...Ch. 6 - Prob. 6DRQCh. 6 - Why might the choice of equipment that provides...Ch. 6 - Prob. 8DRQCh. 6 - Prob. 9DRQCh. 6 - Briefly describe the two main layout types.Ch. 6 - Prob. 11DRQCh. 6 - Prob. 12DRQCh. 6 - What is the goal of Line balancing? What happens...Ch. 6 - Why are routing and scheduling continual problems...Ch. 6 - Prob. 15DRQCh. 6 - Prob. 16DRQCh. 6 - The City Transportation Planning Committee must...Ch. 6 - Identify the fixed-path and variable-path...Ch. 6 - Prob. 19DRQCh. 6 - Prob. 20DRQCh. 6 - Prob. 21DRQCh. 6 - Prob. 22DRQCh. 6 - What is cellular manufacturing? What are its main...Ch. 6 - Prob. 24DRQCh. 6 - Prob. 25DRQCh. 6 - Prob. 1TSCh. 6 - What trade-offs are involved when deciding how...Ch. 6 - Who needs to be involved in process selection?Ch. 6 - Prob. 4TSCh. 6 - Prob. 5TSCh. 6 - Prob. 1CTECh. 6 - Prob. 2CTECh. 6 - What are the risks of automating a production...Ch. 6 - Consider an assembly line such as the burrito...Ch. 6 - Prob. 1PCh. 6 - A manager wants to assign tasks to workstations as...Ch. 6 - A manager wants to assign tasks to workstations as...Ch. 6 - A producer of inkjet printer is planning to add a...Ch. 6 - As part of a major plant renovation project, the...Ch. 6 - Twelve tasks, with times and precedence...Ch. 6 - For the given set of tasks, do the following: a....Ch. 6 - A shop works a 400-minute day. The manager of the...Ch. 6 - Arrange six departments into a 2 3 grid so that...Ch. 6 - Using the information given in the preceding...Ch. 6 - Using the information in the following grid,...Ch. 6 - Arrange the eight departments shown in the...Ch. 6 - Arrange the departments so they satisfy the...Ch. 6 - a. Determine the placement of departments fix a...Ch. 6 - Prob. 15PCh. 6 - Develop a process layout that will minimize the...Ch. 6 - Prob. 17PCh. 6 - Rebalance the assembly line in Problem 7. This...
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
- 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, farrow_forwardThe tasks shown in the following precedence diagram are to be assigned to workstations with theintent of minimizing idle time. Management has designed an output rate of 275 units per day. Assume440 minutes are available per day.a. Determine the appropriate cycle time.b. What is the minimum number of stations possible?arrow_forwardA manufacturer is designing a product layout for a new product productionIt plans to use a production line for 8 hours per day in order to meet forecasted demand of 70 units per day. The product requires 7 tasks in total. These tasks are namelyABC, D, E, F, and Grespectively. Task A does not have any predecessor to startTo start Task B.it requires Task A to be completedStarting tasks needs, the task B to be completed. Also, starting task Dneeded task B to be completed. Task E can only start upon completion of Task C. Whereas starting task F needs the completion of both the tasks D and E. Finally, starting task G needed task Fto be completed. The processing times for tasks, ABC, D. E. and G are 2.8, 2.1, 0.9, 1.0, 1.2, 1.8 and 4.7 minutes respectively. What should be the cycle time in minutes? a 4.7 b. None is the correct answer Oc 7.5 d6.86 e.arrow_forward
- A local toy manufacturer is using a production line that runs 8 hours per day and produces a toy that requires a total of 7 tasks to be performed . The daily demand is 120 toys. Times of the tasks are 2.73,2.01 1, 2.13, 2.0, 2.61, 2.71 , and 2.95 minutes for A ,B,C,D,E,F, , and G, respectively . However, due to the nature of product there are precedence rules that must be observed . Such that Task A does not need any predecessors ; task B requires task be completed. To start task C and task D, each require task B to be completed . Task C must be completed prior to stating task E. Task F needs both task D and task Eto be completed . Finally, task G can start only once task F is completed . What is the minimum number of workstations needed? a. 4 b. 5 c. 6 d. None of them e. 8arrow_forwardA shoe repair operation uses a two-step sequence that all jobs in a certain category follow. Alljobs can be split in half at both stations. For the group of jobs listed:a. Find the sequence that will minimize total completion time.b. Determine the amount of idle time for workstation B.c. What jobs are candidates for splitting? Why? If they were split, how much would idle time andmakespan time be reduced?JOB TIMES (minutes)A B C D EWorkstation A 27 18 70 26 15Workstation B 45 33 30 24 10arrow_forwardGiven this list of tasks, how much idle time is at station 3 if the cycle time is 15 minutes and the Longest Operation Time heuristic is used? Task Duration (min) Predecessor A 8 -- B 7 A C 9 B D 6 C E 7 C F 7 D,E G 9 F H 12 G ANSWER Unselected 3 minutes Unselected 2 minutes Unselected 1 minute Unselected I DON'T KNOW YETarrow_forward
- A producer of inkjet printers is planning to add a new line of printers, and you have been asked to balance the process, given the following task times and precedence relationships. Assume that cycle time is to be the minimum possible. Task Length(minutes) Immediate(Predecessor) a 0.2 - b 0.4 a c 0.3 - d 1.3 b, c e 0.1 - f 0.8 e g 0.3 d, f h 1.2 g Click here for the Excel Data File a. Do each of the following: (1) Enter the number of following tasks for each of the tasks shown in the table below. (2) Assign tasks to stations in order of greatest number of following tasks. Use greatest positional weight as a tiebreaker rule. (3) Determine the percentage of idle time. (Round your answer to 2 decimal places.) (4) Compute the rate of output in printers per day that could be expected for this line, assuming a 420-minute working day. (Round your answer 2 decimal places.) b. Answer these questions: (1) What is the…arrow_forwardA manutacturer is designing a product layout for a new product production. It plans to use a production line for B hours per day in order to meet forecasted demand of 100 units per day. The product requires 7 lasks in total. These tasks are namely, A, 8, CD, E, F, and G respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed Starting tasks Cneeds, the tack B to be completed. Also, starting task D needed task B to be completed Task E can only start upon completion of Task C. Whescas starting lask F needs the completion of both the tasks D and E Finally, starting task G needed, task Fto be completed. 1the processing times for tasks, A BC D, E F, andG are 28, 2.1, 0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. Applying the most following tasks nule for balancing the assembly line, with ties broken according to longest task time first, the tasks that will be assigned to the FIRST workstation are Select one OaAB, and C ODAB Oc None…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
- Develop a solution for the following line balancing problem, allowing a cycle time of 5 minutes. Draw the precedence diagram for the set of tasks. Calculate the minimum number of workstations. Show what tasks are assigned to which stations? Using the heuristic rules How much idle time is there, summed over all workstations? What is the efficiency of this line? Work Task Task Time (seconds) Immediate Predecessor(s) A 70 - B 60 A C 120 B D 60 - E 240 C, D F 100 A G 190 E, Farrow_forwardA local bakery makes custom cakes for special eventssuch as weddings and graduations. Making cakes is a two-step process of baking and decorating. The bakery has received eight orders, and the times required in hours for baking and decorating for each order are given in the following table:Cake Orders Baking DecoratingA 3 4B 1 2C 4 7D 2 4E 5 10F 2 6G 5 7H 6 13Determine a sequence that will minimize the makespan time.Construct a chart of the resulting sequence, and determine the idle time in te decoration process.arrow_forwardThe Mowry Machine Shop still has five jobs to be processedas of 8 a.m. today (day 23) at its bottleneck operation. The daywhen the order arrived, processing time, and promised duedates are given in the following table. The jobs are listed inthe order of arrival.a. Develop separate schedules by using the FCFS and EDDrules. Compare the schedules on the basis of averageflow time and average days past due.b. Which rule gives the best schedule, in your judgment?Why?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