Concept explainers
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.
a)
To draw: The precedence diagram.
Answer to Problem 6P
Precedence diagram:
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 = 1.5 minutes
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)
1)
To assign: Tasks on the basis of greatest positional weight.
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 = 1.5 minutes
The number of following tasks, calculation of positional weight, processing time for each task is shown below.
Task | Following tasks | Number of following tasks | Calculation of positional weight | Positional weight | Processing time |
a | b, c, d, f, g, h, i, j, k, l | 10 | 0.1 + 0.2 + 0.9 + 0.6 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 3.9 | 0.1 |
b | c, d, f, g, h, i, j, k, l | 9 | 0.2 + 0.9 + 0.6 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 3.8 | 0.2 |
c | d, f, g, h, i, j, k, l | 8 | 0.9 + 0.6 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 3.6 | 0.9 |
d | f, g, h, i, j, k, l | 7 | 0.6 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 2.7 | 0.6 |
e | f, g, h, i, j, k, l | 7 | 0.1 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 2.2 | 0.1 |
f | g, h, i, j, k, l | 6 | 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 2.1 | 0.2 |
g | h, i, j, k, l | 5 | 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 1.9 | 0.4 |
h | i, j, k, l | 4 | 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 1.5 | 0.1 |
i | j, k, l | 3 | 0.2 + 0.7+ 0.3 + 0.2 | 1.4 | 0.2 |
j | k, l | 2 | 0.7+ 0.3 + 0.2 | 1.2 | 0.7 |
k | l | 1 | 0.3 + 0.2 | 0.5 | 0.3 |
l | Nil | 0 | 0.2 | 0.2 | 0.2 |
Assigning tasks to workstations:
Workstation number | Eligible task | Assigned task | Task time | Unassigned cycle time | Reason |
1.5 | |||||
1 | a, e | a | 0.1 | 1.4 | Task 'a' has highest positional weight |
b, e | b | 0.2 | 1.2 | Task 'b' has highest positional weight | |
c, e | c | 0.9 | 0.3 | Task 'c' has highest positional weight | |
d, e | e | 0.1 | 0.2 | Task 'e' is the only eligible task available | |
d | None | 0.2 (Idle time) | The task time is greater than the unassigned cycle time. | ||
1.5 | |||||
2 | d | d | 0.6 | 0.9 | Task 'd' is the only eligible task available |
f | f | 0.2 | 0.7 | Task 'f' is the only eligible task available | |
g | g | 0.4 | 0.3 | Task 'g' is the only eligible task available | |
h | h | 0.1 | 0.2 | Task 'h' is the only eligible task available | |
i | i | 0.2 | 0 | Task 'i' is the only eligible task available | |
1.5 | |||||
3 | j | j | 0.7 | 0.8 | Task 'j' is the only eligible task available |
k | k | 0.3 | 0.5 | Task 'k' is the only eligible task available | |
l | l | 0.2 | 0.3 | Task 'l' is the only eligible task available | |
0.3 (Idle time) | All tasks completed |
Overview of tasks assignment:
Workstation | Assigned tasks | Total cycle time used | Idle time |
1 | a, b, c, e | 1.3 | 0.2 |
2 | d, f, g, h, i | 1.5 | 0 |
3 | j, k, l | 1.2 | 0.3 |
2)
To assign: Tasks on the basis of most following tasks.
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 = 1.5 minutes
The number of following tasks, calculation of positional weight, processing time for each task is shown below.
Task | Following tasks | Number of following tasks | Calculation of positional weight | Positional weight | Processing time |
a | b, c, d, f, g, h, i, j, k, l | 10 | 0.1 + 0.2 + 0.9 + 0.6 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 3.9 | 0.1 |
b | c, d, f, g, h, i, j, k, l | 9 | 0.2 + 0.9 + 0.6 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 3.8 | 0.2 |
c | d, f, g, h, i, j, k, l | 8 | 0.9 + 0.6 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 3.6 | 0.9 |
d | f, g, h, i, j, k, l | 7 | 0.6 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 2.7 | 0.6 |
e | f, g, h, i, j, k, l | 7 | 0.1 + 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 2.2 | 0.1 |
f | g, h, i, j, k, l | 6 | 0.2 + 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 2.1 | 0.2 |
g | h, i, j, k, l | 5 | 0.4 + 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 1.9 | 0.4 |
h | i, j, k, l | 4 | 0.1 + 0.2 + 0.7+ 0.3 + 0.2 | 1.5 | 0.1 |
i | j, k, l | 3 | 0.2 + 0.7+ 0.3 + 0.2 | 1.4 | 0.2 |
j | k, l | 2 | 0.7+ 0.3 + 0.2 | 1.2 | 0.7 |
k | l | 1 | 0.3 + 0.2 | 0.5 | 0.3 |
l | Nil | 0 | 0.2 | 0.2 | 0.2 |
Assigning tasks to workstations:
Workstation number | Eligible task | Assigned task | Task time | Unassigned cycle time | Reason |
1.5 | |||||
1 | a, e | a | 0.1 | 1.4 | Task 'a' has the most following tasks |
b, e | b | 0.2 | 1.2 | Task 'b' has the most following tasks | |
c, e | c | 0.9 | 0.3 | Task 'c' has the most following tasks | |
d, e | e | 0.1 | 0.2 | Task 'e' is the only eligible task available | |
d | None | 0.2 (Idle time) | The task time is greater than the unassigned cycle time. | ||
1.5 | |||||
2 | d | d | 0.6 | 0.9 | Task 'd' is the only eligible task available |
f | f | 0.2 | 0.7 | Task 'f' is the only eligible task available | |
g | g | 0.4 | 0.3 | Task 'g' is the only eligible task available | |
h | h | 0.1 | 0.2 | Task 'h' is the only eligible task available | |
i | i | 0.2 | 0 | Task 'i' is the only eligible task available | |
1.5 | |||||
3 | j | j | 0.7 | 0.8 | Task 'j' is the only eligible task available |
k | k | 0.3 | 0.5 | Task 'k' is the only eligible task available | |
l | l | 0.2 | 0.3 | Task 'l' is the only eligible task available | |
0.3 (Idle time) | All tasks completed |
Overview of tasks assignment:
Workstation | Assigned tasks | Total cycle time used | Idle time |
1 | a, b, c, e | 1.3 | 0.2 |
2 | d, f, g, h, i | 1.5 | 0 |
3 | j, k, l | 1.2 | 0.3 |
c)
To determine: The percentage of idle time.
Answer to Problem 6P
Explanation of Solution
Formula to calculate percentage of idle time:
Calculation of percentage of idle time:
The solutions for most following tasks rule and highest positional weight is same. Hence, the percentage of idle time will also be the same.
The percentage of idle time is 11.11%.
Want to see more full solutions like this?
Chapter 6 Solutions
OPERATIONS MANAGEMENT(LL)-W/CONNECT
- I need to forecast using a 3-Period-Moving-Average-Monthly forecasting model which I did but then I need to use my forecast numbers to generate a Master Production Schedule (MPS) I have to Start with actual sales (my own test data numbers) for August-2022 Oct-2022 i need to create MPS to supply demand starting November-2022 April 2023 I just added numbers without applying formulas to the mps on the right side of the spreadsheet because I do not know how to do it. The second image is the example of what it should look like. Thank You.arrow_forwardSolve the following Question 1. How do volume and variety affect the process selection and layout types? Discuss 2. How is the human resource aspect important to operation function? Discuss 3. Discuss the supply network design and its impact on the overall performance of the organization.arrow_forwardHelp with question?arrow_forward
- What are some good examples of bullet points on a resume for a Christian Elementary School?arrow_forwardWhat is an example of a cover letter for a Christian School Long-Term Substitute Teaching position?arrow_forwardThe 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_forward
- working 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_forwarda/ 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_forwardWith the aid of examples, fully discuss any five (5) political tactics used in organisations.arrow_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.