1 / 54

Assignment Problem

Assignment Problem. Step by Step illustration automatically generated by a C# application:). About the presentation. Name. Class. Institution. 3/8/2008 12:00:00 AM. fremcj07@oneonta.edu. Description of Assignment Problem!.

kfine
Download Presentation

Assignment Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Assignment Problem Step by Step illustration automatically generated by a C# application:)

  2. About the presentation Name Class Institution 3/8/2008 12:00:00 AM fremcj07@oneonta.edu

  3. Description of Assignment Problem! Let C be an nxn matrix representing the costs of each of n workers to perform any of n jobs. The assignment problem is to assign jobs to workers so as to minimize the total cost. Since each worker can perform only one job and each job can be assigned to only one worker the assignments constitute an independent set of the matrix C.

  4. Step 1 Step 1 of six different steps For each row of the matrix, find the smallest element and subtract it from every element in its row. Go to Step 2.

  5. Step 2 Step 2 of six different steps Find a zero (Z) in the resulting matrix. If there is no starred zero in its row or column, star Z. Repeat for each element in the matrix. Go to Step 3.

  6. Step 3 Step 3 of six different steps Cover each column containing a starred zero. If K columns are covered, the starred zeros describe a complete set of unique assignments. In this case, Go to DONE, otherwise, Go to Step 4.

  7. Step 4 Step 4 of six different steps Find a noncovered zero and prime it. If there is no starred zero in the row containing this primed zero, Go to Step 5. Otherwise, cover this row and uncover the column containing the starred zero. Continue in this manner until there are no uncovered zeros left. Save the smallest uncovered value and Go to Step 6.

  8. Step 5 Step 5 of six different steps Construct a series of alternating primed and starred zeros as follows. Let Z0 represent the uncovered primed zero found in Step 4. Let Z1 denote the starred zero in the column of Z0 (if any). Let Z2 denote the primed zero in the row of Z1 (there will always be one). Continue until the series terminates at a primed zero that has no starred zero in its column. Unstar each starred zero of the series, star each primed zero of the series, erase all primes and uncover every line in the matrix. Return to Step 3.

  9. Step 6 Step 6 of six different steps Add the value found in Step 4 to every element of each covered row, and subtract it from every element of each uncovered column. Return to Step 4 without altering any stars, primes, or covered lines.

  10. Step 7 Step 7 of six different steps Done Assignment pairs are indicated by the positions of the starred zeros in the cost matrix. If C(i,j) is a starred zero, then the element associated with row i is assigned to the element associated with column j.

  11. Step0

  12. Step1

  13. Step1

  14. Step1

  15. Step1

  16. Step1

  17. Step1

  18. Step1

  19. Step1

  20. Step2

  21. Step2

  22. Step3

  23. Step4

  24. Step6

  25. Step6

  26. Step4

  27. Step4

  28. Step4

  29. Step4

  30. Step5

  31. Step3

  32. Step3

  33. Step4

  34. Step6

  35. Step6

  36. Step4

  37. Step4

  38. Step4

  39. Step6

  40. Step6

  41. Step4

  42. Step4

  43. Step4

  44. Step4

  45. Step5

  46. Step3

  47. Step3

  48. Step3

  49. Step7

  50. We have found a solution! The sum should be ...

More Related