Homework Help is Here – Start Your Trial Now!
Business
Operations Management
A project needs to assign 4 people to 4 jobs so that the total cost of the assignment is minimum. Each job is to assign to only one person, and each person is be assigned with only one job. The following table gives the cost of a person completing a particular job: Job 1 3 Person A 19 5 4 5 В 4 3 5 16 C 3 1 3 2 D 4 16 4)

A project needs to assign 4 people to 4 jobs so that the total cost of the assignment is minimum. Each job is to assign to only one person, and each person is be assigned with only one job. The following table gives the cost of a person completing a particular job: Job 1 3 Person A 19 5 4 5 В 4 3 5 16 C 3 1 3 2 D 4 16 4)

Practical Management Science
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter6: Optimization Models With Integer Variables
Section: Chapter Questions
Problem 62P
See similar textbooks
icon
Related questions
Question
A project needs to assign 4 people to 4 jobs so that the total cost of the assignment is minimum. Each job is to assign to only one person, and each person is be assigned with only one job. The following table gives the cost of a person completing a particular job: Job 1 2 3 4 Person A 19 5 4 4 3 16 C 3 3 2 D 2 4 16 Use branch-and-bound algorithm problem-solving strategy based on setting lower bounds by row, find an assignment (one only) of the four jobs to the 4 people such that the total cost of the assignment is optimal. Your state-space tree must have the minimum number of nodes. You must number the node according to the order that you draw the state-space tree.
Transcribed Image Text:A project needs to assign 4 people to 4 jobs so that the total cost of the assignment is minimum. Each job is to assign to only one person, and each person is be assigned with only one job. The following table gives the cost of a person completing a particular job: Job 1 2 3 4 Person A 19 5 4 4 3 16 C 3 3 2 D 2 4 16 Use branch-and-bound algorithm problem-solving strategy based on setting lower bounds by row, find an assignment (one only) of the four jobs to the 4 people such that the total cost of the assignment is optimal. Your state-space tree must have the minimum number of nodes. You must number the node according to the order that you draw the state-space tree.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Optimization models
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.
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
SEE MORE TEXTBOOKS