The production planning problem of orders in small foundries
RAIRO - Operations Research - Recherche Opérationnelle, Tome 53 (2019) no. 5, pp. 1551-1561.

The production planning problem in market-driven foundries consists of determining the alloys to be melted and the items to be produced. A production plan is defined based on the foundry book order that compiles customer requests. Each customer order can be composed of items of different types and made from different alloys. In the literature, production planning does not usually consider the customers’ orders, i.e., items are independently handled. However, in practical situations, several orders cannot be partially delivered. An order can be delivered only when all of its items have been produced, which often results in delays in meeting the customer demands. Conversely, some orders may be split, which would incur delivering costs. This paper addresses the production planning problem of orders in market-driven foundries, which is considered a gap in the literature. A mathematical model and a relax-and-fix heuristic are proposed to address the problem. An experimental evaluation using synthetic datasets and a real dataset compares the proposed methods with the practical policy planning and a state-of-the-art method that solve the production planning problem of items. The results demonstrate the relevance of the production planning of orders.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2019084
Classification : 90C11, 68T20, 90C90
Mots-clés : Market-driven foundry, lot sizing, mixed integer programming, relax-and-fix heuristic
Furtado, Maria Gabriela S. 1 ; Camargo, Victor C. B. 1 ; Toledo, Franklina M. B. 1

1
@article{RO_2019__53_5_1551_0,
     author = {Furtado, Maria Gabriela S. and Camargo, Victor C. B. and Toledo, Franklina M. B.},
     editor = {Quilliot, Alain and Figueiredo, Rosa},
     title = {The production planning problem of orders in small foundries},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {1551--1561},
     publisher = {EDP-Sciences},
     volume = {53},
     number = {5},
     year = {2019},
     doi = {10.1051/ro/2019084},
     mrnumber = {4016081},
     zbl = {1430.90229},
     language = {en},
     url = {http://www.numdam.org/articles/10.1051/ro/2019084/}
}
TY  - JOUR
AU  - Furtado, Maria Gabriela S.
AU  - Camargo, Victor C. B.
AU  - Toledo, Franklina M. B.
ED  - Quilliot, Alain
ED  - Figueiredo, Rosa
TI  - The production planning problem of orders in small foundries
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2019
SP  - 1551
EP  - 1561
VL  - 53
IS  - 5
PB  - EDP-Sciences
UR  - http://www.numdam.org/articles/10.1051/ro/2019084/
DO  - 10.1051/ro/2019084
LA  - en
ID  - RO_2019__53_5_1551_0
ER  - 
%0 Journal Article
%A Furtado, Maria Gabriela S.
%A Camargo, Victor C. B.
%A Toledo, Franklina M. B.
%E Quilliot, Alain
%E Figueiredo, Rosa
%T The production planning problem of orders in small foundries
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2019
%P 1551-1561
%V 53
%N 5
%I EDP-Sciences
%U http://www.numdam.org/articles/10.1051/ro/2019084/
%R 10.1051/ro/2019084
%G en
%F RO_2019__53_5_1551_0
Furtado, Maria Gabriela S.; Camargo, Victor C. B.; Toledo, Franklina M. B. The production planning problem of orders in small foundries. RAIRO - Operations Research - Recherche Opérationnelle, Tome 53 (2019) no. 5, pp. 1551-1561. doi : 10.1051/ro/2019084. http://www.numdam.org/articles/10.1051/ro/2019084/

[1] S.A. Araujo and M.N. Arenales, Dimensionamento de lotes e programação do forno numa fundição automatizada de porte médio. Pesquisa Oper. 23 (2003) 403–420. | DOI

[2] S.A. Araujo, M.N. Arenales and A.R. Clark, Lot-sizing and furnace scheduling in small foundries. Comput. Oper. Res. 35 (2008) 916–932. | DOI | Zbl

[3] V.C.B. Camargo, Um algoritmo evolutivo para o problema de dimensionamento de lotes em fundições de mercado. Master’s thesis, Instituto de Ciências Matemáticas e de Computação – USP (2009).

[4] V.C.B. Camargo, L. Mattiolli and F.M.B. Toledo, A knapsack problem as a tool to solve the production planning problem in small foundries. Comput. Oper. Res. 39 (2012) 86–92. | DOI | MR | Zbl

[5] Z.L. Chen, Integrated production and outbound distribution scheduling: review and extensions. Oper. Res. 58 (2010) 130–148. | DOI | Zbl

[6] J. Duda, Lot-sizing in a foundry using genetic algorithm and repair functions. In: EvoCOP. Lecture Notes in Computer Science. Springer 2005 101–111. | DOI | Zbl

[7] J. Duda and A. Osyczka, Multiple criteria lot-sizing in a foundry using evolutionary algorithms. In: Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science. Springer Berlin/Heidelberg (2005) 651–663. | DOI | Zbl

[8] J. Duda and A. Stawowy, Optimization methods for lot-sizing problem in an automated foundry. Arch. Metall. Mater. 58 (2013) 863–866. | DOI

[9] A. Federgruen, J. Meissner and M. Tzur, Progressive interval heuristics for multi-item capacitated lot sizing problem. Oper. Res. 55 (2007) 490–502. | DOI | MR | Zbl

[10] D. Ferreira, R. Morabito and S. Rangel, Solution approaches for the soft drink integrated production lot sizing and scheduling problem. Eur. J. Oper. Res. 196 (2009) 697–706. | DOI | Zbl

[11] C. Mercé and G. Fontan, MIP-based heuristics for capacitated lotsizing problems. Int. J. Prod. Econ. 85 (2003) 97–111. | DOI

[12] E. Santos-Meza, M.O. Santos and M.N. Arenales, A lot-sizing problem in an automated foundry. Eur. J. Oper. Res 139 (2002) 490–500. | DOI | Zbl

[13] H. Stadtler, Multilevel lot sizing with setup times and multiple constrained resources: internally rolling schedules with lot-sizing windows. Oper. Res. 51 (2003) 487–502. | DOI | Zbl

[14] A. Stawowy and J. Duda, Models and Algorithms for production planning and scheduling in foundries – current state and development perspectives. Arch. Foundry Eng. 12 (2012) 69–74. | DOI

[15] K.E. Stecke and X. Zhao, Production and transportation integration for a make-to-order manufacturing company with a commit-to-delivery business mode. Manuf. Ser. Oper. Manage. 9 (2007) 206–224. | DOI

[16] R.F. Teixeira Jr, F.C.F. Fernandes and N.A. Pereira, Binary integer programming formulations for scheduling in market-driven foundries. Comput. Ind. Eng. 59 (2010) 425–435. | DOI

[17] V.S. Tonaki and F.M.B. Toledo, An approach to solve the lot-sizing and scheduling problem in market-driven foundries. J. Oper. Res. Soc. 61 (2010) 108–114. | DOI | Zbl

[18] E.A.V. Toso, R. Morabito and A. Clark, Lot sizing and sequencing optimization at an animal-feed plan. Comput. Ind. Eng. 57 (2009) 813–821. | DOI

Cité par Sources :