Old Oregon Wood Store
Group Case Study: Old Oregon Wood Stove
Old Oregon Wood Store
Mr. George Brown:
From the data that you provided which contained the manufacturing times of your staff consisting of Tom, Leon, Cathy, Randy, and yourself we were able to determine the optimal staffing which will produce the fastest manufacturing times by utilizing an assignment algorithm. The process involved in preparing the data and the results of the algorithm is as follows. The first was to determine how many minutes each step of the manufacturing process took for each of your employees. Once these figures were determined we inserted them into a quality management software tool, named QM for Windows (QM), which has a formatted table that can calculate the assignment algorithm.
QM Assignment Solution
Based on the solutions from QM we have determined the optimal staffing per step in your manufacturing process that will produce the fastest completion times: Tom to preparation, Cathy to assembly, George to finishing, and Leon to packaging. This staffing assignment, presented in Table 1, details the ideal position for each original crew member in your manufacturing process. When assigning your original staff to each step presented in Table 1 you can expect a total completion time of 240 minutes for each table. Assuming that there are 480 minutes available in a normal work day you can assume that 2 tables can be made per day.
Table 1
QM’s Assignment Solution for Optimal Staffing with Original Crew Person | Job | Time | Tom | Preparation | 100 | Cathy | Assembly | 70 | George | Finishing | 60 | Leon | Packaging | 10 | | Total time | 240 |
We then compared the production time against each station time to determine how many tables can be completed in a work day. Table 2 details our calculations which show how many stations can be completed in the completion time that was provided in Table 1. From Table 2 we noticed that the preparation step’s maximum completion time is
Old Oregon Wood Store
Mr. George Brown:
From the data that you provided which contained the manufacturing times of your staff consisting of Tom, Leon, Cathy, Randy, and yourself we were able to determine the optimal staffing which will produce the fastest manufacturing times by utilizing an assignment algorithm. The process involved in preparing the data and the results of the algorithm is as follows. The first was to determine how many minutes each step of the manufacturing process took for each of your employees. Once these figures were determined we inserted them into a quality management software tool, named QM for Windows (QM), which has a formatted table that can calculate the assignment algorithm.
QM Assignment Solution
Based on the solutions from QM we have determined the optimal staffing per step in your manufacturing process that will produce the fastest completion times: Tom to preparation, Cathy to assembly, George to finishing, and Leon to packaging. This staffing assignment, presented in Table 1, details the ideal position for each original crew member in your manufacturing process. When assigning your original staff to each step presented in Table 1 you can expect a total completion time of 240 minutes for each table. Assuming that there are 480 minutes available in a normal work day you can assume that 2 tables can be made per day.
Table 1
QM’s Assignment Solution for Optimal Staffing with Original Crew Person | Job | Time | Tom | Preparation | 100 | Cathy | Assembly | 70 | George | Finishing | 60 | Leon | Packaging | 10 | | Total time | 240 |
We then compared the production time against each station time to determine how many tables can be completed in a work day. Table 2 details our calculations which show how many stations can be completed in the completion time that was provided in Table 1. From Table 2 we noticed that the preparation step’s maximum completion time is
References: Render, B., Stair, R. M., & Hanna, M. E. (2012). Quantitative analysis for management. Upper Saddle River, NJ, NJ: Pearson Prentice Hall.