111k views
4 votes
Required answer of attached question as soon as possible.

Required answer of attached question as soon as possible.-example-1

1 Answer

4 votes

9514 1404 393

Answer:

see attached

Explanation:

The cycle time of 1.5 minutes tells us that each workstation has 1.5 minutes to complete its assigned tasks. We assign tasks as follows.

Starting from a list of eligible tasks—those with no unworked preceding tasks—the selection criterion says we must choose the one with the longest task time. We continue in this way until the time remaining on the workstation is less than the time required for the longest eligible task. At that point, we open a new workstation and repeat the process.

__

Comments on the solution

The numbers highlighted in red are the idle time for the workstation. Ideally, they are all positive, so as to be able to absorb any delays in executing the tasks. Here, we find that workstation 3 has no idle time, so any delay there will be a delay in required production of pumps.

The flow we have arranged is from Workstation 1 → Workstation 2 → Workstation 3. If flow back and forth between workstations were allowed, then we could assign task H to workstation 2 and tasks D and G to workstation 3 to create an idle time of 0.1 minutes at each workstation. Such an assignment would not strictly adhere to the "longest task first" criterion.

Required answer of attached question as soon as possible.-example-1
User MartinByers
by
3.8k points