Showing 1 - 7 of 7
Rejoinder to the previous note (Erlenkotter, D. 1974. Note--Dynamic facility location and simple network models. Management Sci. 20 (9) 1311.).
Persistent link: https://www.econbiz.de/10009208980
A dynamic or multiperiod location-allocation formulation is developed from the static problem of locating G facilities among M possible sites to serve N demand points. This dynamic model provides a tool for analyzing tradeoffs among present values of static distribution costs in each period and...
Persistent link: https://www.econbiz.de/10009214902
This note deals with the one-dimensional facility location model in which the weights, which can represent either demand volumes or demands and costs combined, are known only probabilistically. The demand points themselves, or at least the "feeder" routes to the demand points, for the facility...
Persistent link: https://www.econbiz.de/10009208795
This paper extends the static single facility location problem to a model that permits location changes within a planning horizon of r periods. An algorithm is developed to optimize the sequence of locations in order to meet changes in costs, volumes and locations of destinations.
Persistent link: https://www.econbiz.de/10009191675
An important observation in supply chain management, known as the bullwhip effect, suggests that demand variability increases as one moves up a supply chain. In this paper we quantify this effect for simple, two-stage supply chains consisting of a single retailer and a single manufacturer. Our...
Persistent link: https://www.econbiz.de/10009214194
A new approach to the solution of the facilities layout problem on the plane is presented in this paper. A simple procedure that can replace the dispersion phase of DISCON is constructed. The result of the new method is a scatter diagram of the facilities on the plane that can be used by...
Persistent link: https://www.econbiz.de/10009198159
The objective of the one-center model (single facility minimax location in the plane) is changed to be the maximum weighted number of demand points within a given weighted distance from the facility. The paper presents an O(n<sup>2</sup> log n) algorithm for the model along with some computational experience.
Persistent link: https://www.econbiz.de/10009198272