Multiple Choice
The following matrix shows relative costs for various job-machine combinations. Assume there must be one-to-one matching between jobs and machines. Which set of pairs constitutes the minimum-cost solution using the assignment method?
A) 1-B, 2-C, 3-A
B) 1-B, 2-A, 3-C
C) 1-A, 2-C, 3-B
D) 1-A, 2-B, 3-C
E) 1-C, 2-A, 3-B
Correct Answer:

Verified
Correct Answer:
Verified
Q75: The purpose of cyclical scheduling is to<br>A)eliminate
Q76: Job X, which has a duration of
Q77: In a task assignment situation, in how
Q78: A schedule chart depicts the loading and
Q79: _ charts are often the preferred charts
Q81: Flow-shop scheduling is used in high-volume systems.
Q82: The owner/operator of the local franchise of
Q83: Based on the cost information given in
Q84: One disadvantage of appointment systems is<br>A)Capacity can
Q85: The assignment model seeks an optimum matching