Article ID: | iaor20072318 |
Country: | United Kingdom |
Volume: | 57 |
Issue: | 9 |
Start Page Number: | 1089 |
End Page Number: | 1099 |
Publication Date: | Sep 2006 |
Journal: | Journal of the Operational Research Society |
Authors: | Proth J.-M., Nagi R., Sarmiento A.M., Chauhan S.S. |
Keywords: | production, programming: integer, heuristics, forecasting: applications, distribution |
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.