Formulações Fortes para o Problema de Dimensionamento de Lotes com Várias Plantas
DOI:
https://doi.org/10.5540/tema.2013.014.03.0305Abstract
Este trabalho aborda o problema de dimensionamento de lotes em um ambiente com várias plantas. Cada item pode ser produzido em qualquer planta e é possível atender a demanda de uma determinada planta com produção proveniente de uma (ou várias) outras plantas, para tanto, incorre-se um custo de transferência. O objetivo do trabalho consiste em desenvolver formulações fortes para este problema. Para tanto são investigadas reformulações que baseiam-se no problema do caminho mínimo e localização de facilidades. Por fim, alguns resultados computacionais são apresentados comparando todas as formulações propostas.
References
begin{thebibliography}{99}
bibitem{Alfieri2002}
A. Alfieri, P. Brandimarte, S. D'orazio,
Lp-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm,
{em International Journal of Production Research}, {bf 40} (2002), 441--458.
bibitem{Araujo2011}
S. A. de Araujo, B. de Reyck, Z. Degraeve, I. Fragkos, R Jans,
Primal and dual bounds for long-horizon lot size problems with tight capacity constraints,
em " International Workshop on Lot Sizing - IWLS ", Istanbul-Turquia, 2011.
bibitem{Bernardes2010}
E. D. Bernardes, S. A. Araujo, M. S. N. Rangel,
Reformulação para um problema integrado de dimensionamento e sequenciamento de lotes,
emph{Pesquisa Operacional}, {bf 30} (2010), 637--655.
bibitem{Bhatnagar1993}
R. Bhatnagar, P. Chandra, S. K. Goyal,
Models for multi-plant coordination,
emph{European Journal of Operational Research}, {bf 67} (1993), 141--160.
bibitem{Denizel2008}
M. Denizel, F. Altekin, H. Sural, H. Stadtler,
Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times,
emph{OR Spectrum}, {bf 30} (2008), 773--785.
bibitem{DenizelSural2006}
M. Denizel, H. Sural,
On alternative mixed integer programming formulations and lp-based heuristics for lot-sizing with setup times,
emph{Journal of the Operational ResearchcSociety}, {bf 57} (2006), 389--399.
bibitem{EppenMartin1987}
G. D. Eppen, R. K. Martin,
Solving multi-item capacitated lot-sizing problems using variable redefinition,
emph{Operations Research}, {bf 35} (1987), 832--848.
bibitem{FiorottoAraujo2012}
D. J. Fiorotto, S. A. de Araujo,
Relaxação lagrangiana aplicada ao problema de dimensionamento de lotes em máquinas paralelas: Limitantes inferiores,
emph{TEMA Tendências em Matemática Aplicada e Computacional}, {bf 13} (2012), 13--24.
bibitem{Fourer2002}
R. Fourer, D. M. Gay, B. W. Kernighan,
" AMPL: A Modeling Language for Mathematical Programming ",
Duxbury Press, Cole Publishing Company, 2002.
bibitem{Guimaraes2012}
L. Guimarães, D. Klabjan, B. Almada-Lobo,
Annual production budget in the beverage industry,
emph{Engineering Applications of Artificial Intelligence}, {bf 25} (2012), 229--241
bibitem{Cplex}
IBM (2007). ILOG - CPLEX 12,1 - Matematic Programing Optimizers.
bibitem{Jans2009}
R. Jans,
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints,
emph{INFORMS Journal on Computing}, {bf 21} (2009), 123--136.
bibitem{Jansdegraeve2004}
R. Jans, Z. Degraeve,
Improved lower bounds for the capacitated lot sizing problem with setup times,
emph{Operations Research Letters}, {bf 32} (2004), 185--195.
bibitem{KaminskySimchi-Levi2003}
P. Kaminsky, D. Simchi-Levi,
Production and distribution lot sizing in a two stage supply chain,
emph{IIE Transactions}, {bf 35} (2003), 1065--1075.
bibitem{KrarupBilde1977}
J. Krarup, O. Bilde,
Sharp lower bounds and efficient algorithms for the simple plant location problem,
em " Annals of Discrete Mathematics ", 1977.
bibitem{MattaMiller2004}
R. Matta, T. Miller,
Production and inter-facility transportation scheduling for a process industry,
emph{European Journal of Operational Research}, {bf 158} (2004), 72--88.
bibitem{Nascimento2010}
M. C. Nascimento, M. G. Resende, F. M. Toledo,
Grasp heuristic with path-relinking for the multi-plant capacitated lot sizing problem,
emph{European Journal of Operational Research}, {bf 200} (2010), 747--754.
bibitem{SambasivanSchmidt2002}
M. Sambasivan, C. P. Schmidt,
A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems,
emph{Asia - Pacific Journal of Operational Research}, {bf 19} (2002), 87--105.
bibitem{SambasivanYahya2005}
M. Sambasivan, S. Yahya,
A lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers,
emph{Computers & Operations Research}, {bf 32} (2005), 537--555.
bibitem{SilvaToledo2012}
D. H. Silva, F. M. Toledo,
Dimensionamento de lotes com múltiplas plantas: comparação entre dois modelos,
em " Anais do CLAIO/SBPO ", 2012.
bibitem{Stadtler1996}
H. Stadtler,
Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing,
European Journal of Operational Research, {bf 94} (1996), 561--581.
bibitem{SuerieStadtler2002}
C. Suerie, H. Stadtler,
The capacitated lot-sizing problem with linked lot sizes,
emph{Management Science}, {bf 49} (2002), 1039--1054.
bibitem{ToledoArmentano2006}
F. M. B. Toledo, V. A. Armentano,
A Lagrange-based heuristic for the capacitated lot-sizing problem with parallel machines,
emph{European Journal of Operational Research}, {bf 175} (2006), 1070--1083.
bibitem{Vanderbeck1998}
F. Vanderbeck,
Lot-sizing with start-up times,
emph{Management Science}, {bf 44} (1988), 1409--1425.
bibitem{Wolsey1989}
L. Wolsey,
Uncapacitated lot-sizing problems with start-up costs,
emph{Operational Research}, {bf 37} (1989), 741--747.
end{thebibliography}
Downloads
Published
How to Cite
Issue
Section
License
Copyright
Authors of articles published in the journal Trends in Computational and Applied Mathematics retain the copyright of their work. The journal uses Creative Commons Attribution (CC-BY) in published articles. The authors grant the TCAM journal the right to first publish the article.
Intellectual Property and Terms of Use
The content of the articles is the exclusive responsibility of the authors. The journal uses Creative Commons Attribution (CC-BY) in published articles. This license allows published articles to be reused without permission for any purpose as long as the original work is correctly cited.
The journal encourages Authors to self-archive their accepted manuscripts, publishing them on personal blogs, institutional repositories, and social media, as long as the full citation is included in the journal's website version.
