1. TM 631 Optimization Assignment Problems

2. Prototype Problem K-Corp has 3 parts, each of which can be assigned to 1 of 3 machines. The problem is to assign 1 part to one machine only so as to minimize the total production costs. Relevant data are: Cost to Produce Part i on Machine j

3. LP Formulation X machineiassignedtotaskj else ij  1 0,, MinZtotalproductiont st Eachmachinetobeusedonce Eachparttobeassignedtoamachine  cost..

4. LP Formulation X machineiassignedtotaskj else ij  1 0,, MinZXXXX st XXX XXX XXX XXX XXX XXX        912119 1 1 1 1 1 1 121333 111213 212223 313233 112131 212223 313233..... machine 1 assigned machine 2 assigned machine 3 assigned part 1 assigned part 2 assigned part 3 assigned

5. LP Formulation MinZcX st Xjn Xin ij j n i n i n j n          11 1 1 12 12..,,,...,,,,..., Xallij ij  0,

6. Transportation Formulation Assignment special case of Transportation suppliers = destinations = n s i = d j = 1

7. Excel Approach Excel doesn’t have special Assignment problem tool, but we can set up the problems like an general LP or Transportation problem. The books graphic for Excel use follow.

10. Modeled as Network 1 3 2 1 2 3 9 12 11 10 8 13 10 11 9 111111 Supply Demand

11. Class Problem K-Corp has 4 projects underway and 3 possible EngManagers who could possibly be assigned to the projects. In order to determine who to assign to each project, the enterprise manager ranks each employee on background, experience, interpersonal skills, and organizational skills. A final score for each employee for each project is determined. Maximize the assignment score.

12. Class Problem

13. This will not work, why not?

14. Prototype Problem Hungarian Algorithm K-Corp has 3 parts, each of which can be assigned to 1 of 3 machines. The problem is to assign 1 part to one machine only so as to minimize the total production costs. Relevant data are: Cost to Produce Part i on Machine j

15. Prototype Problem Hungarian Algorithm Step 1) Subtract the smallest number in each row from every number in the row. (This is called row reduction.) Enter the results in a new table. Cost to Produce Part i on Machine j

16. Prototype Problem Hungarian Algorithm Step 2) Subtract the smallest number in each column from every number in the column. (This is called column reduction.) Enter the results in a new table. Cost to Produce Part i on Machine j

17. Prototype Problem Hungarian Algorithm Step3. Test whether an optimal assignment can be made. You do this by determining the minimum number of lines needed to cover (i.e., cross out) all zeros. If the number of equals the number of rows, an optimal set of assignments is possible. In that case, go to step 6. Otherwise go on to step 4. Optimal, go to step 6.

18. Prototype Problem Hungarian Algorithm 6. Make the assignments one at a time in positions that have zero elements. Begin rows or columns that have only one zero. Since each row and each column nee receive exactly one assignment, cross out both the row and the column involved each assignment is made. Then move on to the rows and columns that are n crossed out to select the next assignment, with preference again given to any such or column that has only one zero that is not crossed out. Continue until every row every column has exactly one assignment, and has been crossed out. Machine 1 to Part 1 Machine 2 to Part 2 Machine 3 to Part 3

19. Hungarian Algorithm other 4. If the number of lines is less than the number of rows, modify the table in the following way: – a. Subtract the smallest uncovered number from every uncovered number in table. – b. Add the smallest uncovered number to the numbers at intersections of cover lines. – c. Numbers crossed out but not at the intersections of cross-out lines carry over changed to the next table. 5. Repeat steps 3 and 4 until an optimal set of assignments is possible.