Concept explainers
A shop works a 400-minute day. The manager of the shop wants an output of 200 units per day for the assembly line that has the elemental tasks shown in the table. Do the following:
a. Construct the precedence diagram.
b. Assign tasks according to the most following tasks rule. Break ties with the greatest positional weight rule.
c. Assign tasks according to the greatest positional weight rule. Break ties with the most following tasks rule.
d. Compute the balance delay for each rule. Which one yields the better set of assignments in this instance?
a)
To draw: The precedence diagram.
Introduction:
Process selection:
It is the tactical choices made by a firm in picking the kind of production procedure to be followed in the process of production. The process is selected after reviewing many numbers of criteria and constraints.
Answer to Problem 8P
Precedence diagram:
Explanation of Solution
Given information:
Task | Task time (Minutes) | Immediate predecessor |
a | 0.5 | Nil |
b | 1.4 | a |
c | 1.2 | a |
d | 0.7 | a |
e | 0.5 | b, c |
f | 1 | d |
g | 0.4 | e |
h | 0.3 | g |
i | 0.5 | f |
j | 0.8 | e, i |
k | 0.9 | h, j |
m | 0.3 | k |
Number of minutes per day = 400
Desired output per day = 200 units
Precedence diagram:
The precedence diagram is drawn circles and arrows. The tasks are represented in circles and weights for each task are represented outside the circle. The arrows are represented to show which task is preceding the other task and so on.
b)
To assign: Tasks on the basis of most following tasks.
Introduction:
Process selection:
It is the tactical choices made by a firm in picking the kind of production procedure to be followed in the process of production. The process is selected after reviewing many numbers of criteria and constraints.
Explanation of Solution
Given information:
Task | Task time (Minutes) | Immediate predecessor |
a | 0.5 | Nil |
b | 1.4 | a |
c | 1.2 | a |
d | 0.7 | a |
e | 0.5 | b, c |
f | 1 | d |
g | 0.4 | e |
h | 0.3 | g |
i | 0.5 | f |
j | 0.8 | e, i |
k | 0.9 | h, j |
m | 0.3 | k |
Number of minutes per day = 400
Desired output per day = 200 units
Calculation of cycle time:
The cycle time is calculated by dividing the operating time per day by the desired output per day.
The number of following tasks, calculation of positional weight for each task is shown below.
Task | Following tasks | Number of following tasks | Calculation of positional weight | Positional weight |
a | b, c, d, e, f, g, h, i, j, k, m | 11 | 0.5 + 1.4 + 1.2 + 0.7 + 0.5 + 1 + 0.4 + 0.3 + 0.5 + 0.8 + 0.9 + 0.3 | 8.5 |
b | e, g, h, j, k, m | 6 | 1.4 + 0.5 + 0.4 + 0.3 + 0.8 + 0.9 + 0.3 | 4.6 |
c | e, g, h, j, k, m | 6 | 1.2 + 0.5 + 0.4 + 0.3 + 0.8 + 0.9 + 0.3 | 4.4 |
d | f, i, j, k, m | 5 | 0.7 + 1 + 0.5 + 0.8 + 0.9 + 0.3 | 4.2 |
e | g, h, j, k, m | 5 | 0.5 + 0.4 + 0.3 + 0.8+ 0.9 + 0.3 | 3.2 |
f | i, j, k, m | 4 | 1 + 0.5 + 0.8 + 0.9 + 0.3 | 3.5 |
g | h, k, m | 3 | 0.4 + 0.3 + 0.9 + 0.3 | 1.9 |
h | k, m | 2 | 0.3 + 0.9 + 0.3 | 1.5 |
i | j, k, m | 3 | 0.5 + 0.8 0.9 + 0.3 | 2.5 |
j | k, m | 2 | 0.8 + 0.9 + 0.3 | 2 |
k | m | 1 | 0.9 + 0.3 | 1.2 |
m | Nil | 0 | 0.3 | 0.3 |
Assigning tasks to workstations:
Workstation number | Eligible task | Assigned task | Task time | Unassigned cycle time | Reason |
2 | |||||
1 | a | a | 0.5 | 1.5 | Task 'a' is the only eligible task available |
b, c, d | b | 1.4 | 0.1 | Task 'b' has the highest positional weight | |
c, d | None | 0.1 (Idle time) | The task time is greater than the unassigned cycle time. | ||
2 | |||||
2 | c, d | c | 1.2 | 0.8 | Task 'c' has more following tasks |
d, e | d | 0.7 | 0.1 | Task 'd' has the highest positional weight | |
e, f | None | 0.1 (Idle time) | The task time is greater than the unassigned cycle time. | ||
2 | |||||
3 | e, f | e | 0.5 | 1.5 | Task 'e' has more following tasks |
f, g | f | 1 | 0.5 | Task 'f' has more following tasks | |
g, i | i | 0.5 | 0 | Task 'i' has the highest positional weight | |
2 | |||||
4 | g, j | g | 0.4 | 1.6 | Task 'g' has more following tasks |
h, j | j | 0.8 | 0.8 | Task 'j' has the highest positional weight | |
h | h | 0.3 | 0.5 | Task 'h' is the only eligible task available | |
k | None | 0.5 (Idle time) | The task time is greater than the unassigned cycle time. | ||
2 | |||||
5 | k | k | 0.9 | 1.1 | Task 'k' is the only eligible task available |
m | m | 0.3 | 0.8 | Task 'm' is the only task remaining | |
0.8 (Idle time) | All tasks completed |
Overview of tasks assignment:
Workstation | Assigned tasks | Total cycle time used | Idle time |
1 | a, b | 1.9 | 0.1 |
2 | c, d | 1.9 | 0.1 |
3 | e, f, i | 2 | 0 |
4 | g, j, h | 1.5 | 0.5 |
5 | k, m | 1.2 | 0.8 |
c)
To assign: Tasks on the basis of greatest positional weight.
Introduction:
Process selection:
It is the tactical choices made by a firm in picking the kind of production procedure to be followed in the process of production. The process is selected after reviewing many numbers of criteria and constraints.
Explanation of Solution
Given information:
Task | Task time (Minutes) | Immediate predecessor |
a | 0.5 | Nil |
b | 1.4 | a |
c | 1.2 | a |
d | 0.7 | a |
e | 0.5 | b, c |
f | 1 | d |
g | 0.4 | e |
h | 0.3 | g |
i | 0.5 | f |
j | 0.8 | e, i |
k | 0.9 | h, j |
m | 0.3 | k |
Number of minutes per day = 400
Desired output per day = 200 units
Calculation of cycle time:
The cycle time is calculated by dividing the operating time per day by the desired output per day.
The number of following tasks, calculation of positional weight for each task is shown below.
Task | Following tasks | Number of following tasks | Calculation of positional weight | Positional weight |
a | b, c, d, e, f, g, h, i, j, k, m | 11 | 0.5 + 1.4 + 1.2 + 0.7 + 0.5 + 1 + 0.4 + 0.3 + 0.5 + 0.8 + 0.9 + 0.3 | 8.5 |
b | e, g, h, j, k, m | 6 | 1.4 + 0.5 + 0.4 + 0.3 + 0.8 + 0.9 + 0.3 | 4.6 |
c | e, g, h, j, k, m | 6 | 1.2 + 0.5 + 0.4 + 0.3 + 0.8 + 0.9 + 0.3 | 4.4 |
d | f, i, j, k, m | 5 | 0.7 + 1 + 0.5 + 0.8 + 0.9 + 0.3 | 4.2 |
e | g, h, j, k, m | 5 | 0.5 + 0.4 + 0.3 + 0.8+ 0.9 + 0.3 | 3.2 |
f | i, j, k, m | 4 | 1 + 0.5 + 0.8 + 0.9 + 0.3 | 3.5 |
g | h, k, m | 3 | 0.4 + 0.3 + 0.9 + 0.3 | 1.9 |
h | k, m | 2 | 0.3 + 0.9 + 0.3 | 1.5 |
i | j, k, m | 3 | 0.5 + 0.8 0.9 + 0.3 | 2.5 |
j | k, m | 2 | 0.8 + 0.9 + 0.3 | 2 |
k | m | 1 | 0.9 + 0.3 | 1.2 |
m | Nil | 0 | 0.3 | 0.3 |
Assigning tasks to workstations:
Workstation number | Eligible task | Assigned task | Task time | Unassigned cycle time | Reason |
2 | |||||
1 | a | a | 0.5 | 1.5 | Task 'a' is the only eligible task available |
b, c, d | b | 1.4 | 0.1 | Task 'b' has the highest positional weight | |
c, d | None | 0.1 (Idle time) | The task time is greater than the unassigned cycle time. | ||
2 | |||||
2 | c, d | c | 1.2 | 0.8 | Task 'c' has the highest positional weight |
d, e | d | 0.7 | 0.1 | Task 'd' has the highest positional weight | |
e, f | None | 0.1 (Idle time) | The task time is greater than the unassigned cycle time. | ||
2 | |||||
3 | e, f | f | 1 | 1 | Task 'f' has the highest positional weight |
e, i | e | 0.5 | 0.5 | Task 'e' has the highest positional weight | |
g, i | i | 0.5 | 0 | Task 'g' has the highest positional weight | |
2 | |||||
4 | g, j | j | 0.8 | 1.2 | Task 'j' has the highest positional weight |
g | g | 0.4 | 0.8 | Task 'g' is the only eligible task available | |
h | h | 0.3 | 0.5 | Task 'h' is the only eligible task available | |
k | None | 0.5 (Idle time) | The task time is greater than the unassigned cycle time. | ||
2 | |||||
5 | k | k | 0.9 | 1.1 | Task 'k' is the only eligible task available |
m | m | 0.3 | 0.8 | Task 'm' is the only task remaining | |
0.8 (Idle time) | All tasks completed |
Overview of tasks assignment:
Workstation | Assigned tasks | Total cycle time used | Idle time |
1 | a, b | 1.9 | 0.1 |
2 | c, d | 1.9 | 0.1 |
3 | f, e, i | 2 | 0 |
4 | j, g, h | 1.5 | 0.5 |
5 | k, m | 1.2 | 0.8 |
d)
To determine: The balance delay.
Introduction:
Process selection:
It is the tactical choices made by a firm in picking the kind of production procedure to be followed in the process of production. The process is selected after reviewing many numbers of criteria and constraints.
Answer to Problem 8P
Explanation of Solution
The balance delay is also known as the percentage of idle time.
Formula to calculate percentage of idle time:
Calculation of percentage of idle time:
Most following tasks:
The percentage of idle time is 15%.
Greatest positional weight:
The percentage of idle time is 15%.
The balance delay for most following tasks and greatest positional weight rule is 15%.
Want to see more full solutions like this?
Chapter 6 Solutions
Operations Management
- A firm that produces electric golf carts has just received an order for 200 carts, which must be ready for delivery at the start of week 8. Information concerning the product structure, lead times, and quantities on hand is shown in the following table. Use this information to do each of the following: a. Construct an assembly time chart in Excel.arrow_forwardPlease answer me in typed versions, I have problems with hand-writingarrow_forwardA shop works a 400-minute day. The manager of the shop wants an output of 200 units per day for the assembly line that has the elemental tasks shown in the table. Do the following: a- What is the cycle time and what s the minimum number of workstations required b- Construct the precedence diagram. c- Assign tasks according to the most following tasks rule.. d- what is the efficiency of such line Immediate Task Task Predecessor Time a 0.5 a 1.4 a 1.2 a 0.7 0.5 f 1.0 0.4 03 05 e i 0.8 h j 0.9 k 0.3arrow_forward
- A shop works a 400-minute day. The manager of the shop wants an output of 200 units per day for the assembly line that has the elemental tasks shown in the table. Do the following: b.) Assign tasks according to the most following tasks rule. Break ties with the greatest positional weight rule. c.) Assign tasks according to the greatest positional weight rule. Break ties with the most following tasks rule. d.) Compute the efficiency level for each rule. Which one yields the better set of assignments in this instance?arrow_forwardA dress-making operation is being designed as an assemblyline. Table 10-22 shows the tasks that need to be performed, theirtask times, and preceding tasks. If the goal is to produce 30 dressesper hour, answer the questions that follow the table. (a) Compute the cycle time.(b) Which task is the bottleneck?(c) What is the maximum output for this line?(d) Compute the theoretical minimum number of stations.(e) Assign work elements to stations, using the longest tasktime rule.(f) Compute the effi ciency and balance delay of yourassignment.arrow_forwardAssembly Line Problem A shop works a 400-minute day. The manager of the shop wants an output of 200 units per day for the assembly line that has the elemental tasks shown in the following table. Task Immediate Predecessor Task(s) Task Time (minutes) a --- 0.5 b a 1.4 c a 1.2 d a 0.7 e b,c 0.5 f d g e 0.4 h g 0.3 i F 0.5 j e, I 0.8 k h, j 0.9 l k 0.3 d)Compute the efficiency of the assembly linearrow_forward
- A production process at Kenneth Day Manufacturing is shown in Figure S7.9. The drilling operation occurs separately from, and simultaneously with, sawing and sanding, which are independent and sequential operations. A product needs to go through only one of the three assembly operations (the operations are in parallel).a) Which operation is the bottleneck?b) What is the bottleneck time?c) What is the throughput time of the overall system?d) If the firm operates 8 hours per day, 20 days per month, whatis the monthly capacity of the manufacturing process?arrow_forwardA production schedule requires six work stations. However, there are nine work tasks to be performed to produce a unit of output. The warchouse is operated for seven days a week and three 8-hour shifts per day. The desired output per week is 1.728 units. The tasks, precedence relationships and the approximate amount of time required to carry out cach task is presented below. Use this information to answer questions 62 - 69 Task 1. Duration (min) 5.0 Immediate Preceding Task 3 4 4.5 2.0 3.0 3.5 2,3 4,5 1.5 2.5 7. 4.8 2.5 62. What is the available time for production in minutes? (a) 1260 (b) 1440 (c) 3,360 (d) 10080 63. The required cycle time for this operation is: (а) 2.58 (b) 5.83 (c) 7.25 (d) 9.42 64. Which activity or set of activities should be assigned to station 2? (a) 2 only (b) I and 2 (c) 3 only (d) 3 and 4 65. Which activity or set of activities should be assigned to station 4? (a) 3 only (b) 3 and 4 (c) 5 and 6 (d) 7 only 66. Which activity or set of activities should be…arrow_forwardAs the Operations Manager of Shane Manufacturing Ltd., you are given the task to balance the assembly line that is used to produce a special type of toy. b. Draw the precedence diagram for the problem that you set up in part “a” above. c. Use the example that you set up to demonstrate how you will balance the line. d. Calculate the efficiency of the line.arrow_forward
- A paced assembly line has been devised to manufacture calculators, as the following data show: LOADING... Station Work Element Assigned Work Element Time (min) S1 A 4.0 S2 D, E 0.9, 1.5 S3 C 5.0 S4 B, F, G 1.1, 1.0, 1.3 S5 H, I, J 1.1, 0.5, 1.8 S6 K 4.0 a. What is the maximum hourly output rate from this line? (Hint: The line can only go as fast as its slowest workstation.) The maximum hourly output rate is nothing calculators per hour. (Enter your response as an integer.) B. What cycle time corresponds to this maximum output rate? C. If a worker is at each station and the line operates at this maximum output rate, how much idle time is lost during each? 10-hour shift? D. What is the line's efficiency?arrow_forwardWrite A diagram that shows elemental tasks and their precedence requirements, and explain that?arrow_forwardGiven the following task, times, and sequence, develop a balanced line capable of operating with a I 0-minute cycle time at Dave Visser's company. a) Draw the precedence diagram.b) Assign tasks to the minimum feasible number of workstations according to the greatest time remaining (ranked positional weight) decision rule.c) What is the efficiency of the process?arrow_forward
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,