Suppose that a scheduler has five jobs that can be performed on any of five machines (n = 5). The cost of completing each job-machine combination is shown in Exhibit 17.5. The scheduler would like to devise a minimum-cost assignment. (There are 5!, or 120, possible assignments.)