Name
Abstract | ||
|---|---|---|
In this paper we deal with a facility location problem where one desires to establish facilities at two different distribution levels by selecting the time periods. Our model intends to minimize the total cost for meeting demands for all the products specified over the planning horizon at various customer locations while satisfying the capacity requirements of the production plants and intermediate warehouses. We address this problem by means of a formulation as a mixed integer programming problem. A Lagrangean relaxation is proposed to solve the problem, together with a heuristic procedure that constructs feasible solutions of the original problem from the solutions at the lower bounds obtained by the relaxed problems. Computational tests are provided showing the good performance of this approach for a wide range of problems. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0377-2217(99)00256-8 | European Journal of Operational Research |
Keywords | Field | DocType |
Multiperiod multi-echelon facility-location,Integer programming,Lagrangean dual,Heuristic | Heuristic,Mathematical optimization,Time horizon,Facility location problem,Integer programming,Cutting stock problem,1-center problem,Total cost,Operations management,Mathematics,Heuristic procedure | Journal |
Volume | Issue | ISSN |
123 | 2 | 0377-2217 |
Citations | PageRank | References |
43 | 3.33 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yolanda Hinojosa | 1 | 98 | 8.14 |
| Justo Puerto | 2 | 717 | 73.21 |
| Francisco R. Fernández | 3 | 176 | 18.42 |