zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A knapsack problem as a tool to solve the production planning problem in small foundries. (English) Zbl 1251.90027
Summary: According to recent research carried out in the foundry sector, one of the most important concerns of the industries is to improve their production planning. A foundry production plan involves two dependent stages: (1) determining the alloys to be merged and (2) determining the lots that will be produced. The purpose of this study is to draw up plans of minimum production cost for the lot-sizing problem for small foundries. As suggested in the literature, the proposed heuristic addresses the problem stages in a hierarchical way. Firstly, the alloys are determined and, subsequently, the items that are produced from them. In this study, a knapsack problem as a tool to determine the items to be produced from furnace loading was proposed. Moreover, we proposed a genetic algorithm to explore some possible sets of alloys and to determine the production planning for a small foundry. Our method attempts to overcome the difficulties in finding good production planning presented by the method proposed in the literature. The computational experiments show that the proposed methods presented better results than the literature. Furthermore, the proposed methods do not need commercial software, which is favorable for small foundries.

90B05Inventory, storage, reservoirs
90B30Production models
90C27Combinatorial optimization
90C59Approximation methods and heuristics
90C10Integer programming
Full Text: DOI
[1] Abifa, Annual report \langlehttp://www.abifa.com.br angle, 2005.
[2] Fernandes, F. C. F.; Leite, R. B.: Automação industrial e sistemas informatizados de gestão da produção EM fundições de mercado, Gestão & produção 9, 313-344 (2002)
[3] Santos-Meza, E.; Santos, M. O.; Arenales, M. N.: A lot-sizing problem in an automated foundry, European journal of operational research 139, 490-500 (2002) · Zbl 0995.90024
[4] Araujo, S. A.; Arenales, M. N.; Clark, A. R.: Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups, Journal of heuristics 13, 337-358 (2007)
[5] Duda, J.: Lot-sizing in a foundry using genetic algorithm and repair functions, , 101-111 (2005) · Zbl 1119.68437 · doi:10.1007/b107115
[6] Duda, J.; Osyczka, A.: Multiple criteria lot-sizing in a foundry using evolutionary algorithms, , 651-663 (2005) · Zbl 1109.68593 · doi:10.1007/b106458
[7] Silva, R. J.; Morabito, R.: Otimização da programação de cargas de forno EM uma fábrica de fundição EM aço-inox, Gestão & produção 11, 135-151 (2004)
[8] Araujo, S. A.; Arenales, M. N.; Clark, A. R.: Lot-sizing and furnace scheduling in small foundries, Computers and operations research 35, 916-932 (2008) · Zbl 1278.90180
[9] Tonaki, V. S.; Toledo, F. M. B.: An approach to solve the lot sizing and scheduling problem in market-driven foundries, Journal of operational research society 200, 747-754 (2010) · Zbl 1193.90092
[10] Bahl, H. C.; Ritzman, L. P.; Gupta, J. N. D.: Determining lot sizes and resources requirements: a review, Operations research 35, 329-345 (1986)
[11] Drexl, A.; Kimms, A.: Lot sizing and scheduling--survey and extensions, European journal of operational research 99, 221-235 (1997) · Zbl 0923.90067 · doi:10.1016/S0377-2217(97)00030-1
[12] Brahimi, N.; Dauzere-Peres, S.; Najid, N. M.; Nordli, A.: Single item lot sizing problems, European journal of operational research 168, 1-16 (2006) · Zbl 1077.90001 · doi:10.1016/j.ejor.2004.01.054
[13] Jans, R.; Degraeve, Z.: Modeling industrial lot sizing problems: a review, International journal of production research 46, 1619-1643 (2008) · Zbl 1160.90407 · doi:10.1080/00207540600902262
[14] Peeta, S.; Salman, F. Sibel; Gunnec, D.; Viswanath, K.: Pre-disaster investment decisions for strengthening a highway network, Computers and operations research 37, 1708-1719 (2010) · Zbl 1188.90052 · doi:10.1016/j.cor.2009.12.006
[15] Correia, I.; Gouveia, L.; Da Gama, F. S.: Discretized formulations for capacitated location problems with modular distribution costs, European journal of operational research 204, 237-244 (2010) · Zbl 1178.90223 · doi:10.1016/j.ejor.2009.10.027
[16] Martello, S.; Toth, P.: Knapsack problems: algorithms and computer implementations, (1990) · Zbl 0708.68002
[17] Goren, H. G.; Tunali, S.; Jans, R.: A review of applications of genetic algorithms in lot sizing, Journal of intelligent manufacturing 21, 575-590 (2010)
[18] Larranaga, P.; Lozano, J. A.: Estimation of distribution algorithms: A new tool for evolutionary computation, (2001)
[19] Glover, F.; Laguna, M.: Fundamentals of scatter search and path relinking, Control and cybernetics 29, 653-684 (2000) · Zbl 0983.90077