Concept explainers
For the given set of tasks, do the following:
a. Develop the precedence diagram
b. Determine the minimum cycle time and then calculate the cycle time for a desired output of 500 units in a seven-hour day. Why might a manager use a cycle tune of 50 seconds?
c. Determine the minimum number of workstations for output of 500 units per day
d. Balance the line using the greatest positional weight heuristic. Break ties with the most following tasks heuristic. Use a cycle tune of 50 seconds.
e. Calculate the percentage idle time for the line.
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 7P
Precedence diagram:
Explanation of Solution
Given information:
Task | Task time (seconds) | Immediate predecessor |
A | 45 | Nil |
B | 11 | A |
C | 9 | B |
D | 50 | Nil |
E | 26 | D |
F | 11 | E |
G | 12 | C |
H | 10 | C |
I | 9 | F, G , H |
J | 10 | I |
Total | 193 |
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 determine: The minimum cycle time and the cycle time for the desired output.
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 7P
Explanation of Solution
Given information:
Task | Task time (seconds) | Immediate predecessor |
A | 45 | Nil |
B | 11 | A |
C | 9 | B |
D | 50 | Nil |
E | 26 | D |
F | 11 | E |
G | 12 | C |
H | 10 | C |
I | 9 | F, G , H |
J | 10 | I |
Total | 193 |
Operating hours per day = 7
Sum of all task times = 193 seconds
Desired output per day = 500
Calculation of minimum cycle time:
The minimum cycle time is equal to the time of the longest task.
The minimum cycle time is 50 seconds / unit.
Calculation of cycle time for the desired output:
The cycle time is calculated by dividing the operating time per day in seconds by the desired output per day.
The cycle time for the desired output is 50.4 seconds / unit.
The manager might use a cycle time of 50 seconds because it is closer to the calculated time. Also the task times are integers giving it a good chance to balance the line effectively.
c)
To determine: The minimum number of workstations for the desired output.
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 7P
Explanation of Solution
Given information:
Task | Task time (seconds) | Immediate predecessor |
A | 45 | Nil |
B | 11 | A |
C | 9 | B |
D | 50 | Nil |
E | 26 | D |
F | 11 | E |
G | 12 | C |
H | 10 | C |
I | 9 | F, G , H |
J | 10 | I |
Total | 193 |
Operating hours per day = 7
Sum of all task times = 193 seconds
Desired output per day = 500
Calculation of minimum number of workstations:
The minimum number of workstations is calculated by dividing the sum of all task times with the calculated cycle time.
The minimum number of workstations for the desired output is 4 workstations.
d)
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 | Duration (minutes) | Immediate (Predecessor) |
a | 0.1 | Nil |
b | 0.2 | a |
c | 0.9 | b |
d | 0.6 | c |
e | 0.1 | Nil |
f | 0.2 | d, e |
g | 0.4 | f |
h | 0.1 | g |
i | 0.2 | h |
j | 0.7 | i |
k | 0.3 | j |
l | 0.2 | k |
Cycle time = 50 seconds
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, G, H, I, J | 6 | 45 + 11 + 9 + 12 + 10 + 9 + 10 | 106 |
B | C, G, H, I, J | 5 | 11 + 9 + 12 + 10 + 9 + 10 | 61 |
C | G, H, I, J | 4 | 9 + 12 + 10 + 9 + 10 | 50 |
D | E, F, I, J | 4 | 50 + 26 + 11 + 9 + 10 | 106 |
E | F, I, J | 3 | 26 + 11 + 9 + 10 | 56 |
F | I, J | 2 | 11 + 9 + 10 | 30 |
G | I, J | 2 | 12 + 9 + 10 | 31 |
H | I, J | 2 | 10 + 9 + 10 | 29 |
I | J | 1 | 9 + 10 | 19 |
J | Nil | 0 | 10 | 10 |
Assigning tasks to workstations:
Workstation number | Eligible task | Assigned task | Task time | Unassigned cycle time | Reason |
50 | |||||
1 | A, D | A | 45 | 5 | Task 'A' has more following tasks |
B, D | None | 5 (Idle time) | The task time is greater than the unassigned cycle time. | ||
50 | |||||
2 | B, D | D | 50 | 0 | Task 'D' has the highest positional weight |
50 | |||||
3 | B, E | B | 11 | 39 | Task 'B' has the highest positional weight |
C, E | E | 26 | 13 | Task 'E' has the highest positional weight | |
C, F | C | 9 | 4 | Task 'C' has the highest positional weight | |
F, G, H | None | 4 (Idle time) | The task time is greater than the unassigned cycle time. | ||
50 | |||||
4 | F, G, H | G | 12 | 38 | Task 'G' has the highest positional weight |
F, H | F | 11 | 27 | Task 'F' has the highest positional weight | |
H | H | 10 | 17 | Task 'H' is the only eligible task available | |
I | I | 9 | 8 | Task 'I' is the only eligible task available | |
J | None | 8 (Idle time) | The task time is greater than the unassigned cycle time. | ||
50 | |||||
5 | J | J | 10 | 40 | Task 'J' is the only task remaining |
40 (Idle time) | All tasks completed |
Overview of tasks assignment:
Workstation | Assigned tasks | Total cycle time used | Idle time |
1 | A | 45 | 5 |
2 | D | 50 | 0 |
3 | B, E, C | 46 | 4 |
4 | G, F, H, I | 42 | 8 |
5 | J | 10 | 40 |
e)
To determine: The percentage of idle time.
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 7P
Explanation of Solution
Formula to calculate percentage of idle time:
Calculation of percentage of idle time:
The percentage of idle time is 22.80%.
Want to see more full solutions like this?
Chapter 6 Solutions
Loose-leaf for Operations Management (The Mcgraw-hill Series in Operations and Decision Sciences)
- The supply chain is a conventional notion, but organizations are only really interested in making products that they can sell to customers. Provided they have reliable supplies of materials and reasonable transport for finished products, logistics is irrelevant. Do you think this is true? If yes, explain, and if no, clearly explain as well.arrow_forwardworking as a program operations managerarrow_forward12 X1, X230 1 x =0x2 write the Following linear Programming model by 1- general Form Canonical Forms Canonical formY 2- Standard Form Max Z=35X+ 4 X 2 +6 X3 ST. X+2X2-5x3 = 40 3X, + 6X2 + 7x 3 = 30 7x, +lox2 x3 = 50 X3 X 2 X 3 <0arrow_forward
- a/ a Minimum cost assign each worker for one job at Jobs J1 12 33 WI 2 4 6 W2 5 W3 5 33 6 7arrow_forwardوبة واضافة هذه القيمة الى القيم Ex: Assign each job for each worker at minimum total Cost عمل لكل عامل وبأقل كلفة ممكنة obs الأعمال Workors العمال J1 J2 J3 J4 W₁ 15 13 14 12 W2 11 12 15 13 W3 13 12 10 11 W4 15 17 14 16arrow_forwardThe average completion time (flow time) for the sequence developed using the FCFS rule = 11.75 days (round your response to two decimal places). The percentage utilization for the sequence developed using the FCFS rule = 42.55 % (enter your response as a percentage rounded to two decimal places). b) Using the SPT (shortest processing time) decision rule for sequencing the jobs, the order is (to resolve a tie, use the order in which the jobs were received): An Alabama lumberyard has four jobs on order, as shown in the following table. Today is day 205 on the yard's schedule. In what sequence would the jobs be ranked according to the decision rules on the left: Job Due Date A 212 B 209 C 208 D 210 Duration (days) 6 3 3 8 Sequence 1 Job B 2 3 4 A D The average tardiness (job lateness) for the sequence developed using the SPT rule = 5.00 days (round your response to two decimal places). The average completion time (flow time) for the sequence developed using the SPT rule = 10.25 days…arrow_forward
- With the aid of examples, fully discuss any five (5) political tactics used in organisations.arrow_forwarda. With the aid of examples, define discrimination. b. Fully discuss any four (4) types of discrimination in the workplacearrow_forwardRead the Following Extract and Answer the Questions that Follows:The word politics has a somewhat negative connotation. It suggests that someone is attempting touse means or to gain ends that are not sanctioned by the organisation. Political behaviour, as we’vedefined it is quite neutral. Similarly, power is not inherently negative. Whether a person viewspower and politics as unsavoury topics depends on several considerations, most important perhapsbeing where the individual stands on a specific issue in each situation. Nonetheless, most managersare reluctant to admit to political character of their own work settings.Discuss any Five (5) Political tactics you know.arrow_forward
- Describe current features of Cigna Accredo pharmacy own appraisal forms and compare the system used against the textbook’s description of desirable features of appraisal forms. What improvements would you recommend and why?arrow_forwardProvide a recommendation of a combination of different methods of performance data that could be used to arrive at an overall score for each person being rated in cigna Accredo pharmacy. Explain the comprehensive system you have recommended and why you have chosen this combination of tools. Support your answer with research.arrow_forwardAlready got wrong answer Plz Don't use chatgptarrow_forward
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill EducationOperations 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 LearningProduction and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.