Chapter 9 Problems

Chapter 9 Problems

9-11 The Krampf Lines Railway Company specializes in coal handling. On Friday, April 13, Krampf had empty cars at the following towns in the quantities indicated:

TOWN SUPPLY OF CARS
Morgantown 35
Youngstown 60
Pittsburgh 25

By Monday, April 16, the following towns will need the numbers of coal cars listed:

TOWN DEMAND FOR CARS
Coal Valley 30
Coaltown 45
Coal Junction 25
Coalsburg 20

Using a railway city-to-city distance chart, the dispatcher constructs a mileage table for the preceding towns. The result is shown in the table on this page. Minimizing total miles over which cars are moved to new locations, compute the best shipment of coal cars.

Table for Problem 9-11

TO FROM COAL VALLEY COALTOWN COAL JUNCTION COALSBURG
MORGANTOWN 50 30 60 70
YOUNGSTOWN 20 80 10 90
PITTSBURGH 100 40 80 30

9-13 Finnish Furniture manufactures tables in facilities located in three cities—Reno, Denver, and Pittsburgh. The tables are then shipped to three retail stores located in Phoenix, Cleveland, and Chicago. Management wishes to develop a distribution schedule that will meet the stores’ demands at the lowest possible cost. The shipping cost per unit from each of the sources to each of the destinations is shown in the following table:

TO FROM PHOENIX CLEVELAND CHICAGO
RENO 10 16 19
DENVER 12 14 13
PITTSBURGH 18 12 12

The available supplies are 120 units from Reno, 200 from Denver, and 160 from Pittsburgh. Phoenix has a demand of 140 units, Cleveland has a demand of 160 units, and Chicago has a demand of 180 units. How many units should be shipped from each manufacturing facility to each of the retail stores if cost is to be minimized? What is the total cost?

9-23 Four automobiles have entered Bubba’s Repair Shop for various types of work, ranging from a transmission overhaul to a brake job. The experience level of the mechanics is quite varied, and Bubba would like to minimize the time required to complete all of the jobs. He has estimated the time in minutes for each mechanic to complete each job. Billy can complete job 1 in 400 minutes, job 2 in 90 minutes, job 3 in 60 minutes, and job 4 in 120 minutes. Taylor will finish job 1 in 650 minutes, job 2 in 120 minutes, job 3 in 90 minutes, and job 4 in 180 minutes. Mark will finish job 1 in 480 minutes, job 2 in 120 minutes, job 3 in 80 minutes, and job 4 in 180 minutes. John will complete job 1 in 500 minutes, job 2 in 110 minutes, job 3 in 90 minutes, and job 4 in 150 minutes. Each mechanic should be assigned to just one of these jobs. What is the minimum total time required to finish the four jobs? Who should be assigned to each job?

9-33 Bechtold Construction is in the process of installing power lines to a large housing development. Steve Bechtold wants to minimize the total length of wire used, which will minimize his costs. The housing development is shown as a network on this page. Each house has been numbered, and the distances between houses are given in hundreds of feet. What do you recommend?

0 replies

Leave a Reply

Want to join the discussion?
Feel free to contribute!

Leave a Reply

Your email address will not be published. Required fields are marked *