A Lagrangean heuristic for integrated production and transportation planning problems in a dynamic, multi-item, two-layer supply chain

  • Ekşioǧlu S
  • Ekşioǧlu B
  • Romeijn H
  • 20

    Readers

    Mendeley users who have this article in their library.
  • 26

    Citations

    Citations of this article.

Abstract

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.

Author-supplied keywords

  • Fixed-charge cost
  • Lagrangean decomposition
  • Multi-commodity network flow
  • Production planning
  • Supply chain

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free