An approach for solving the lot-sizing problem of a market-driven foundry / V. S. Tonaki in Journal of the operational research society (JORS), Vol. 61 N° 1 (Issue spécial) (Janvier 2010)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 108–114 Titre : An approach for solving the lot-sizing problem of a market-driven foundry Type de document : texte imprimé Auteurs : V. S. Tonaki, Auteur ; F. M. B. Toledo, Auteur Année de publication : 2011 Article en page(s) : pp. 108–114 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Foundry Lot-sizing Heuristic Index. décimale : 001.424 Résumé : Foundries can be found all over Brazil and they are very important to its economy. In 2008, a mixed integer-programming model for small market-driven foundries was published, attempting to minimize delivery delays. We undertook a study of that model. Here, we present a new approach based on the decomposition of the problem into two sub-problems: production planning of alloys and production planning of items. Both sub-problems are solved using a Lagrangian heuristic based on transferences. An important aspect of the proposed heuristic is its ability to take into account a secondary practice objective solution: the furnace waste. Computational tests show that the approach proposed here is able to generate good quality solutions that outperform prior results. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008151a.html [article] An approach for solving the lot-sizing problem of a market-driven foundry [texte imprimé] / V. S. Tonaki, Auteur ; F. M. B. Toledo, Auteur . - 2011 . - pp. 108–114. Recherche opérationnelle Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 61 N° 1 (Issue spécial) (Janvier 2010) . - pp. 108–114 Mots-clés : Foundry Lot-sizing Heuristic Index. décimale : 001.424 Résumé : Foundries can be found all over Brazil and they are very important to its economy. In 2008, a mixed integer-programming model for small market-driven foundries was published, attempting to minimize delivery delays. We undertook a study of that model. Here, we present a new approach based on the decomposition of the problem into two sub-problems: production planning of alloys and production planning of items. Both sub-problems are solved using a Lagrangian heuristic based on transferences. An important aspect of the proposed heuristic is its ability to take into account a secondary practice objective solution: the furnace waste. Computational tests show that the approach proposed here is able to generate good quality solutions that outperform prior results. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n1/abs/jors2008151a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire

Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries / V. C. B. Camargo in Journal of the operational research society (JORS), Vol. 63 N° 11 (Novembre 2012)  

Public ISBD [article]  inJournal of the operational research society (JORS) > Vol. 63 N° 11 (Novembre 2012) . - pp. 1613–1630 Titre : Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries Type de document : texte imprimé Auteurs : V. C. B. Camargo, Auteur ; F. M. B. Toledo, Auteur ; B. Almada-Lobo, Auteur Année de publication : 2012 Article en page(s) : pp. 1613–1630 Note générale : operational research Langues : Anglais (eng) Mots-clés : lot sizing and scheduling  two-stage production system  mixed-integer program  time scale Index. décimale : 001.424 Résumé : In this paper, we propose three novel mathematical models for the two-stage lot-sizing and scheduling problems present in many process industries. The problem shares a continuous or quasi-continuous production feature upstream and a discrete manufacturing feature downstream, which must be synchronized. Different time-based scale representations are discussed. The first formulation encompasses a discrete-time representation. The second one is a hybrid continuous-discrete model. The last formulation is based on a continuous-time model representation. Computational tests with state-of-the-art MIP solver show that the discrete-time representation provides better feasible solutions in short running time. On the other hand, the hybrid model achieves better solutions for longer computational times and was able to prove optimality more often. The continuous-type model is the most flexible of the three for incorporating additional operational requirements, at a cost of having the worst computational performance. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n11/abs/jors2011159a.html [article] Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries [texte imprimé] / V. C. B. Camargo, Auteur ; F. M. B. Toledo, Auteur ; B. Almada-Lobo, Auteur . - 2012 . - pp. 1613–1630. operational research Langues : Anglais (eng) in Journal of the operational research society (JORS) > Vol. 63 N° 11 (Novembre 2012) . - pp. 1613–1630 Mots-clés : lot sizing and scheduling  two-stage production system  mixed-integer program  time scale Index. décimale : 001.424 Résumé : In this paper, we propose three novel mathematical models for the two-stage lot-sizing and scheduling problems present in many process industries. The problem shares a continuous or quasi-continuous production feature upstream and a discrete manufacturing feature downstream, which must be synchronized. Different time-based scale representations are discussed. The first formulation encompasses a discrete-time representation. The second one is a hybrid continuous-discrete model. The last formulation is based on a continuous-time model representation. Computational tests with state-of-the-art MIP solver show that the discrete-time representation provides better feasible solutions in short running time. On the other hand, the hybrid model achieves better solutions for longer computational times and was able to prove optimality more often. The continuous-type model is the most flexible of the three for incorporating additional operational requirements, at a cost of having the worst computational performance. DEWEY : 001.424 ISSN : 0160-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v63/n11/abs/jors2011159a.html

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire