In this paper, a finite set in which an optimal solution for a general Euclidean problem of locating an undesirable facility in a polygonal region, is determined and can be found in polynomial time. The general problem we propose leads us, among others, to several well-known problems such as the max
A combined distribution and assignment model for continuous facility location problem
β Scribed by S. C. Wong; S. H. Sun
- Publisher
- Springer
- Year
- 2001
- Tongue
- English
- Weight
- 233 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0570-1864
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## a b s t r a c t We present an efficient iterative heuristic procedure for solving the integrated layout design and product flow assignment problem. The layout design decisions involve planar location of unequal-area machines with duplicates. The product flows are assigned to machines according t
We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating