论文信息 - A LAGRANGEAN HEURISTIC FOR AN INBOUND SUPPLY CHAIN

A LAGRANGEAN HEURISTIC FOR AN INBOUND SUPPLY CHAIN

Abstract In this paper, we study a structure issued from a real case. Raw materials (RMs) are sent by suppliers to a distribution center (DC) and then transported to a unique plant. They can be stored in the plant. The inventory capacity is limited in the plant as well as in DC. The transportation capacity between DC and the plant is also limited. A mixed-integer programming (MIP) formulation is presented and a Lagrangean relaxation solution procedure is proposed. Computational experiments prove that this Lagrangean heuristic procedure provides solutions close to the optimal solution in a very short time.

[1] Chengbin Chu,et al. A lagrangian relaxation approach for supply chain planning with order/setup costs and capacity constraints , 2003 .

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

[3] Douglas J. Thomas,et al. Coordinated supply chain management , 1996 .

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

[5] Marshall L. Fisher,et al. Coordination of production and distribution planning , 1994 .

[6] F. Barry Lawrence,et al. Coordinated Capacitated Lot-Sizing Problem with Dynamic Demand: A Lagrangian Heuristic , 2004, Decis. Sci..

[7] Hasan Pirkul,et al. Planning and coordination of production and distribution facilities for multiple commodities , 2001, Eur. J. Oper. Res..

[8] Rrk Sharma. Modelling a fertiliser distribution system , 1991 .