Question: One possible solution method for the machine-to-job assignment problem is the following heuristic procedure. Assign the machine to job 1 that completes job 1 quickest.
One possible solution method for the machine-to-job 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.
Step by Step Solution
3.16 Rating (160 Votes )
There are 3 Steps involved in it
Model Assignment of jobs to machines Times to perf... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
1497_6040c8df30446_696472.xlsx
300 KBs Excel File
