This preview shows pages 1–2. Sign up to view the full content.
OEM DMOR Homework #5
Due:
Tuesday, November 27
th
by midnight
Question 1:
Consider the following assignment problem costs.
Assignment costs
Machine 1
Machine 2
Machine 3
Machine 4
Job 1
3
1
2
7
Job 2
7
12
13
9
Job 3
8
7
6
4
Job 4
1
5
8
5
Part a:
How many possible solutions exist to this assignment problem?
Part b:
Solve the problem above by the Hungarian Algorithm.
Part c:
Suppose you wished to
maximize
assignment costs.
How can you use the
Hungarian method to solve the problem?
Demonstrate on the above problem.
Question 2:
Model the following problem as an assignment problem (no need to solve
it).
We need to arrange five flights from Orlando to Los Angeles, connecting in Dallas.
Each flight consists of two connections.
Our goal is to pair flights between Orlando and
Dallas to flights between Dallas and Los Angeles.
An ideal connection time between
flights is 75 minutes.
Find a pairing of flights that minimizes the sum of deviations from
a 75minute layover (e.g., a 50minute layover results in a penalty of 25, and an 80
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 02/25/2010 for the course ESI 6314 taught by Professor Vladimirlboginski during the Fall '09 term at University of Florida.
 Fall '09
 VLADIMIRLBOGINSKI

Click to edit the document details