A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Intelligent Manufacturing Année : 2012

A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem

Résumé

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 where they can be stored. The inventory capacity is limited in the plant as well as in the DC. The transportation capacity between the DC and the plant is also limited. The objective is to determine the flows between suppliers and the DC, and from the DC to the plant in order to satisfy the demand during the planning horizon while minimizing the global cost. A mixed-integer programming (MIP) formulation is presented and a Lagrangean relaxation solution procedure is proposed. Computational experiments are carried out.

Dates et versions

hal-00454112 , version 1 (08-02-2010)

Identifiants

Citer

Sékoun Kébé, Najiba Sbihi, Bernard Penz. A Lagrangean heuristic for a two-echelon storage capacitated lot-sizing problem. Journal of Intelligent Manufacturing, 2012, 23 (6), pp.2477-2483. ⟨10.1007/s10845-011-0514-8⟩. ⟨hal-00454112⟩
56 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More