Abstract
We propose a planning model for products manufactured across multiple manufacturing facilities sharing similar production capabilities. The need for cross-facility capacity management is most evident in high-tech industries that have capital-intensive equipment and a short technology life cycle. We propose a multicommodity flow network model where each commodity represents a product and the network structure represents manufacturing facilities in the supply chain capable of producing the products. We analyze in depth the product-level (single-commodity, multi-facility) subproblem when the capacity constraints are relaxed. We prove that even the general-cost version of this uncapacitated subproblem is NP-complete. We show that there exists an optimization algorithm that is polynomial in the number of facilities, but exponential in the number of periods. We further show that under special cost structures the shortest-path algorithm could achieve optimality. We analyze cases when the optimal solution does not correspond to a source-to-sink path, thus the shortest path algorithm would fail. To solve the overall (multicommodity) planning problem we develop a Lagrangean decomposition scheme, which separates the planning decisions into a resource subproblem, and a number of product-level subproblems. The Lagrangean multipliers are updated iteratively using a subgradient search algorithm. Through extensive computational testing, we show that the shortest path algorithm serves as an effective heuristic for the product-level subproblem (a mixed integer program), yielding high quality solutions with only a fraction (roughly 2%) of the computer time.
Similar content being viewed by others
References
P. Afentakis, B. Gavish, and U. Karmarker, “Computational efficient optimal solutions to the lot-sizing problems in multistage assembly systems,” Management Science, vol. 30, pp. 222-239, 1984.
B.C. Arntzen, G.G. Brown, T.P. Harrison, and L.L. Trafton, “Global supply chain management at digital equipment corporation,” Interfaces, vol. 25, pp. 69-93, 1995.
A.A. Assad, “Models for rail transportation,” Transportation Research, vol. 14A, pp. 205-220, 1980.
H.C. Bahl, L.P. Ritzman, and J.N.D. Gupta, “Determining lot sizes and resource requirements: A review,” Operations Research, vol. 35, pp. 329-345, 1987.
K.R. Baker, “Requirements planning,” in Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, vol. 4, S.C. Graves et al. (Eds.), Elsevier Science Publishers: Amsterdam, The Netherlands, 1993.
A. Balakrishnan and J. Geunes, “Requirements planning with substitutions: Exploiting bill-of-materials flexibility in production planning,” M&SOM, vol. 2, no. 2, 2000.
P.J. Billington, J.O. McClain, and L.J. Thomas, “Mathematical programming approaches to capacityconstrained MRP systems: Review, formulation and problem reduction,” Management Science, vol. 29, no. 10, pp. 1126-1141, 1983.
J. Blackburn and R. Millen, “Improved heuristics for multi-stage requirements planning systems,” Management Science, vol. 28, no. 1, pp. 44-56, 1982.
R.M. Burton and B. Obel, Designing Efficient Organizations, North Holland, Amsterdam, 1984.
R.C. Carlson and C.A. Yano, “Safety stocks in MRP systems with emergency setups for components,” Management Science, vol. 32, no. 4, pp. 403-412, 1983.
M.A. Cohen and H.L. Lee, “Strategic analysis of integrated production-distribution systems: Models and Methods,” Operations Research, vol. 36, no. 2, pp. 216-228, 1988.
M.A. Cohen and H.L. Lee, “Resource deployment analysis of global manufacturing and distribution networks,” Journal of Manufacturing and Operations Management, no. 2, pp. 81-104, 1989.
T. Davis, “Effective supply chain management,” Sloan Management Review, Summer, pp. 35-46, 1993.
S.E. Dreyfus and R.A. Wagner, “On the steiner problem in graphs,” Networks, vol. 1, pp. 195-207, 1972.
K. Ertogral and S.D. Wu, “Auction theoretic coordination of production planning in the supply chain,” IIE Transactions, Special Issue on Design and Manufacturing: Decentralized Control of Manufacturing Systems, vol. 32, no. 10, pp. 931-940, 2000.
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,” Management Science, vol. 27, pp. 1-18, 1981.
S.K.Goyal and A. Gunasekaran, “Multi-stage production-inventory systems,” European Journal of Operational Research, vol. 46, pp. 1-20, 1990.
S.C. Graves et al. (Eds.), Handbooks in Operations Research and Management Science, vol. 4, Logistics of Production and Inventory. Elsevier Science Publishers: Amsterdam, 1992.
M. Guignard and S. Kim, “Lagrangean decomposition: A model yielding stronger lagrangean bounds,” Mathematical Programming, vol. 39, pp. 215-228, 1987.
S.M. Gupta and L. Brennan, “MRP systems under supply and process uncertainty in an integrated shop floor control environment,” International Journal of Production Research, vol. 33, no. 1, pp. 205-220, 1995.
J. Hahm and C.A. Yano, “The economic lot and delivery scheduling problem: The common cycle case,” IIE Transactions, vol. 27, pp. 113-125, 1995.
J. Hahm and C.A. Yano, “The economic lot and delivery scheduling problem: Models for nested schedules,” IIE Transactions, vol. 27, pp. 126-139, 1995b.
K.O. Jörnsten and R. Leistern, “Aggregation and decomposition for multi-divisional linear programs,” European Journal of Operational Research, vol. 72, pp. 175-191, 1994.
J.L. Kennington and R.V. Helgason, Algorithms for Network Programming, Wiley-Interscience: New York, 1980.
A. Kimms, Multi-Level Lot Sizing and Scheudling, Physica-Verlag, Heidelberg, Germany, 1997.
H. Lee, P. Padmanabhan, S. Whang, “Information distortion in a supply chain: The bullwhip effect,”Working Paper, Stanford University, April, 1995.
T. Liebling, private communications, 1999.
H.H. Millar and M. Yang, “An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem,” Computers Ops. Res., vol. 20, pp. 409-420, 1993.
J.D. Sterman, “Modeling managerial behavior: Misperceptions of feedback in a dynamic decision making experiment,” Management Science, vol. 35, no. 3, 1989.
S. Tayur, R. Ganeshan, and M. Magazine (Eds.), Quantitative Models for Supply Chain Management, Kluwer's International Series, Kluwer Academic Publishers: Norwell, MA, 1999.
H. Tempelmeir and M. Derstroff, “Alagrangean based heuristic for dynamic multilevel multi-item constrained lotsizing with setup times,” Management Science, vol. 42, pp. 738-757, 1996.
J.M. Thizy, “Analysis of lagrangean decomposition for the multi-item capacitated lot-sizing problem,” INFOR, vol. 29, pp. 271-283, 1991.
C.J. Vidal and M. Goetschalckx, “Strategic production-distribution models: A critical review with emphasis on global supply chain models,” EJOR, vol. 98, pp. 1-18, 1997.
M.S. Wagner and T.M. Whitin, “Dynamic version of the economic log sizing model,” Management Science, vol. 5, pp. 89-96, 1958.
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,” Operations Research, vol 40, pp. 145-155, 1992.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wu, S.D., Golbasi, H. Multi-Item, Multi-Facility Supply Chain Planning: Models, Complexities, and Algorithms. Computational Optimization and Applications 28, 325–356 (2004). https://doi.org/10.1023/B:COAP.0000033967.18695.9d
Issue Date:
DOI: https://doi.org/10.1023/B:COAP.0000033967.18695.9d