So1e Chap06
So1e Chap06
with Spreadsheets
Stevenson and Ozgur
First Edition
Chapter 6
Learning Objectives
After completing this chapter, you should be able to: 1. Describe the nature of transportation, transshipment, and assignment problems. 2. Formulate a transportation problem as a linear programming model. 3. Use the transportation method to solve problems with Excel. 4. Solve maximization transportation problems, unbalanced problems, and problems with prohibited routes. 5. Solve aggregate planning problems using the transportation model.
Copyright 2007 The McGraw-Hill Companies. All rights reserved. McGraw-Hill/Irwin 62
McGraw-Hill/Irwin 63
Transportation Problems
Transportation Problem
A distribution-type problem in which supplies of goods that are held at various locations are to be distributed to other receiving locations. The solution of a transportation problem will indicate to a manager the quantities and costs of various routes and the resulting minimum cost. Used to compare location alternatives in deciding where to locate factories and warehouses to achieve the minimum cost distribution configuration.
McGraw-Hill/Irwin 64
McGraw-Hill/Irwin 65
Transshipment Problems
Transshipment Problems
A transportation problem in which some locations are used as intermediate shipping points, thereby serving both as origins and as destinations. Involve the distribution of goods from intermediate nodes in addition to multiple sources and multiple destinations.
McGraw-Hill/Irwin 66
Assignment Problems
The Assignment-type Problems
Involve the matching or pairing of two sets of items such as jobs and machines, secretaries and reports, lawyers and cases, and so forth. Have different cost or time requirements for different pairings.
McGraw-Hill/Irwin 67
Figure 61 6
McGraw-Hill/Irwin 68
Table 61 6
McGraw-Hill/Irwin 69
Unacceptable Routes
Certain origin-destination combinations may be unacceptable due to weather factors, equipment breakdowns, labor problems, or skill requirements that either prohibit, or make undesirable, certain combinations (routes).
McGraw-Hill/Irwin 610
McGraw-Hill/Irwin 611
Exhibit 6-1 6-
McGraw-Hill/Irwin 612
Exhibit 6-2 6-
McGraw-Hill/Irwin 613
Exhibit 63 6
McGraw-Hill/Irwin 614
Exhibit 64 6
Solver Results
McGraw-Hill/Irwin 615
Exhibit 65 6
McGraw-Hill/Irwin 616
Exhibit 66 6
McGraw-Hill/Irwin 617
Exhibit 67 6
Input and Output Sheet for the Revised Transportation (topsoil) Problem When the Shipping Route between Farm B and Project 1 Is Prohibited
McGraw-Hill/Irwin 618
Figure 62 6
McGraw-Hill/Irwin 619
Example 6-2 6Transshipment Problem The manager of Harleys Sand and Gravel Pit has decided to utilize two intermediate nodes as transshipment points for temporary storage of topsoil. The revised diagram of the transshipment problem is given in Figure 6-3.
Table 62 6
Table 62 6
McGraw-Hill/Irwin 620
Figure 63 6
McGraw-Hill/Irwin 621
Exhibit 68 6
McGraw-Hill/Irwin 622
Exhibit 69 6
McGraw-Hill/Irwin 623
McGraw-Hill/Irwin 624
Table 64 6
McGraw-Hill/Irwin 625
Example 6-3 6-
McGraw-Hill/Irwin 626
Table 65 6
McGraw-Hill/Irwin 627
McGraw-Hill/Irwin 628
Table 66 6
Table 67 6
McGraw-Hill/Irwin 629
Example 6-4 6A manager has prepared a table that shows the cost of performing each of five jobs by each of five employees (see Table 6-8). According to this table, job I will cost $15 if done by Al. $20 if it is done by Bill, and so on. The manager has stated that his goal is to develop a set of job assignments that will minimize the total cost of getting all four jobs done. It is further required that the jobs be performed simultaneously, thus requiring one job being assigned to each employee. In the past, to find the minimum-cost set of assignments, the manager has resorted to listing all of the different possible assignments (i.e., complete enumeration) for small problems such as this one. But for larger problems, the manager simply guesses because there are too many possibilities to try to list them. For example, with a 5X5 table, there are 5! = 120 different possibilities; but with, say, a 7X7 table, there are 7! = 5,040 possibilities.
McGraw-Hill/Irwin 630
Table 68 6
McGraw-Hill/Irwin 631
Exhibit 610 6
McGraw-Hill/Irwin 632
Exhibit 611 6
McGraw-Hill/Irwin 633
Exhibit 612 6
McGraw-Hill/Irwin 634
Exhibit 613 6
McGraw-Hill/Irwin 635
Exhibit 614 6
McGraw-Hill/Irwin 636
Exhibit 615 6
McGraw-Hill/Irwin 637
Exhibit 616 6
McGraw-Hill/Irwin 638
Exhibit 617 6
McGraw-Hill/Irwin 639