Production and Operations Analysis, Seventh Edition
7th Edition
ISBN: 9781478623069
Author: Steven Nahmias, Tava Lennon Olsen
Publisher: Waveland Press, Inc.
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6.6, Problem 21P
Summary Introduction
Interpretation: find the route schedule obtained from the savings method to the given problem.
Concept Introduction: Route
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
All-Weather Oil and Gas Company is planning delivery routes to six natural gas customers. The customer locations and gas requirements (in gallons) are given in the following table. (given)
Assume that the depot is located at the origin of the grid and that the delivery trucks have a capacity of 1,200 gallons. Also assume that the cost of travel between any two locations is the straight-line (Euclidean) distance between them. Find the route schedule obtained from the savings method.
PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows):
Potential Rep Home
City Served?
Albuquerque
El Paso
Denver
Phoenix
San Diego
Los Angeles
San Francisco
Portland
Seattle
Las Vegas
Salt Lake City
Albuquerque
1
1
1
1
0
0
0
0
0
0
0
El Paso
1
1
0
1
0
0
0
0
0
0
0
Denver
1
0
1
1
0
0
0
0
0
0
1
Phoenix
1
1
1
1
1
1
0
0
0
1
1
San Diego
0
0
0
1
1
1
1
0
0
1
0…
PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows):
Potential Rep Home
City Served?
Albuquerque
El Paso
Denver
Phoenix
San Diego
Los Angeles
San Francisco
Portland
Seattle
Las Vegas
Salt Lake City
Albuquerque
1
1
1
1
0
0
0
0
0
0
0
El Paso
1
1
0
1
0
0
0
0
0
0
0
Denver
1
0
1
1
0
0
0
0
0
0
1
Phoenix
1
1
1
1
1
1
0
0
0
1
1
San Diego
0
0
0
1
1
1
1
0
0
1
0…
Chapter 6 Solutions
Production and Operations Analysis, Seventh Edition
Ch. 6.2 - Prob. 1PCh. 6.2 - Prob. 2PCh. 6.2 - Prob. 3PCh. 6.2 - Prob. 4PCh. 6.2 - Prob. 5PCh. 6.2 - Prob. 6PCh. 6.2 - Prob. 7PCh. 6.2 - Prob. 8PCh. 6.5 - Prob. 10PCh. 6.5 - Prob. 11P
Ch. 6.5 - Prob. 12PCh. 6.5 - Prob. 13PCh. 6.5 - Prob. 14PCh. 6.5 - Prob. 15PCh. 6.5 - Prob. 16PCh. 6.6 - Prob. 17PCh. 6.6 - Prob. 18PCh. 6.6 - Prob. 19PCh. 6.6 - Prob. 20PCh. 6.6 - Prob. 21PCh. 6.9 - Prob. 22PCh. 6.9 - Prob. 24PCh. 6.9 - Prob. 25PCh. 6.9 - Prob. 26PCh. 6.9 - Prob. 27PCh. 6.9 - Prob. 28PCh. 6.9 - Prob. 29PCh. 6.9 - Prob. 30PCh. 6.9 - Prob. 31PCh. 6.10 - Prob. 34PCh. 6.11 - Prob. 37PCh. 6.11 - Prob. 38PCh. 6.11 - Prob. 39PCh. 6.11 - Prob. 41P
Knowledge Booster
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
- The MidLands Trucking Company based in Louisvillehas eight trucks located throughout the Mideast that havedelivered their loads and are available for shipments. Through their Internet logistics site MidLands has re-ceived shipping requests from 12 customers. The follow-ing table shows the mileage for a truck to travel to a customer location, pick up the load, and deliver it. Determine the optimal assignment of trucks to customersthat will minimize the total mileage. Customers Truck A B C D E F G H I J K L1 500 730 620 410 550 600 390 480 670 710 440 5902 900 570 820 770 910 660 650 780 840 950 590 6703 630 660 750 540 680 750 810 560 710 1200 490 6504 870 1200 810 670 710 820 1200 630 700 900 540 6205 950 910 740 810 630 590 930 650 840 930 460 5606 1100 860 800 590 570 550 780 610 1300 840 550 7907 610 710 910 550 810 730 910 720 850 760 580 6308 560 690 660 640 720 670 830 690 880 1000 710 680arrow_forwardA dispatcher for Citywide Taxi Company has six taxicabs at different locations and five customers who have called for service. The mileage from each taxi’s present location to each customer is shown in the following table: Determine the optimal assignment(s) that will minimize the total mileage traveled.arrow_forwardThe Thor International Company operates four factories that ship products to five warehouses. The shipping costs, requirements, and capacities are shown in the tableau below. Use the transportation method to find the shipping schedule that minimizes shipping cost. Factory Shipping Cost per Case to each Warehouse Capacity W1 W2 W3 W4 W5 Dummy F1 $4 $5 $4 $3 $6 $0 50,000 F2 $3 $4 $4 $5 $7 $0 80,000 F3 $3 $4 $5 $3 $5 $0 90,000 F4 $4 $6 $5 $6 $3 $0 40,000…arrow_forward
- ASAP PLEASE.. The distribution of goods from the source (factory) to the target (warehouse) will cause problems regarding TRANSPORT, namely how the goods are sent from the factory to the warehouse which produces minimum costs. If it is known that - the capacity of 3 factories is 40000, 30000 and 20000, - the need for 3 warehouses is 20000, 50000 and 30000 respectively. The cost of shipping goods from the factory to the warehouse is shown in the following table Solve the above TRANSPORTATION problems with VAM and MODIarrow_forwardIn the original Gorman Construction Company problem, we found the shortest distance from the office (node 1) to the construction site located at node 6. Because some of the roads are highways and others are city streets, the shortest-distance routes between the office and the construction site may not necessarily provide the quickest or shortest-time route. Shown here is the Gorman road network with travel time rather than distance. Find the shortest route from Gorman’s office to the construction site at node 6 if the objective is to minimize travel time rather than distance.arrow_forwardAbu Dhabi municipality is given an assignment to ensure provision of enough water for residents of the Abu Dhabi city. The water is purified in a large water treatment plant (node 1) and then is sent via a water supply network to the Abu Dhabi city (node 14). As shown in the below water supply network, the capacity of each water pipeline (arc) is shown in million liters per hour. For example, the hourly water flow from node 1 to node 2 is four million liters, and from node 2 to node 1 is zero million liters. a) The municipality is interested to find out how much water (in million liters per hour) can be sent from the water treatment plant to the Abu Dhabi city via this water supply network. Determine it. b) Due to a maintenance problem both nodes 10 and 11 need to be taken offline. Therefore, these nodes cannot flow any water in and out. How this problem impacts the network maximum flow capacity? Please include algebraic method and excel solver.arrow_forward
- Consider the transportation problem having the cost and requirement table below. a. Obtain the initial basic feasible solution using all the three methods (i. Northwest-Corner, ii. Least-Cost and iii. VAM) and determine the value of z. b. Use the most optimal initial basic feasible solution from (a) as your starting point to find the optimal solution. c. Draw a network showing the quantities obtained in the final iteration and the optimal value of z.arrow_forwardA logistics company plans to provide coal logistics transportation services to HY coal sales enterprise. HY coal sales enterprise has coal storage and sales points in B and D, with available coal quantities of 1600t and 8000t, respectively; A and C represents the locations of two coal users, with a demand of 8000t and 1600t respectively. The distribution of relevant locations and travel distances are shown in Figure 1. Based on the above conditions, try to calculate and explain from the perspective of transportation capacity consumption: How should logistics company HY plan transportation routes in order to make them more reasonable? (a transportation route planning scheme needs to be illustrated) . Note:The solution should not be hand written.arrow_forwardUsing NETWORK and ASSIGNMENT MODEL (Shortest Route Problem) for Operation Management/Research please solve the attached problem. Show Solution.arrow_forward
- DO IT MANUALLY, NO EXCEL (TRANSPORTATION METHOD) Solve for the optimal Transportation schedule. Find an initial feasible solution using the Intuitive Approach/Least-Cost Method and use Stepping-Stone Method to test for optimality.arrow_forwardPLEASE SHOW ALL FORMULA PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible connections between each city in the region are listed below (1 indicates a feasible connection, potential home cities are shown in columns, and cities served in rows): Potential Rep Home City Served? Albuquerque El Paso Denver Phoenix San Diego Los Angeles San Francisco Portland Seattle Las Vegas Salt Lake City Albuquerque 1 1 1 1 0 0 0 0 0 0 0 El Paso 1 1 0 1 0 0 0 0 0 0 0 Denver 1 0 1 1 0 0 0 0 0 0 1 Phoenix 1 1 1 1 1 1 0 0 0 1 1 San Diego 0 0 0 1 1 1…arrow_forward. A company is producing a single product and is selling it through five agencies situated in different cities. All of a sudden, there is a demand for the product in another five cities not having any agency of the company. The company is faced with the problem of deciding on how to assign the existing agencies to despatch the products to needy cities in such a way that the total travelling distance is minimized. Determine the optimum assignment schedule. The distance between the surplus and deficit cities (in K.M.) is given below. Surplus Cities Deficit Cities A1 B1 C1 D1 E1 A 7 5 9 8 11 B 9 12 7 11 10 C 8 5 4 6 9 D 7 3 6 9 5 E 4 6 7 5 11arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,