In this video you will be able to understand how to solve an assignment problem (Minimization) using Hungarian method. The step by step procedure is provided therefore you are able to follow. Thanks for watching and all the best see you in our next video.
The outline of the presentation will be as follows:
Introduction to Assignment
•The assignment method is a special form of the transportation method being designed for the solution of problems in which an equal number of sources and destinations must be paired off in an optimum manner i.e. Rows are equal to Columns. The number of origin must equal the number of destinations i.e. the Table MUST be squared
• The goal is to find an optimal assignment of agents to tasks without assigning an agent more than once and ensuring that all tasks are completed as required.
• The objective of the assignment may be to: Minimize the total time to complete a set of tasks, Minimize the cost of the assignments, Maximize skill ratings and Maximize revenue or profit.
• Types of Assignment Problem
1. Minimization Problem
2. Maximization Problem
• Applications of assignment problems are varied in real life.
1. Assigning employees to tasks (HR department)
2. Assigning Machines to production jobs (Production Department)
3. Assigning to fleets of aircraft to particular trips
4. Assigning school buses to routes.
5. Networking computers (ICT Department)
Негізгі бет Assignment Problem using Hungarian Method (Minimization Problem)
Пікірлер: 3