Opportunistic supply chain formation from qualified partners for a new market demand

This paper addresses the problem of short-term supply chain design using the idle capacities of qualified partners in order to seize a new market opportunity. The new market opportunity is characterized by a deterministic forecast over a planning horizon. The production–distribution process is assumed to be organized in stages or echelons, and each echelon may have several qualified partners willing to participate. Partners within the echelon may differ in idle production capacity, operational cost, storage cost, etc, and we assume that idle capacity may be different from one period to another period. The objective is to design a supply chain by selecting one partner from each echelon to meet the forecasted demand without backlog and best possible production and logistics costs over the given planning horizon. The overall problem is formulated as a large mixed integer linear programming problem. We develop a decomposition-based solution approach that is capable of overcoming the complexity and dimensionality associated with the problem. Numerical results are presented to support the effectiveness of this approach.

[1]  Stephanie Freiwald Supply Chain Design: Robuste Planung mit differenzierter Auswahl der Zulieferer , 2005 .

[2]  G. Fandel,et al.  A general model for extended strategic supply chain management with emphasis on product life cycles including development and recycling , 2004 .

[3]  Marc Goetschalckx,et al.  Strategic production-distribution models: A critical review with emphasis on global supply chain models , 1997 .

[4]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[5]  Hau L. Lee,et al.  Decentralized Multi-Echelon Supply Chains: Incentives and Information , 1999 .

[6]  Satyaveer Singh Chauhan Chaîne d'approvisionnement: approaches stratégique et tactique , 2003 .

[7]  R. Nagel,et al.  Agile competitors and virtual organisations , 1995 .

[8]  S. Graves,et al.  Supply chain management : design, coordination and operation , 2003 .

[9]  Fangruo Chen,et al.  Information Sharing and Supply Chain Coordination , 2003, Supply Chain Management.

[10]  L. G. Mitten Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..

[11]  T. Chien,et al.  Determining profit-maximizing production/shipping policies in a one-to-one direct shipping, stochastic demand environment , 1993 .

[12]  Rakesh Nagi,et al.  A review of integrated analysis of production-distribution systems , 1999 .

[13]  Mikael Rönnqvist,et al.  Supply chain optimization in the pulp mill industry--IP models, column generation and novel constraint branches , 2004, Eur. J. Oper. Res..

[14]  K.G. Kempf,et al.  Control-oriented approaches to supply chain management in semiconductor manufacturing , 2004, Proceedings of the 2004 American Control Conference.

[15]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[16]  Andi Cakravastia,et al.  A two-stage model for the design of supply chain networks , 2002 .

[17]  Jean-Marie Proth,et al.  Supply Chain Design and Management: Strategic and Tactical Perspectives , 2002 .

[18]  Lazaros G. Papageorgiou,et al.  Fair transfer price and inventory holding policies in two-enterprise supply chains , 2002, Eur. J. Oper. Res..

[19]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[20]  Børge Obel,et al.  A heuristic solution to the warehouse location-routing problem , 1994 .

[21]  Douglas R. Shier,et al.  On algorithms for finding the k shortest paths in a network , 1979, Networks.

[22]  Gérard P. Cachon,et al.  Capacity Choice and Allocation: Strategic Behavior and Supply Chain Performance , 1999 .

[23]  Elias Willem Hans,et al.  Resource Loading by Branch-and-Price Techniques , 2001 .

[24]  P. Pontrandolfo,et al.  Supply chain coordination by revenue sharing contracts , 2004 .

[25]  S. Gilbert,et al.  Note. the Role of Returns Policies in Pricing and Inventory Decisions for Catalogue Goods , 1998 .

[26]  Eric R. Zieyel Operations research : applications and algorithms , 1988 .

[27]  M. Padberg,et al.  Lp-based combinatorial problem solving , 1985 .

[28]  Gerd Finke,et al.  An Integrated Model for an Industrial Production–Distribution Problem , 2001 .