Integrating facility location and production planning decisions

Networks

Volumn 55, Issue 2, 2010, Pages 78-89

  Romeijn, H Edwin ^a   Sharkey, Thomas C ^b   Shen, Zuo Jun Max ^c   Zhang, Jiawei ^d  

^a UNIVERSITY OF MICHIGAN   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^c DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Computational complexity; Facility location; Production planning

Indexed keywords

DEMAND PATTERN; FACILITY LOCATION PROBLEM; FACILITY LOCATIONS; GREEDY ALGORITHMS; PRODUCTION AND INVENTORY; PRODUCTION PLANNING; SET COVER PROBLEM; TIME PERIODS;

COMPUTATIONAL COMPLEXITY; CUSTOMER SATISFACTION; FACILITIES; PLANNING; PRODUCTION CONTROL; PRODUCTION ENGINEERING; PROJECT MANAGEMENT; SALES; SITE SELECTION;

APPROXIMATION ALGORITHMS;

EID: 77049124817     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20315     Document Type: Article

References (28)

1. A. Aggarwal and J. Park, Improved algorithms for economic lot size problems, Oper Res 41 (1993), 549-571.
2. E. Arkin, D. Joneja, and R. Roundy, Computational complexity of uncapacitated multi-echelon production planning problems, Oper Res Lett 8 (1989), 61-66.
3. J. Byrka, An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem, Proceedings of the 10th Int Workshop Approximation Algorithms Combinatorial Optim Prob (APPROX), Princeton, NJ, 2007, pp. 29-43.
4. M. Charikar and S. Guha, Improved combinatorial algorithms for facility location problems, SIAM J Comput 34 (2005), 803-824.
5. F. Chudak and D. Shmoys, Improved approximation algorithms for the uncapacitated facility location problem, SIAM J Comput 33 (2003), 1-25.
6. M. Daskin, C. Coullard, and Z.J. Shen, An inventory-location model: Formulation, solution algorithm, and computational results, Ann Oper Res 10 (2001), 83-106.
7. A. Federgruen and M. Tzur, A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time, Manage Sci 37 (1991), 909-925.
8. U. Feige, A threshold of ln n for approximating set cover, J ACM 45 (1998), 634-652.
9. A. Gabor and J. van Ommeren, An approximation algorithm for a facility location problem with stochastic demands and inventories, Oper Res Lett 34 (2006), 257-263.
10. A. Gabor and J. van Ommeren, Approximation algorithms for facility location problems with a special class of subadditive cost functions, Theoret Comput Sci 363 (2006), 289-300.
11. S. Guha and S. Khuller, Greedy strikes back: Improved facility location algorithms, J Algorithms 31 (1999), 228-248.
12. M. Hajiaghayi, M. Mahdian, and V. Mirrokni, The facility location problem with general cost functions, Networks 42 (2003), 42-47.
13. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. Vazi-rani, Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP, J ACM 50 (2003), 795-824.
14. J. Krarup and O. Bilde, "Plant location, set covering, and economic lot size: An O(mn)-algorithm for structured problems," Numerische methoden bei optimierungsauf-gaben, band 3: Optimierung bei graph-theoretischen und ganzahligen problemen, L. Collatz, W. Wetterling (Editors), Int Ser Numer Math vol. 36, Birkhäuser, 1977, pp. 155-180.
15. R. Levi, R. Roundy, and D. Shmoys, Primal-dual algorithms for deterministic inventory problems, Math Oper Res 31 (2006), 267-284.
16. T. Magnanti and D. Stratila, Strongly polynomial primal- dual algorithms for concave cost combinatorial optimization problems, Technical report, Massachusetts Institute of Technology, Cambridge, MA, 2007.
17. M. Mahdian, Y. Ye, and J. Zhang, Approximation algorithms for metric facility location problems, SIAM J Comput 36 (2006), 411-432.
18. G. Rodolakis, S. Siachalou, and L. Georgiadis, Qual Service in Multiservice IP Networks: Third Int Workshop, QoS-IP 2005, LNCS 3375 (2005), pp. 207-220.
19. R. Roundy, Efficient, effective lot-sizing for multi-product, multi-stage production systems, Oper Res 41 (1993), 371-386.
20. Z. Shen, C. Coullard, and M. Daskin, A joint location- inventory model, Transportation Sci 37 (2003), 40-55.
21. D. Shmoys, C. Swamy, and R. Levi, Facility location with service installation costs, Proc 15th ACM-SIAM Symp Discr Algorithms (SODA), New Orleans, LA, 2004, pp. 1088-1097.
22. D. Shmoys, E. Tardos, and K. Aardal, Approximation algorithms for facility location problems, Proc 29th Ann ACM Symp Theory Comput (STOC), El Paso, TX, 1997, pp. 265-274.
23. M. Sviridenko, A1.582-approximationalgorithmforthemet-ric uncapacitated facility location problem, Proceedings 9th Conference Integer Program Combinatorial Optim (IPCO), Cambridge, MA, 2002, pp. 240-257.
24. A. Veinott, Minimum concave cost solutions of Leontief substitution models of multi-facility inventory systems, Oper Res 17 (1969), 262-291.
25. A. Wagelmans, S. van Hoesel, and A. Kolen, Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case, Oper Res 40-S1 (1992), S145-S156.
26. H. Wagner, A postscript to dynamic problems of the theory of the firm, Naval Res Logist Q 7 (1960), 7-12.
27. H. Wagner and T. Whitin, Dynamic version of the economic lot size model, Manage Sci 5 (1958), 89-96.
28. W. Zangwill, A deterministic multi-product, multi-facility production and inventory model, Oper Res 17 (1966), 486-507.