A manager wants to assign tasks to workstations as efficiently as possible. The immediate predecessors and task
Fantastic news! We've Found the answer you've been seeking!
Question:
- A manager wants to assign tasks to workstations as efficiently as possible. The immediate predecessors and task times are provided in the dataset under provided table.
- (5 points) Draw the precedence diagram.
- (5 points) Assuming a 7.5-hour workday, compute the cycle time needed to obtain an output of 225 units per day.
- (5 points) Determine the minimum number of workstations required.
- (5 points) Assign tasks according to greatest positional weight (sum of each task's time and the times of all following tasks)
- (5 points) Compute the resulting percent idle time for each worker (workstations).
Task | Immediate Predecessor | Task time in min |
a | ----- | 0.2 |
b | a | 0.8 |
c | b | 0.4 |
d | ----- | 0.7 |
e | d | 0.6 |
f | ----- | 0.7 |
g | f | 0.8 |
h | g | 0.6 |
i | c, e, h | 0.5 |
j | i | 0.1 |
k | j | 0.2 |
Related Book For
Operations Management
ISBN: 978-0071091428
4th Canadian edition
Authors: William J Stevenson, Mehran Hojati
Posted Date: