no. 4
Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities
RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 4, pp. 429-443.

The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean relaxation, into a master facility location problem and a slave minimal cost multi-commodity flow problem. The decomposition framework gives rise in a natural way to designing a Lagrangean based heuristic. Numerical experiments showing the efficiency of the proposed approach are reported.

DOI : 10.1051/ro/2013050
Classification : 90B05
Mots clés : lot-sizing, multi-plant, storage and transfer capacity, facility location, multi-commodity flow, lagrangean relaxation 
@article{RO_2013__47_4_429_0,
     author = {Deleplanque, Samuel and Kedad-Sidhoum, Safia and Quilliot, Alain},
     title = {Lagrangean {Heuristic} for a {Multi-Plant} {Lot-Sizing} {Problem} with {Transfer} and {Storage} {Capacities}},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {429--443},
     publisher = {EDP-Sciences},
     volume = {47},
     number = {4},
     year = {2013},
     doi = {10.1051/ro/2013050},
     mrnumber = {3143762},
     zbl = {1282.90027},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ro/2013050/}
}
TY  - JOUR
AU  - Deleplanque, Samuel
AU  - Kedad-Sidhoum, Safia
AU  - Quilliot, Alain
TI  - Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2013
SP  - 429
EP  - 443
VL  - 47
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ro/2013050/
DO  - 10.1051/ro/2013050
LA  - en
ID  - RO_2013__47_4_429_0
ER  - 
%0 Journal Article
%A Deleplanque, Samuel
%A Kedad-Sidhoum, Safia
%A Quilliot, Alain
%T Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2013
%P 429-443
%V 47
%N 4
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ro/2013050/
%R 10.1051/ro/2013050
%G en
%F RO_2013__47_4_429_0
Deleplanque, Samuel; Kedad-Sidhoum, Safia; Quilliot, Alain. Lagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities. RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 4, pp. 429-443. doi : 10.1051/ro/2013050. http://www.numdam.org/articles/10.1051/ro/2013050/

[1] I. Barany, T.J. Van Roy and L.A. Wolsey. Strong formulations for multi-item capacitated lot-sizing. Manag. Sci. 30 (1984) 1255-1261. | MR | Zbl

[2] G. Bitran and H. Yanasse, Computational complexity of the capacitated lot size problem. Manag. Sci. 28 (1982) 1174-1186. | MR | Zbl

[3] W. Chen and J. Thizy, Analysis of relaxations for the multi-item capacitated lot-sizing problem. Annal. Oper. Res. 26 (1990) 29-72. | MR | Zbl

[4] M. Florian and M. Klein, Deterministic production planning with concave costs and capacity constraints. Manag. Sci. 18 (1971) 12-20. | MR | Zbl

[5] M. Florian, J. Lenstra and A.R. Kan, Deterministic production planning: algorithms and complexity. Manag. Sci. 26 (1980) 669-679. | MR | Zbl

[6] R. Jans and Z. Degraeve, Modeling industrial lot sizing problems: a review. Int. J. Prod. Res. 46 (2008) 1619-1643. | Zbl

[7] J. Maes and L. Van Wassenhove, Multi-item single-level capacitated lot-sizing heuristics: a general review. J. Oper. Res. Soc. 11 (1988) 991-1004. | Zbl

[8] M.C.V. Nascimento, M.G.C. Resende and F.M.B. Toledo, Grasp heuristic with path-relinking for the multi-plant capacitated lot sizing problem. Eur. J. Oper. Res. 200 (2010) 1-17. | Zbl

[9] M. Sambivasan and S. Yahya, A Lagrangean based heuristic for multi-plant, multi-item, multi-period capacited lot sizing problems with inter-plant transfers. Comput. Oper. Res. 32 (2005) 537-552. | Zbl

[10] G. Ghiani, F. Guerrero and F. Musmanno, The capacitated plant location problem with multiple facilities in the same site. Comput. Oper. Res. 29-13 (2002) 1903-12. | MR | Zbl

[11] G. Cornuejols, G.L. Nemhauser and L.A. Wolsey, The uncapacited facility location problem. In Discrete location theory, edited by B. Mirchandani, R.L. Francis (1990) 119-171. | MR | Zbl

[12] B. Mirchandani and R.L. Francis, Discrete location theory. Wiley, J. Sons (1990). | MR | Zbl

[13] M.G. Resende and R.F. Werneck, A hybrid heuristic for the p-median problem. J. Heuristics 10 (2004) 59-88. | Zbl

[14] M. Minoux, Programmation Mathématique, Tome 1. Dunod Ed (1983). | Zbl

[15] S. Wu and H. Golbasi, Multi-Item, Multi-Facility Supply Chain Planning: Models, Complexities, and Algorithms. Comput. Optim. Appl. 28 (2004) 325-356. | MR | Zbl

Cité par Sources :