![]() | Only 14 pages are availabe for public view |
Abstract In this thesis, the assignment problem is presented with traditional solution methods and it also solved by using a Min-plus algebra technique model. The new algorithm is introduced with an example which is involved in this study to illustrate the idea and the advantages of using min-plus algebra. Last a comparison between old methods and new one is introduced. The main objectives of this thesis are: - to apply Min-plus algebra as a method to find a solution to the assignment problem. - Future work for the proposed method. This thesis is structured as follows: - In Chapter 1 “introduction” which presents a simple background about OR, LP, Networks, Transportation problem, Assignment problem & Max-plus algebra which is the base for extracting Min-plus algebra and objective problem , problem definition and outline of thesis. - In Chapter 2 “Literature Review about Max-plus algebra” which including literature review about Max-plus algebra since 1994 up till 2021 and Assignment problem using Max-plus algebra. - In Chapter 3 “Max-plus algebra” which talking about MPA definitions & basic properties, Min-plus algebra, diffident solved applications. - In Chapter 4 “Assignment problem” which show in points the types of ASP , ASP problem description , algorithms, model , approaches. - In Chapter 5 “Proposed method” presents the proposed algorithm, a solved assignment example using the new technique , comments on the solution using the new technique, at last conclusion & future work. |