Machineco Example
Machineco has four machines and four jobs to be completed. Each
machine must be assigned to complete one job. The time required to
set up each machine for completing each job is shown below. Machinco
wants to minimze the total setup time needed to complete the four
jobs.
Use Linear Programming to solve this problems.
| Job 1 | Job 2 | Job 3 | Job 4 |
|
Machine 1 | 14 | 5 | 8 | 7
|
Machine 2 | 2 | 12 | 6 | 5
|
Machine 3 | 7 | 8 | 3 | 9
|
Machine 4 | 2 | 4 | 6 | 10
|