OPERATIONS RESEARCH >INTERNATIONAL EDITI
OPERATIONS RESEARCH >INTERNATIONAL EDITI
4th Edition
ISBN: 9780534423629
Author: WINSTON
Publisher: CENGAGE L
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 7.5, Problem 1P

Explanation of Solution

Given:

Five employees are available for performing four jobs. The time taken to perform each job by each of the person is given in the following table:

        Time      (hours) 
PersonJob 1Job 2Job 3Job 4
122183018
218M2722
326202828
41622M14
521M2528

To Determine:

Find an optimal assignment order of jobs to minimize the total time required for performing four jobs using Hungarian method.

Assignment of employees to jobs:

Step 1:

Add another column for Job 5 with zero costs, since the table is not balanced.

        Time      (hours)  
PersonJob 1Job 2Job 3Job 4Job 5
1221830180
218M27220
3262028280
41622M140
521M25280

Step 2:

Take minimum from each row and subtract from the corresponding row. The new resultant table will be as follows:

        Time      (hours)  
PersonJob 1Job 2Job 3Job 4Job 5
1221830180
218M27220
3262028280
41622M140
521M25280
Minimum161825140

Step 3:

Take minimum from each column and subtract from the corresponding column. The new resultant table will be as follows:

        Time      (hours)  
PersonJob 1Job 2Job 3Job 4Job 5
160540
22M280
31023140
404M00
55M0140

Step 4:

Draw minimum number of lines for covering all zeros in the resultant table...

Blurred answer
Students have asked these similar questions
We are considering the RSA encryption scheme. The involved numbers are small, so the communication is insecure.  Alice's public key (n,public_key) is (247,7). A code breaker manages to factories  247 = 13 x 19  Determine Alice's secret key. To solve the problem, you need not use the extended Euclid algorithm, but you may assume that her private key is one of the following numbers 31,35,55,59,77,89.
Consider the following Turing Machine (TM). Does the TM halt if it begins on the empty tape? If it halts, after how many steps? Does the TM halt if it begins on a tape that contains a single letter A followed by blanks? Justify your answer.
Pllleasassseee ssiiirrrr soolveee thissssss questionnnnnnn
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Text book image
A Guide to SQL
Computer Science
ISBN:9781111527273
Author:Philip J. Pratt
Publisher:Course Technology Ptr
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L