Production and Operations Analysis, Seventh Edition
7th Edition
ISBN: 9781478623069
Author: Steven Nahmias, Tava Lennon Olsen
Publisher: Waveland Press, Inc.
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 11.4, Problem 7P
Summary Introduction
Interpretation: The given problem needs to be solved based on a suitable assignment method.
Concept Introduction: The Hungarian Algorithm is primarily used to determine the minimum cost of assigning the work to the employees.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A plant has four operators to be assigned to four machines. The time (minutes) required by each worker to produce a product on each machine is shown in the following table: Determine the optimal assignment and compute total minimum time.
Ravi Behara, the managing partner at a large law firm in Virginia, must assign three clients to three attorneys. Cost data are presented in the following table:Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Use the assignment algorithm to solve this problem.
A plant has four operators to be assigned to four machines. The time (minutes) required by each worker to produce a product on each machine is shown in the following table:
Â
Â
Machine (min.)
Operator
A
B
C
D
1
10
12
9
11
2
5
10
7
8
3
12
14
13
11
4
8
15
11
9
Â
Determine the optimal assignment and compute total minimum time using the Hungarian’s Method.
Chapter 11 Solutions
Production and Operations Analysis, Seventh Edition
Ch. 11.3 - Prob. 1PCh. 11.3 - Prob. 2PCh. 11.3 - Prob. 3PCh. 11.3 - Prob. 4PCh. 11.3 - Prob. 5PCh. 11.3 - Prob. 6PCh. 11.4 - Prob. 7PCh. 11.4 - Prob. 8PCh. 11.5 - Prob. 10PCh. 11.6 - Prob. 11P
Ch. 11.6 - Prob. 12PCh. 11.6 - Prob. 13PCh. 11.6 - Prob. 14PCh. 11.6 - Prob. 15PCh. 11.6 - Prob. 16PCh. 11.6 - Prob. 17PCh. 11.6 - Prob. 18PCh. 11.6 - Prob. 19PCh. 11.7 - Prob. 20PCh. 11.7 - Prob. 21PCh. 11.7 - Prob. 22PCh. 11.7 - Prob. 23PCh. 11.8 - Prob. 24PCh. 11.8 - Prob. 25PCh. 11.8 - Prob. 26PCh. 11.8 - Prob. 27PCh. 11.9 - Prob. 28PCh. 11.9 - Prob. 29PCh. 11.9 - Prob. 30PCh. 11.9 - Prob. 31PCh. 11.9 - Prob. 32PCh. 11.9 - Prob. 33PCh. 11.9 - Prob. 34PCh. 11.9 - Prob. 35PCh. 11.9 - Prob. 36PCh. 11.9 - Prob. 37PCh. 11.9 - Prob. 38PCh. 11.10 - Prob. 39PCh. 11.10 - Prob. 40PCh. 11.10 - Prob. 41PCh. 11.11 - Prob. 42PCh. 11.11 - Prob. 43PCh. 11.11 - Prob. 45PCh. 11 - Prob. 46APCh. 11 - Prob. 47APCh. 11 - Prob. 48APCh. 11 - Prob. 49APCh. 11 - Prob. 50APCh. 11 - Prob. 51APCh. 11 - Prob. 52APCh. 11 - Prob. 53APCh. 11 - Prob. 54APCh. 11 - Prob. 55APCh. 11 - Prob. 56APCh. 11 - Prob. 58AP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- SOLVE THE FOLLOWING ASSIGNMENT PROBLEM:There are 7 work teams, the same ones that must carry out 6 jobs. The time in days that each piece of equipment takes on each job is shown in the following table:Table!!! Assign jobs to teams so that the total sum of days is minimal. Indicate what this minimum amount is.arrow_forwardThe coach wishes to determine how to assign four swimmers to the four different strokes to minimize the sum of the corresponding “best times”. Formulate this problem as an assignment problem and solve for the optimal solution. (Hungerian Method)arrow_forwardExplain the basic assumptions of the assignment method of linear programming in operations ?arrow_forward
- Two law students, John and Marsha, are planning an all-nighter to prepare for their law boards the following day. Between them they have one set of materials in the following five subjects: contracts, torts, civil law, corporate law, and patents. Based on their previous experience, they estimate that they will need the following amount of time (in hours) with each set of materials: (given) They agree that Marsha will get the opportunity to see each set of notes before John. Assume that they start their studying at 8:00 P.M. Determine the exact times that each will begin and end studying each subject in order to minimize the total time required for both to complete studying all five subjects.arrow_forwardFour jobs are to be assigned to employees. There are 5 available employees. Durations for each job/employee combination are given in the following table. Build an assignment model to minimize the total time. What is the minimum optimal time?  Employees     Jobs 1 2 3 4 5 A 15 20 18 28 16 B 16 25 14 18 20 C 25 30 27 32 17 D 32 25 20 26 20arrow_forwardJackson has four employees that he wants to assign to four different jobs. Time taken per job per employee in minutes are shown in the following table: Table 6: Time per job per employee [Jadual 6: Masa untuk setiap pekerja] Job [Kerja] Employee [Pekerja] Ali Bazli Charlene Diviyah A 8 10 17 9 B 3 8 5 6 C 10 12 11 9 D 6 13 9 7 Determine the optimal assignment of employees to jobs to minimize the total completion time.arrow_forward
- One possible solution method for the machine-tojob assignment problem is the following heuristic procedure. Assign the machine to job 1 that completes job 1 quickest. Then assign the machine to job 2 that, among all machines that still have some capacity, completes job 2 quickest. Keep going until a machine has been assigned to all jobs. Does this heuristic-procedure yield the optimal solution for this problem? If it does, see whether you can change the job times so that the heuristic does not yield the optimal-solution.arrow_forwardWhat is the shift scheduling in Integer linear optimization and pud examplearrow_forward3. George Heinrich Printing Company wants to schedule the following seven jobs where each job must be processed by two machines A and B, first on machine A and then machine B. The processing times at machine A and B are as follows:  Job i                       1 2 3 4 5 6 7Processing time on machine A (ai) 15 7 4 7 10 4 7Processing time on machine B (bi) 3 9 10 6 9 5 8 (a) Suppose the inter-arrival times between jobs can be treated as zero and Johnson’srule is used to sequence and process the jobs, what is the completion time of eachjob and what is the total throughput time (makespan) of all jobs? (b) Now suppose that FIFO system (i. e., schedule job l before job 2, etc.) of schedulingand processing the jobs is used. What is the completion time of each job and whatis the total throughput time (makespan) of all jobs? (c) What would be the difference in the average time a job spends in the shop in (a)and (b) above?arrow_forward
- The chief of police, Karen Stanley, of the Make-BelievePolice Department needs to assign five detective squadsto five pending criminal cases. Karen wants to comeup with an optimum assignment that will minimize thetotal time it takes to conclude the cases. Data on past performance of each detective squad to complete each case assigned in terms of average number of days ispresented in the following table.Average Completion Time (in Days)Detective Squad Case-1 Case-2 Case-3 Case-4 Case-5A 15 8 4 8 28B 21 8 13 7 32C 11 4 5 6 20D 9 12 8 13 20E 14 24 25 27 9Use the assignment method to solve the problemIf Squad D cannot be assigned to Case-5 as a result ofa conflict of interest, solve the problem given this new constraint.arrow_forwardMike Reynolds has four assignments due in class tomorrow, and his class times are as follows: Class Time Marketing 304 9 a.m. OM 385 12 p.m. Finance 216 2 p.m. Psychology 200 5:30 p.m.  Each class lasts one hour, and Mike has no other classes. It is now midnight, and Mike estimates that the finance, OM, marketing, and psychology assignments will take him two, three, five, and four hours, respectively. Assume that all time till the last class begins can be spent on completing assignments but each assignment should be done till the time of the class on the same subject. (Mike can prepare assignments for the next classes during previous classes.) Use the Excel  to determine how he should schedule the work. Use minus sign to enter negative lateness values, if any. Enter the half an hour value as 0.5, e.g., 3:30 p.m. should be entered as 15.5. If your answer is zero, enter "0". Round your answers for the due date, lateness, and tardiness to one decimal place. Round your…arrow_forwardExplain the basic assumptions of the assignment method of linear programming in operation?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.