Please help me get the answer of this question. This topic is from operations management (scheduling).Please provide a solution/computation. The following table shows the cost associated in assigning the jobs in the different machines.Determine the optimal assignment of each job in the machine to minimize the cost.Job12345A94534B73259Machineс3516LO5D45348EEחות522|77st41

An assignment problem is a technique to find the combinations of the optimal solution to the…

Answered: The following table shows the cost…

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 73P

See similar textbooks

Similar questions

Solve Problem 1 with the extra assumption that the investments can be grouped naturally as follows: 14, 58, 912, 1316, and 1720. a. Find the optimal investments when at most one investment from each group can be selected. b. Find the optimal investments when at least one investment from each group must be selected. (If the budget isnt large enough to permit this, increase the budget to a larger value.)
In the game shown below, Player 1 can move Up or Down, and Player 2 can move Left or Right. The players must move at the same time without knowledge of the other player’s move. The first payoff is for the row player (Player 1) and the second payoff is for the column player (Player 2). Solve each game using game theoretic logic. Player 2 Player 1 Left Right Up 3, 2 2, 3 Down 0, 9 1, 1
The coach of a swim team must assign the catcher to the 200-meter medley relay that will go to the Junior Olympics. Since many of your best swimmers are fast in more than one stroke, it is not easy to decide which one to assign. to each of the four styles. The top five swimmers and their fastest times (in seconds) in each stroke are as follows: The coach wants to determine how to assign four swimmers to the four swimming styles for minimize the sum of the best corresponding times. 1. Formulate this problem as an assignment problem using the Excel Solver
The university is scheduling cleaning crews for its ten buildings. Each crew has a different cost and is qualified to clean only certain buildings. There are eight possible crews to choose from in this case. The goal is to minimize costs while making sure that each building is cleaned. The management science department formulated the following linear programming model to help with the selection process. Min 270x1 + 290x2 + 250x3+ 270x4 + 230x5 + 180x6 + 180x7 + 280x8s.t. x1 + x2 + x5 + x7 ≥ 1 {Building A constraint}x1 + x2 + x3 ≥ 1 {Building B constraint}x6 + x8 ≥ 1 {Building C constraint}x1 + x4 + x7 ≥ 1 {Building D constraint}x2 + x7 ≥ 1 {Building E constraint}x3 + x8 ≥ 1 {Building F constraint}x2 + x5 + x7 ≥ 1 {Building G constraint}x1 + x4 + x6 ≥ 1 {Building H constraint}x1 + x4 + x8 ≥ 1 {Building I constraint}x1 + x2 + x7 ≥ 1 {Building J constraint}xj = {1, if crew j is selected0, otherwisexj = 1, if crew j is selected0, otherwise Set up the problem in Excel and find…
The university is scheduling cleaning crews for its ten buildings. Each crew has a different cost and is qualified to clean only certain buildings. There are eight possible crews to choose from in this case. The goal is to minimize costs while making sure that each building is cleaned. The management science department formulated the following linear programming model to help with the selection process. Min 270 x1 + 230x2 + 240x3+ 220x4 + 190x5 + 270x6 + 230x7 + 220x8 st. x1 + x2 + x5 + x7 ≥ 1 (Building A constraint] x1 + x2 + x3 ≥ 1 (Building B constraint} x6 + x8 ≥ 1 (Building C constraint} x1 + x4 + x7 ≥ 1 (Building D constraint} x2 + x7 ≥ 1 (Building E constraint] x3 + x8 ≥ 1 (Building F constraint) x2 + x5 + x7 ≥ 1 (Building G constraint} X1 + x4 + x6 ≥ 1 (Building H constraint] x1 + x4 + x8 ≥ 1 (Building I constraint} x1 + x2 + x7 ≥ 1 (Building J constraint} xj= {1, if crew j is selected {0, otherwise Set up the problem in Excel and find the optimal solution. a. What…
Consider the following tasks that must be assigned to four workers on a conveyor-paced assembly line (i.e., a machine-paced line flow). Each worker must perform at least one task. There exists unlimited demand unless stated otherwise. Time to Complete Task (seconds): Task 1: 30 Task 2: 25 Task 3: 15 Task 4: 20 Task 5: 15 Task 6: 20 Task 7: 50 Task 8: 15 Task 9: 20 Task 10: 25 Task 11: 15 Task 12: 20 The current conveyor-paced assembly-line configuration assigns the workers in the following way: • Worker 1: Tasks 1, 2, 3 • Worker 2: Tasks 4, 5, 6 • Worker 3: Tasks 7, 8, 9 • Worker 4: Tasks 10, 11, 12 What is the direct labor content (in seconds per unit)?
Consider the following puzzle. You are to pick out 4three-letter “words” from the following list:DBA DEG ADI FFD GHI BCD FDF BAIFor each word, you earn a score equal to the position thatthe word’s third letter appears in the alphabet. For example,DBA earns a score of 1, DEG earns a score of 7, and so on.Your goal is to choose the four words that maximize yourtotal score, subject to the following constraint: The sum ofthe positions in the alphabet for the first letter of each wordchosen must be at least as large as the sum of the positionsin the alphabet for the second letter of each word chosen.Formulate an IP to solve this problem.
In the optimal solution to the machine-to-job assignment problem, jobs 3 and 4 are assigned to differentmachines. Suppose there is an extra restriction thatthese jobs must be assigned to the same machine.Change the model to accommodate this restrictionand find the new optimal solution
What is true about the assignment problem if the solution has reached the table below? Project A Project B Project C Project D Expert W 0 100 200 0 Expert X 0 0 200 300 Expert Y 0 100 300 0 Expert Z 200 100 0 0 a. The minimum number of vertical and horizontal lines needed to cross out 0s is three. b. Optimal assignment of projects cannot be determined yet. c. Optimal assignment of projects can now be determined.
A Company has two support departments (Administration and Janitorial) and three producing departments (Fabricating, Assembly, and Finishing). Costs and activities are as follows: Administration Janitorial Fabricating Assembly Finishing Direct costs........................ $50,000 $30,000 $40,000 $50,000 $25,000 Number of employees....... 10 30 40 20 Square feet........................ 2,000 10,000 28,000 15,000 Direct labor hours.............. 5,000 6,000 2,000 Administrative services are allocated based on the number of employees; janitorial services are allocated based on square footage. Overhead rates for the three producing departments are based on direct labor hours. Required: Determine the overhead application rates for the producing departments using each of the three allocation methods: 1. Direct allocation method for the support departments 2. Step allocation method for the support departments 3. Reciprocal allocation method for the support departments

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS

The following table shows the cost associated in assigning the jobs in the different machines Determine the optimal assignment of each job in the machine to minimize the cost. Job 1 2 3 45 A 9 4 5 3 st B 7 32 3 2 5 59 9 Machine с 3 5 1 6 5 D 4 5 3 4 8 E 5 2 7 4