One possible solution method for the machine-tojob 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.

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter12: Queueing Models
Section: Chapter Questions
Problem 59P
icon
Related questions
Question

One possible solution method for the machine-tojob 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.

Expert Solution
steps

Step by step

Solved in 2 steps

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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,