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 11.9, Problem 28P
Summary Introduction
Interpretation: Coordinates of the optimal location for the new machines are to be determined in order to minimize the weighted sum of the rectilinear distances from the new machine to the existing machines.
Concept Introduction:
Rectilinear distance refers to the addition of distance between two facilities. It is generally used to determine the total distance between two points with the help of the rectilinear array or the street network.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
A company needs to locate three departments (I, II, and III) in the three areas (A, B, and C) of a new facility. They want to minimize interdepartmental transportation costs, which are expected to be $.40 per load per meter moved. An analyst has prepared the following distances and flow matrices:
Distance (meters) Flows (loads per week)
From/To A B C From/To I II III
A - 30 40 I - 30 110
B - 60 II 90 - 70
C - III 70 60 -
In what areas, A, B, and C, should departments I, II, and III be located that minimize the total cost of moving loads over…
The director of Burtonsville Civil Defense Agency has been ordered to draw up a disaster plan for assigning casualties to hospitals in the event of a serious earthquake. For simplicity, we will assume that causalities will occur at two points in the city and will be transported to three hospitals. It is estimated that there will be 300 casualties at point A and 200 at point B. Travel times to hospitals 1, 2, and 3 are 25, 15, and 10 minutes, respectively; from point B they are 20, 5, and 15 minutes. Hospital capacities for emergency cases are 250, 150, and 150 patients. How should the victims be assigned to hospitals to minimize the total time lost in transporting them?
Disaster Point
Hospital
Total
Casualties
1
2
3
A
25
15
10
300
B
20
5
15
200
Maximum Capacity
250
150
150
Note:-
Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism.
Answer completely.
You…
The Hamilton County Local Government has eight sectors which need fire protection. Adequate
Fire protection can be provided in each sector either by building a fire station in that sector, or by
building a fire station in another sector which is no more than a 12-minute drive away. The time
to drive between the centers of each pair of sectors is given in the following table. (Because of
one-way streets and left turns the times are not symmetric.) The cost to build a fire station is the
same in each sector.
Formulate an integer programming model to choose which sectors should have their own fire station.
Solve the model by using Excel Solver.
Chapter 11 Solutions
Production and Operations Analysis, Seventh Edition
Ch. 11.3 - Prob. 1PCh. 11.3 - Prob. 2PCh. 11.3 - Prob. 3PCh. 11.3 - Prob. 4PCh. 11.3 - Prob. 5PCh. 11.3 - Prob. 6PCh. 11.4 - Prob. 7PCh. 11.4 - Prob. 8PCh. 11.5 - Prob. 10PCh. 11.6 - Prob. 11P
Ch. 11.6 - Prob. 12PCh. 11.6 - Prob. 13PCh. 11.6 - Prob. 14PCh. 11.6 - Prob. 15PCh. 11.6 - Prob. 16PCh. 11.6 - Prob. 17PCh. 11.6 - Prob. 18PCh. 11.6 - Prob. 19PCh. 11.7 - Prob. 20PCh. 11.7 - Prob. 21PCh. 11.7 - Prob. 22PCh. 11.7 - Prob. 23PCh. 11.8 - Prob. 24PCh. 11.8 - Prob. 25PCh. 11.8 - Prob. 26PCh. 11.8 - Prob. 27PCh. 11.9 - Prob. 28PCh. 11.9 - Prob. 29PCh. 11.9 - Prob. 30PCh. 11.9 - Prob. 31PCh. 11.9 - Prob. 32PCh. 11.9 - Prob. 33PCh. 11.9 - Prob. 34PCh. 11.9 - Prob. 35PCh. 11.9 - Prob. 36PCh. 11.9 - Prob. 37PCh. 11.9 - Prob. 38PCh. 11.10 - Prob. 39PCh. 11.10 - Prob. 40PCh. 11.10 - Prob. 41PCh. 11.11 - Prob. 42PCh. 11.11 - Prob. 43PCh. 11.11 - Prob. 45PCh. 11 - Prob. 46APCh. 11 - Prob. 47APCh. 11 - Prob. 48APCh. 11 - Prob. 49APCh. 11 - Prob. 50APCh. 11 - Prob. 51APCh. 11 - Prob. 52APCh. 11 - Prob. 53APCh. 11 - Prob. 54APCh. 11 - Prob. 55APCh. 11 - Prob. 56APCh. 11 - Prob. 58AP
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 distance between two cities in the United States can be approximated by the following formula, where lat1 and long1 are the latitude and longitude of city 1 and lat2 and long2 are the latitude and longitude of city 2. 69 (lat1 − lat2)2 + (long1 − long2)2 Ted's daughter is getting married, and he is inviting relatives from 15 different locations in the United States. The file Wedding gives the longitude, latitude, and number of relatives in each of the 15 locations. Ted would like to find a wedding location that minimizes the demand-weighted distance, where demand is the number of relatives at each location. Assuming that the wedding can occur anywhere, find the latitude and longitude of the optimal location. (Hint: Notice that all longitude values given for this problem are negative. Make sure that you do not check the option for Make Unconstrained Variables Non-Negative in Solver. Round your answers to three decimal places.) latitude of the optimal wedding location:…arrow_forwardThe Bayside Art Gallery is considering installing a video camera security system to reduce its insurance premiums. A diagram of the eight display rooms that Bayside uses for exhibitions is shown in the figure below; the openings between the rooms are numbered 1-13. A security firm proposed that two-way cameras be installed at some room openings. Each camera has the ability to monitor the two rooms between which the camera is located. For example, if a camera were located at opening number 4, rooms 1 and 4 would be covered; if a camera were located at opening 11, rooms 7 and 8 would be covered; and so on. Management decided not to locate a camera system at the entrance to the display rooms. The objective is to provide security coverage for all eight rooms using the minimum number of two-way cameras.arrow_forwardConsider the following tasks that must be assigned to four workers on a conveyor-paced assembly line (i.e., a machine-paced line flow). Each worker must perform at least one task. There exists unlimited demand unless stated otherwise. Time to Complete Task (seconds): Task 1: 30 Task 2: 25 Task 3: 15 Task 4: 20 Task 5: 15 Task 6: 20 Task 7: 50 Task 8: 15 Task 9: 20 Task 10: 25 Task 11: 15 Task 12: 20 The current conveyor-paced assembly-line configuration assigns the workers in the following way: • Worker 1: Tasks 1, 2, 3 • Worker 2: Tasks 4, 5, 6 • Worker 3: Tasks 7, 8, 9 • Worker 4: Tasks 10, 11, 12 What is the direct labor content (in seconds per unit)?arrow_forward
- General Ford has two plants, two warehouses, and threecustomers. The locations of these are as follows:Plants: Detroit and AtlantaWarehouses: Denver and New YorkCustomers: Los Angeles, Chicago, and PhiladelphiaCars are produced at plants, then shipped to warehouses,and finally shipped to customers. Detroit can produce 150cars per week, and Atlanta can produce 100 cars per week.Los Angeles requires 80 cars per week; Chicago, 70; andPhiladelphia, 60. It costs $10,000 to produce a car at eachplant, and the cost of shipping a car between two cities isgiven in Table 62. Determine how to meet General Ford’sweekly demands at minimum cost.arrow_forwardThe network below shows the flows possible between pairs of six locations. A graph with 6 nodes and 13 directed arcs is shown. Node 1 is connected to node 2 by arc of value 17, to node 3 by arc of value 19, and to node 5 by arc of value 9. Node 2 is connected to node 3 by arc of value 8 and to node 4 by arc of value 14. Node 3 is connected to node 2 by arc of value 5, to node 4 by arc of value 9, to node 5 by arc of value 7, and to node 6 by arc of value 24. Node 4 is connected to node 3 by arc of value 9 and to node 6 by arc of value 13. Node 5 is connected to node 3 by arc of value 7 and to node 6 by arc of value 11. Node 6 has no directed arcs directed to other nodes. Formulate an LP to find the maximal flow possible from node 1 to node 6. (Let xij represent the flow from node i to node j. Enter your maximum flows as a comma-separated list of inequalities.) Max s.t.Node 1 Flows Node 2 Flows Node 3 Flows Node 4 Flows Node 5 Flows Node 6 Flows…arrow_forwardA steel production plant manufactures bands and coils which sell at a profit of $25 and $30 per ton,respectively. The production rate of the plant for bands is 200 tons/hr, and that for coils is 140 tons/hr.Based on the market analysis, it has been identified that the weekly demand is at most 6000 tons and4000 tons for bands and coils, respectively . The plant operates for a maximum of 40 hours per week. 1. In Microsoft Excel, formulate a linear programming model instance for this problem, then solve. 2. Assume that the products need to be painted after manufacturing, and the painting departmentcan paint at a rate of 600 tons per hour for bands and 400 tons per hour for coils. The paintingdepartment works only for 20 hours. Update the linear programming model instance to accom-modate this requirement, and re-solve the problem. 3. The plant is planning to introduce another product “rods” to its production mix with the followingparameters:•Profit/ton = $40•Production volume = 150…arrow_forward
- Four automobiles have entered Ilham’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 Ilham 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. Shima can complete job 1 in 400 minutes, job 2 in 90 minutes, job 3 in 60 minutes, and job 4 in 120 minutes. Dekmal will finish job 1 in 650 minutes, job 2 in 120 minutes, job 3 in 90 minutes, and job 4 in 180 minutes. Tia will finish job 1 in 480 minutes, job 2 in 120 minutes, job 3 in 80 minutes, and job 4 in 180 minutes. Hazza 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. Draw the initial table for this assignment problem.arrow_forwardAt the end of a cycle of schedules, a trucking firm has a surplus of one vehicle each in cities A, B, C, D, E, and F and a deficit of one vehicle each in cities 1, 2, 3, 4, 5, and 6. The distances between cities with a surplus and the cities with a deficit are shown below. Find an assignment of surplus vehicles to deficit cities that will result in a minimum total distance. What is the total distance? -Solve the following transportation models using Excel Solver. -Find the optimal solution for the transportation problem having the cost and requirement tablebelow.arrow_forwardJim Jones manufactures inexpensive set-it-up-yourself furniture for students. He currently makes two products – bookcases and tables. Each bookcase contributes $24 to profit, and each table, $20. Each product passes through two manufacturing points, cutting and finishing. Bookcases take 4 hours a unit in cutting and 4 hours in finishing. Tables require 3 hours a unit in cutting and 5 in finishing. There are currently 40 hours available in cutting and 50 in finishing. Determine the optimum solution. Use graphic linear programming to find the product mix that produces the maximum profit for Jim.arrow_forward
- The figure below shows the nodes (A−I) and capacities (labelled on arcs in TB/s) of a computer network. The firm would like to know how much information can flow from node A to node I. Which nodes are the sink and source for this problem? Multiple Choice: Node A is the source, Node I is the sink. Node A is the sink, Node B is the source. Node A is the sink, Node I is the source. Node B is the sink, Node I is the source. Node B is the source, Node I is the sink.arrow_forwardShow your step-by-step process using THE SPECIAL PURPOSE LINEAR PROGRAMMING: MODI TRANSPORTATION METHOD to solve this problem. XYZ Incorporated has received a contract to supply gravel to three new road projects located at three different locations. Project A needs 174 truckloads, Project B needs 204 truckloads, and Project C needs 143 truckloads. The company has three gravel warehouses located in three different places. Warehouse 1 has 158 truckloads available, warehouse 2 has 184, and warehouse 3 has 179. The cost of transportation from the warehouse to the projects are: from warehouse 1 to Projects A, B, C = Php 4, Php 8, Php 8 per truckload respectively. From warehouse 2 to Projects A, B, C = Php 16, Php 24, Php 16 per truckload respectively. From warehouse 3 to Projects A, B, C = Php 8, Php 16, Php 24 per truckload respectively. The objective is to design a plan of distribution that will Minimize the cost of transportation.arrow_forwardA firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping Costs Customer per unit Plant 1 2 3 A $ 25 $ 35 $ 15 B $ 20 $ 30 $ 40 C $ 40 $ 35 $ 20 D $ 15 $ 20 $ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. The firm’s problem falls within which classification? Multiple Choice Cost-benefit-trade-off Assignment problems Transshipment problems Transportation problems Resource-allocationarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.