Exact algorithms for integrated facility location and production planning problems
dc.contributor.author | Sharkey, Thomas C. | en_US |
dc.contributor.author | Geunes, Joseph | en_US |
dc.contributor.author | Edwin Romeijn, H. | en_US |
dc.contributor.author | Shen, Zuo‐jun Max | en_US |
dc.date.accessioned | 2011-11-10T15:32:04Z | |
dc.date.available | 2012-10-01T18:34:20Z | en_US |
dc.date.issued | 2011-08 | en_US |
dc.identifier.citation | Sharkey, Thomas C.; Geunes, Joseph; Edwin Romeijn, H.; Shen, Zuo‐jun Max (2011). "Exact algorithms for integrated facility location and production planning problems." Naval Research Logistics (NRL) 58(5): 419-436. <http://hdl.handle.net/2027.42/86850> | en_US |
dc.identifier.issn | 0894-069X | en_US |
dc.identifier.issn | 1520-6750 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/86850 | |
dc.description.abstract | We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 | en_US |
dc.publisher | Wiley Subscription Services, Inc., A Wiley Company | en_US |
dc.subject.other | Facility Location | en_US |
dc.subject.other | Production Planning | en_US |
dc.subject.other | Branch and Price | en_US |
dc.subject.other | Order Selection | en_US |
dc.title | Exact algorithms for integrated facility location and production planning problems | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Statistics (Mathematical) | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, Michigan 48109‐2117 | en_US |
dc.contributor.affiliationother | Department of Industrial and Systems Engineering, Rensselaer Polytechnic Institute, Troy, New York 12180 | en_US |
dc.contributor.affiliationother | Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611‐6595 | en_US |
dc.contributor.affiliationother | Department of Industrial Engineering and Operations Research, University of California, Berkeley, California 94720‐1777 | en_US |
dc.contributor.affiliationother | Department of Industrial and Systems Engineering, Rensselaer Polytechnic Institute, Troy, New York 12180 | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/86850/1/20458_ftp.pdf | |
dc.identifier.doi | 10.1002/nav.20458 | en_US |
dc.identifier.source | Naval Research Logistics (NRL) | en_US |
dc.identifier.citedreference | A. Balakrishnan, J. Geunes, Requirements planning with substitutions: Exploiting bill‐of‐materials flexibility in production planning, Manuf Service Oper Manage 2 ( 2000 ), 166 – 185. | en_US |
dc.identifier.citedreference | A. Balakrishnan, S. Graves, A composite algorithm for a concave‐cost network flow problem, Networks 19 ( 1989 ), 175 – 202. | en_US |
dc.identifier.citedreference | C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance, Branch‐and‐price: Column generation for solving huge integer programs, Oper Res 46 ( 1998 ), 316 – 329. | en_US |
dc.identifier.citedreference | P. Chardaire, A. Sutter, M. C. Costa, Solving the dynamic facility location problem, Networks 28 ( 1996 ), 117 – 124. | en_US |
dc.identifier.citedreference | K. L. Croxton, B. Gendron, T. L. Magnanti, A comparison of mixed‐integer programming models for nonconvex piecewise linear cost minimization problems, Manage Sci 49 ( 2003 ), 1268 – 1273. | en_US |
dc.identifier.citedreference | M. Daskin, C. Coullard, Z.‐J. Shen, An inventory‐location model: Formulation, solution algorithm, and computational results, Ann of Oper Res 10 ( 2001 ), 83 – 106. | en_US |
dc.identifier.citedreference | M. S. Daskin, Network and discrete location: Models, algorithms, and applications, Wiley, New York, 1995. | en_US |
dc.identifier.citedreference | E. V. Denardo, Dynamic programming: Models and applications, Prentice‐Hall, Englewood Cliffs, New Jersey, 1982. | en_US |
dc.identifier.citedreference | R. Freling, H. E. Romeijn, D. Romero Morales, A. P. M. Wagelmans, A branch‐and‐price algorithm for the multi‐period single‐sourcing problem, Oper Res 51 ( 2003 ), 922 – 939. | en_US |
dc.identifier.citedreference | J. Geunes, H. E. Romeijn, K. Taaffe, Requirements planning with dynamic pricing and order selection flexibility, Oper Res 54 ( 2006 ), 394 – 401. | en_US |
dc.identifier.citedreference | P. C. Gilmore, R. E. Gomory, A linear programming approach to the cutting‐stock problem, Oper Res 9 ( 1961 ), 849 – 859. | en_US |
dc.identifier.citedreference | W. Huang, H. E. Romeijn, J. Geunes, The continuous‐time single‐sourcing problem with capacity expansion opportunities, Naval Res Logist 52 ( 2005 ), 193 – 211. | en_US |
dc.identifier.citedreference | J. Krarup, O. Bilde, Plant location, set covering, and economic lot size: An O ( m n ) ‐algorithm for structured problems, L. Collatz, W. Wetterling (Editors), Numerische Methoden Bei Optimierungsaufgaben, Band 3: Optimierung Bei Graph‐Theoretischen Und Ganzahligen Problemen, Birkhauser, Basel, 1977, pp. 155 – 180. | en_US |
dc.identifier.citedreference | S. F. Love, Bounded production and inventory models with piecewise concave costs, Manage Sci 20 ( 1973 ), 313 – 318. | en_US |
dc.identifier.citedreference | T. Magnanti, Z.‐J. Shen, J. Shu, D. Simchi‐Levi, C.‐P. Teo, Inventory placement in acyclic supply chain networks, Oper Res Lett 34 ( 2006 ), 228 – 238. | en_US |
dc.identifier.citedreference | H. E. Romeijn, D. Romero Morales, A probabilistic analysis of the multi‐period single‐sourcing problem, Discrete Appl Math 112 ( 2001 ), 301 – 328. | en_US |
dc.identifier.citedreference | H. E. Romeijn, D. Romero Morales, An asymptotically optimal greedy heuristic for the multi‐period single‐sourcing problem: The cyclic case, Naval Res Logist 50 ( 2003 ), 412 – 437. | en_US |
dc.identifier.citedreference | H. E. Romeijn, D. Romero Morales, Asymptotic analysis of a greedy heuristic for the multi‐period single‐sourcing problem: The acyclic case, J Heurist 10 ( 2004 ), 5 – 35. | en_US |
dc.identifier.citedreference | H. E. Romeijn, T. C. Sharkey, Z. J. Shen, J. Zhang, Integrating facility location and production planning decisions, Networks 55 ( 2010 ), 78 – 89. | en_US |
dc.identifier.citedreference | T. J. Van Roy, D. Erlenkotter, A dual‐based procedure for dynamic facility location, Manage Sci 28 ( 1982 ), 1091 – 1105. | en_US |
dc.identifier.citedreference | M. P. W. Savelsbergh, A branch–and–price algorithm for the generalized assignment problem, Oper Res 45 ( 1997 ), 831 – 841. | en_US |
dc.identifier.citedreference | J. F. Shapiro, Modeling the supply chain, Duxbury, Pacific Grove, CA, 2001. | en_US |
dc.identifier.citedreference | Z. J. Shen, C. Coullard, M. S. Daskin, A joint location‐inventory model, Transport Sci 37 ( 2003 ), 40 – 55. | en_US |
dc.identifier.citedreference | J. Shu, C. P. Teo, Z. J. Shen, Stochastic transportation‐inventory network design problem, Oper Res 53 ( 2005 ), 48 – 60. | en_US |
dc.identifier.citedreference | A. F. Veinott, Minimum concave cost solutions of Leontief substitution models of multi‐facility inventory systems, Oper Res 17 ( 1969 ), 262 – 291. | en_US |
dc.identifier.citedreference | H. M. Wagner, A postscript to dynamic problems of the theory of the firm, Naval Res Logist Quart 7 ( 1960 ), 7 – 12. | en_US |
dc.identifier.citedreference | H. M. Wagner, T. M. Whitin, Dynamic version of the economic lot size model, Manage Sci 5 ( 1958 ), 89 – 96. | en_US |
dc.identifier.citedreference | G. O. Wesolowsky, Dynamic facility location, Manage Sci 19 ( 1973 ), 1241 – 1248. | en_US |
dc.identifier.citedreference | S. D. Wu, H. Golbasi, Multi‐item, multi‐facility supply chain planning: Models, complexities, and algorithms, Comput Optim Appl 28 ( 2004 ), 325 – 356. | en_US |
dc.identifier.citedreference | P. H. Zipkin, Foundations of inventory management ( 2000 ). | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.