We present a Lagrangean-based decomposition that is used to generate solutions for an integrated production and transportation planning problem in a two-stage supply chain. This supply chain consists of a number of facilities, each capable of producing the final products, and a number of retailers. It is assumed that the retailers' demands are known and deterministic, and that there are production capacity constraints. The problem is formulated as a multi-commodity network flow problem with fixed charge costs which is a NP-hard problem. An alternative formulation is provided whose linear programming relaxation gives tighter lower bounds. The quality of the lower and upper bounds from the Lagrangean decomposition is tested on a large set of randomly generated problems.
CITATION STYLE
Ekşioǧlu, S. D., Ekşioǧlu, B., & Romeijn, H. E. (2007). A Lagrangean heuristic for integrated production and transportation planning problems in a dynamic, multi-item, two-layer supply chain. IIE Transactions (Institute of Industrial Engineers), 39(2), 191–201. https://doi.org/10.1080/07408170600733244
Mendeley helps you to discover research relevant for your work.