×

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.

MSC:

90B05 Inventory, storage, reservoirs
90B30 Production models
90C27 Combinatorial optimization
90C59 Approximation methods and heuristics in mathematical programming
90C10 Integer programming

Software:

Scatter Search
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Abifa, Annual report \(\langle\) http://www.abifa.com.br \(\rangle \); Abifa, Annual report \(\langle\) http://www.abifa.com.br \(\rangle \)
[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, (EvoCOP, Lecture Notes in Computer Science (2005), Springer), 101-111 · Zbl 1119.68437
[6] Duda, J.; Osyczka, A., Multiple criteria lot-sizing in a foundry using evolutionary algorithms, (Evolutionary Multi-Criterion Optimization, Lecture Notes in Computer Science (2005), Springer: Springer Berlin/Heidelberg), 651-663 · Zbl 1109.68593
[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
[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
[13] Jans, R.; Degraeve, Z., Modeling industrial lot sizing problems: a review, International Journal of Production Research, 46, 1619-1643 (2008) · Zbl 1160.90407
[14] Peeta, S.; Sibel Salman, F.; Gunnec, D.; Viswanath, K., Pre-disaster investment decisions for strengthening a highway network, Computers and Operations Research, 37, 1708-1719 (2010) · Zbl 1188.90052
[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
[16] Martello, S.; Toth, P., Knapsack Problems: Algorithms and Computer Implementations (1990), John Wiley & Sons Inc.: John Wiley & Sons Inc. New York, NY, USA, ISBN 0-471-92420-2 · 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), Kluwer Academic Publishers: Kluwer Academic Publishers Norwell, MA, USA, ISBN 0792374665
[19] Glover, F.; Laguna, M., Fundamentals of scatter search and path relinking, Control and Cybernetics, 29, 653-684 (2000) · Zbl 0983.90077
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.