Question: A foreman has five workers and five jobs to complete. The time in hours each worker needs to complete each job is shown in the

A foreman has five workers and five jobs to

A foreman has five workers and five jobs to complete. The time in hours each worker needs to complete each job is shown in the following table. Job 1 Job 2 Job 3 Job 4 Job 5 Worker 1 3 4 8 7 8 Worker 2 2 5 3 2 6 Worker 3 7 9 1 8 3 Worker 4 5 3 4 6 6 Worker 5 8 9 7 5 8 a) How should the foreman make an assignment of one worker to each job so that the total time is minimized? b) Formulate the problem as an integer programming. c) If you solve the integer programming in Part b) using EXCEL, you will find an optimal solution, which should be in your answer to Part a). What change should we make to the integer programming in Part b) to find out whether the original problem has multiple optimal solutions or not? (Note: No need to solve the integer programming in EXCEL) A foreman has five workers and five jobs to complete. The time in hours each worker needs to complete each job is shown in the following table. Job 1 Job 2 Job 3 Job 4 Job 5 Worker 1 3 4 8 7 8 Worker 2 2 5 3 2 6 Worker 3 7 9 1 8 3 Worker 4 5 3 4 6 6 Worker 5 8 9 7 5 8 a) How should the foreman make an assignment of one worker to each job so that the total time is minimized? b) Formulate the problem as an integer programming. c) If you solve the integer programming in Part b) using EXCEL, you will find an optimal solution, which should be in your answer to Part a). What change should we make to the integer programming in Part b) to find out whether the original problem has multiple optimal solutions or not? (Note: No need to solve the integer programming in EXCEL)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!