Facility Location and the Theory of Production

Allocation of Storage Yards in Management Plans in the Amazon by Means of Mathematical Programming

“…The p-median problem is that of locating p facilities to minimize the distance between demand nodes and the facilities selected. The class of location-allocation problems is defined among p facilities (shops, warehouses, schools and police stations, for example) that aim to meet certain n demand points (residences, neighborhoods, customers, and regions) resulting in the p locations that will be opened to meet each demand point [53][54][55][56][57][58][59][60].…”

Optimizing the Location of a Production Firm

“…Moses (1958) introduced specific considerations related to the location of a production firm in his seminal paper about location and the theory of production. He claimed that "there is no need for much of the esoteric paraphernalia sometimes employed by location specialists", a statement that generated many follow-up papers generalizing his approach (Sakashita 1967;Bradfield 1971;Emerson 1973;Khalili et al 1974;Osleeb and Cromley 1977;Miller and Jensen 1978). More recent papers on various aspects of the topic are by Martinich and Hurter (1982) and Tobin and Friesz (1986).…”

A mathematical model, heuristic, and simulation study for a basic data staging problem in a heterogeneous networking environment

“…A problem that is, at a high level, remotely similar to data staging is the facility location problem [8] in management science and operations research. Under the context of the construction of several new production facilities, a manufacturing firm needs to arrange the locations of the facilities and plants effectively, such that the total cost of transporting individual components from the inventory facilities to the manufacturing plants for assembly is minimized.…”

“…For each requested data item [7], M [8], and M [9], respectively. For V [2] (corresponding to M [2]), Drq[0,2] = {3} corresponding to the request for δ[0] from M [6].…”

“…For V [2] (corresponding to M [2]), Drq[0,2] = {3} corresponding to the request for δ[0] from M [6]. Similarly, for the example shown in Figure 2(b), Drq [1,3] = {0} corresponding to the request of δ [1] from M [8], Drq [1,5] = {1} corresponding to the request of δ [1] from M [9], and Drq [1,4] = Drq [1,7] = ∅. [3] simultaneously due to network conflict for the example shown in Figure 2).…”