3 views

Uploaded by bachayadav

Linear Programming Applications

- math 1210 pipeline project
- Lin Do Users Manual
- http://balkanmine2017.com
- 1-s2.0-S0951832010002048-main.pdf
- Design of Passive Systems for Control of Inelastic Structures
- 2013_Decision Aid Models and Systems For
- OPTIMIZATION OF STACKING SEQUENCE OF COMPOSITE CYLINDRICAL SHELLS USING GENETIC ALGORITHM
- Article 5
- 5.Risk Based Maintenance
- DanaInfo Ieeexplore.ieee.Org+04651442
- The Assignment Problem
- Enhancement of Reliability and Loss Reduction with Distribution Switches Upgrade by Network Reconfiguration
- m1010 p2
- Optimisation Comparison
- 1radE
- 4.IJBMRAPR20174
- Science
- sciba4a
- SEEM3470_tuto_02
- ETOAJ.MS.ID.555586

You are on page 1of 27

Assignment Problem

Introduction

linear programming problems

assignment problem

Objectives

numerical example

assignment problem

which

of machines (laborers) to jobs without assigning an agent more than

once and ensuring that all jobs are completed

jobs, or to maximize skill ratings, maximize the total satisfaction of

the group or to minimize the cost of the assignments

D Nagesh Kumar, IISc

finish the job

the sum of ratings among all.

Representation of this problem as a special case of transportation

problem

laborers as sources

tasks as destinations

or task depending on whether m < n or m > n, respectively

D Nagesh Kumar, IISc

0, if the j th job is not assigned to the i th machine

xij =

1, if the j th job is assigned to the i th machine

m

Minimize

c

i =1 j =1

ij

xij

Since each task is assigned to exactly one laborer and each laborer is

assigned only one job, the constraints are

n

x

i =1

ij

x

j =1

ij

=1

for j = 1, 2,...n

=1

for i = 1, 2,...m

xij = 0 or 1

Due to the special structure of the assignment problem, the solution can

be found out using a more convenient method called Hungarian method.

Example (1)

10

each combination is shown in the table below. Determine the

minimal job machine combinations

Solution:

Step 1:

Create zero elements in the cost matrix (zero assignment) by subtracting the

smallest element in each row (column) from the corresponding row (column).

Considering the rows first, the resulting cost matrix is obtained by subtracting 5

from row 1, 10 from row 2 and 13 from row 3

11

Step 2:

Repeating the same with columns, the final cost matrix is

12

Thus the optimal assignment is (1,1), (2,3) and (3,2)

The total cost is equal to (5 +12+13) = 60

D Nagesh Kumar, IISc

Example (2)

But in more complicate problems, additional rules are required which are

explained in the next example.

job machine combinations.

13

14

Solution:

Step 1: Create zero elements in the cost matrix by subtracting the

smallest element in each row from the corresponding row.

15

16

Step 2: Repeating the same with columns, the final cost matrix is

Both of these are in column 1, which means that both jobs 1 and 3

should be assigned to machine 1

D Nagesh Kumar, IISc

17

assignment to the zero elements is not as in the previous example

and columns so that all the zeros are crossed out

18

Subtract it from every uncrossed element and also add it to every

element at the intersection of the two lines.

19

If the optimal solution had not been obtained in the last step, then the

procedure of drawing lines has to be repeated until a feasible solution

is achieved.

Problem (TSP) as an Assignment Problem

point

He has to start from any one city and visit each city only once.

Suppose he starts from the kth city and the last city he visited is m

Let the cost of travel from ith city to jth city be cij.

m

Minimize

c

i =1 j =1

20

ij

xij

as an Assignment Problem contd.

n

x

i =1

ij

x

j =1

ij

=1

for j = 1, 2,...n, i j , i m

=1

for i = 1, 2,...m, i j , i m

xmk = 1

xij = 0 or 1

Solution Procedure:

21

Solve the problem as an assignment problem using the method used to solve

the above examples

If the solutions thus found out are cyclic in nature, then that is the final

solution

D Nagesh Kumar, IISc

as an Assignment Problem contd.

Solution Procedure contd.

22

If it is not cyclic, then select the lowest entry in the table (other than

zero)

Delete the row and column of this lowest entry and again do the zero

assignment in the remaining matrix

If not, include the next higher entry in the table and the procedure is

repeated until a cyclic assignment is obtained.

23

Consider a four city TSP for which the cost between the city pairs are

as shown in the figure below. Find the tour of the salesman so that

the cost of travel is minimal.

Cost matrix

contd.

Solution:

24

shown below.

cyclic

D Nagesh Kumar, IISc

contd.

Step 2:

25

If there is a tie in selecting the lowest entry, then break the tie

arbitrarily

contd.

26

Required tour is 1 43 2 1

D Nagesh Kumar, IISc

Thank You

27

- math 1210 pipeline projectUploaded byapi-272871235
- Lin Do Users ManualUploaded byEdgardo Contreras
- http://balkanmine2017.comUploaded byMikan Radenko Mikanović
- 1-s2.0-S0951832010002048-main.pdfUploaded bySai Ram
- Design of Passive Systems for Control of Inelastic StructuresUploaded byJulian Galvis
- 2013_Decision Aid Models and Systems ForUploaded bypaulsiddhartha0
- OPTIMIZATION OF STACKING SEQUENCE OF COMPOSITE CYLINDRICAL SHELLS USING GENETIC ALGORITHMUploaded byTJPRC Publications
- Article 5Uploaded bykipos267
- 5.Risk Based MaintenanceUploaded byLuis Earles Delgado
- DanaInfo Ieeexplore.ieee.Org+04651442Uploaded byBeni Akhirul Ramadhan
- The Assignment ProblemUploaded byArmaan A
- Enhancement of Reliability and Loss Reduction with Distribution Switches Upgrade by Network ReconfigurationUploaded byIRJET Journal
- m1010 p2Uploaded byapi-242082851
- Optimisation ComparisonUploaded byVeiliLook
- 1radEUploaded byRahmad Aldi
- 4.IJBMRAPR20174Uploaded byTJPRC Publications
- ScienceUploaded bysugodade
- sciba4aUploaded bypostscript
- SEEM3470_tuto_02Uploaded bysalim
- ETOAJ.MS.ID.555586Uploaded byRubin Poudel
- 09CE0B48d01Uploaded bystvictoria1
- Px c 3874525Uploaded byPallav Dutta
- Congestion 1Uploaded byjohnoftheroad
- Guerra_DesignOptUploaded bysenselessapprentice
- Chapter 9Uploaded byHassan Funsho Akande
- Optimal PID DesignUploaded bymousa bagherpourjahromi
- 1608.04467.pdfUploaded bysrivaishnavi
- Fault Diagnosis Using Genetic Algorithms and Principal CurvesUploaded byesatjournals
- Power Distribution System Planning With ReliabilityUploaded byTaner Yener
- 34036609Uploaded byAgram1

- Vortex FlowUploaded bybachayadav
- Self Study ReportUploaded bybachayadav
- Important Topics For GATE.pdfUploaded byVivek Bhatia
- How to Use Virtual CalculatorUploaded byRobin Flyer
- one dimensional flowUploaded bybachayadav
- Presentation on motor oilsUploaded bybachayadav
- Sbi Clerk Mock paperUploaded bybachayadav
- English Grammar BookUploaded byIsmeet Singh
- presentation on value added taxUploaded bybachayadav
- Sample CopyUploaded bybachayadav
- ElectromagnetismUploaded byEralyn Ebon
- Lubrication in I. C. EngineUploaded bybachayadav
- After Gate by s k mondalUploaded bysonalibara
- lec18Uploaded bybachayadav
- Thermo - Hydrulic Turbine - Dimensional AnlysisUploaded bybachayadav
- Unconventional Machining Process Student CopyUploaded bybachayadav
- Impact of JetUploaded bybachayadav
- GATE ColumnUploaded bybachayadav
- Unit-3-61.pdfUploaded byDeepankumar Athiyannan
- FP 1 Objective QuestionsUploaded bybachayadav
- GATE IES Thin Cylinder and SpringUploaded bybachayadav
- ME IES 2014 Objective Paper IIUploaded bybachayadav
- ME IES 2014 Conventional Paper IUploaded bybachayadav
- ME IES 2014 Objective Paper IUploaded bybachayadav
- StaticsUploaded byNurul 'Uyun Ahmad
- ME-GATE'14-Paper-03Uploaded byAjendra Singh
- Sridhar ResumeUploaded bybachayadav
- MQCUploaded bybachayadav

- DVRS_KSCSTUploaded byRUKHSAR NANADI
- The first term of BICYCLE PEACE & LOVE JOURNEYUploaded byJaved Naik
- EXPRO-CFD- Progress in Fluid Structure InteractionUploaded byalireza_vatandoust
- Brahms.emu.Edu.tr Rza Is515week7Uploaded byTâmThiệnNguyễn
- Maxsea ManualUploaded bynarara
- tcrp_rpt_23Uploaded byAnibal Almeida
- Indian Loco Shed Training Report At charoda (Bhilai)Uploaded byMohit Sandiman
- ADT Metric TutorialUploaded byItinkndu Iben
- Bgp Basic LabUploaded bymohitgupta
- Computer ScienceUploaded byapi-26413035
- 9 Civil Engineer Resume Samples.docxUploaded byAparnesh Yadav
- MiLB HomeBase Manual 2015Uploaded byDan_Marinis
- AEAEAUploaded byOMAR_14
- Teclados YamahaUploaded byluca1114
- Using Sim KitUploaded byradian_anmb
- Workshop1 IaUploaded byDanar Tri Yurindatama
- C Programming NotesUploaded byAshis Kumar Mohapatra
- Cracker of AB PLCUploaded byYonantha Loekito
- CS_pamphlet_en.pdfUploaded byninja
- CS SYlabusUploaded bymon1984
- NetApp OnCommand Unified Manager Installation AndUploaded byAnonymous kWKewA6xa
- Experion HS Software Installation Users GuideUploaded byinnoc3ntd3vil
- Layout Syllabus 10Uploaded byMandy Braatz
- OOMDUploaded bySUJITHMV
- OS X: Keyboard Shortcuts - Apple SupportUploaded byGagan Mahawar
- Benefits of ISO 9001 ComplianceUploaded byLauren Ford
- vBuilder-Manual.pdfUploaded byJoshua Riesenweber
- Fundamentals PythonUploaded byJustin Livingston
- OmniSX MX2 Training 5A Weld and Part Wizard UseUploaded bycarlos
- cs2Uploaded bySaurav Somesh