3. A manager wants to assign tasks to workstations as efficiently as possible and achieve an hourly output of four units. The department uses a working time of 56 minutes per hour Assign the tasks shown in the accompanying precedence diagram (times are in minutes) to workstations using the following rules: a. In order of most following tasks. Tiebreaker: greatest positional weight. b. In order of greatest positional weight. Tiebreaker: most following tasks. c. What is the efficiency? 3 a 7 d 9 5

3. A manager wants to assign tasks to workstations as efficiently as possible and achieve an hourly output of four units. The department uses a working time of 56 minutes per hour Assign the tasks shown in the accompanying precedence diagram (times are in minutes) to workstations using the following rules: a. In order of most following tasks. Tiebreaker: greatest positional weight. b. In order of greatest positional weight. Tiebreaker: most following tasks. c. What is the efficiency? 3 a 7 d 9 5

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter4: Linear Programming Models

Section: Chapter Questions

Problem 111P

See similar textbooks

Similar questions

A company is setting up an assembly line to produce 90 units per hour. The table below identifies the work elements, times, and immediate predecessors. Work Element Time (Sec.) Immediate Predecessor(s) A 25 - B 18 A C 20 A D 5 B, C E 12 C F 8 E G 16 D, F H 12 G Use one of the heuristic decision rules described in Table below to balance the assembly line so that it will produce 90 units per hour. Clearly state the decision rule you use and complete the below table using the selected rule. Decision Rule Logic Longest work element Picking the candidate with the longest time to complete is an effort to fit in the most difficult elements first, leaving the ones with short times to “fill out” the station. Shortest work element This rule is the opposite of the longest work element rule because it gives preference in workstation assignments to those work elements that are quicker. It can be tried…
Karina Nieto works for New Products Inc., and one of hermany tasks is assigning new workers to departments. Thecompany recently hired six new employees and would likeeach one to be assigned to a different department. The em-ployees have completed a two-month training session ineach of the six departments from which they received theevaluations shown below (higher numbers are better).Determine how the new employees should be assigned todepartments so that overall performance is maximized.
2. Jamila wants to set up a manufacturing unit, so she meets with Rashid, a humanresource manager at her company. Rashid explains that in order to decide on thehuman resource needs for the unit, they should conduct a workflow analysis. Shesuggests they start by defining the outputs of the process. To do this, what shouldJamila define?A) the processes that will be involved in manufacturingB) the number of people required for productionC) the type of products that will need to be manufacturedD) the special equipment, facilities, and systems needed for productionE) the data and information needed by the work unit
Develop a solution for the following line balancing problem, allowing a cycle time of 5 minutes. Work Task Task Time (seconds) Task Predecessor(s) Please choose numbers between 50-200 and enter each number below. Use them for your calculation. A ___ None B ___ A C ___ _____ (Please select one of the following: none, A, or, B and enter your selection in the blank. Use it for your diagram.) D ___ None E ___ C, D F ___ B, D G ___ _____ (Please select one of the following: E, F or both and enter your selection in the blank. Use it for your diagram.) Calculate the theoretical minimum number of workstations.
Kiko Teddy Bear is a manufacturer of stuffed teddy bears. Kiko would like to be able to produce 40 teddy bears per hour on its assembly line. The following information will assist in answering the questions that follow: Task Information for Kiko Teddy Bear Work Element Task Description Immediate Predecessor Task time (in seconds) A Cut teddy bear pattern None 90 B Sew teddy bear cloth a 75 C stuff teddy bear b 50 D glue on eyes c 20 E glue on nose c 15 F sew on mouth c 35 G attach manufacturer's label b 15 H Inspect and pack teddy bear d,e,f,g 40 a. Draw a precedence diagram. b. What cycle time would provide the desired output? c. What is the maximum possible output of the line? d. What is the theoretical minimum number of workstations using the cycle time computed in” b “ above? e. Assign tasks to workstations using the cycle time in “b” above. f. Calculate the efficiency and idle time percentage of the line.
A manager wants to assign tasks to workstations as efficiently as possible and achieve an hourlyoutput of four units. The department uses a working time of 56 minutes per hour. Assign the tasksshown in the accompanying precedence diagram (times are in minutes) to workstations using thefollowing rules:a. In order of most following tasks. Tiebreaker: greatest positional weight.b. In order of greatest positional weight. Tiebreaker: most following tasks.c. What is the efficiency?
You are the owner of a business and must perform the work of ten clients during the day. It has four collaborators who are capable of carrying out the different jobs with the same level of quality. Depending on the skills of the different collaborators and the complexity of the jobs, the execution times are different and are presented in the following table: Client A B C D Arkitex 3 3 2 1 Bravia 3 3 4 3 Cúbika 4 5 6 4 Doratta 8 6 5 7 Evergreen 3 4 2 2 Fenix 5 6 3 4 Golden 3 3 1 4 Horizon 6 8 6 5 Icónika 5 5 5 5 Luxus 4 4 1 2 b) Now consider that each employee must carry out at least one job during the day. State and solve the problem throught excel solver
You are the owner of a business and must perform the work of ten clients during the day. It has four collaborators who are capable of carrying out the different jobs with the same level of quality. Depending on the skills of the different collaborators and the complexity of the jobs, the execution times are different and are presented in the following table: Client A B C D Arkitex 3 3 2 1 Bravia 3 3 4 3 Cúbika 4 5 6 4 Doratta 8 6 5 7 Evergreen 3 4 2 2 Fenix 5 6 3 4 Golden 3 3 1 4 Horizon 6 8 6 5 Icónika 5 5 5 5 Luxus 4 4 1 2 Solve it through excel solver.
0.5 A 0.7 B 5 Station 1 2 3 0.5 Tasks B,A,C,D E,F G,H,I Total 0.1 D 0.6 F The cycle time is determined to be 2.0 minutes. How would the line be balanced by choosing the assignable task having the longest task time first? Fill in the table below. If your answer is zero, enter "0". Round your answers to one decimal place. Total Time Idle Time G 0.4 E 1.1 H 0.2 What is the assembly-line efficiency? Round your answer to one decimal place. % T 0.1
Kiko Teddy Bear is a manufacturer of stuffed teddy bears. Kiko would like to be able to produce 40teddy bears per hour on its assembly line. The following information will assist in answering thequestions that follow: Task Information for Kiko Teddy Bear Work Element Task Description ImmediatePredecessor Task Time (inseconds)A Cut teddy bear pattern None 90B Sew teddy bear cloth A 75C Stuff teddy bear B 50D Glue on eyes C 20E Glue on nose C…
Kiko Teddy Bear is a manufacturer of stuffed teddy bears. Kiko would like to be able to produce 40teddy bears per hour on its assembly line. The following information will assist in answering thequestions that follow: Task Information for Kiko Teddy Bear Work Element Task Description ImmediatePredecessor Task Time (inseconds)A Cut teddy bear pattern None 90B Sew teddy bear cloth A 75C Stuff teddy bear B 50D Glue on eyes C 20E Glue on nose C…
Example-2 Using the information contained in the table shown, do each of the following: 1. Draw a precedence diagram. Assuming an eight-hour workday, compute the cycle time needed to obtain an output of 400 units per day. 2. 3. Determine the minimum number of workstations required. Assign tasks to workstations using this rule: Assign tasks according to greatest number of following tasks. In case of a tie, use the tiebreaker of assigning the task with the longest processing time first. 4. Immediate Predecessor Task Time Task (in minutes) a. 0.2 a 0.2 0.8 0.6 0.3 d, e 1.0 0.4 0.3 Et-3.8 5. Compute the resulting percent idle time and efficiency of the system.