IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v61y2010i1d10.1057_jors.2008.151.html
   My bibliography  Save this article

An approach for solving the lot-sizing problem of a market-driven foundry

Author

Listed:
  • V S Tonaki

    (Universidade de São Paulo)

  • F M B Toledo

    (Universidade de São Paulo)

Abstract

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.

Suggested Citation

  • V S Tonaki & F M B Toledo, 2010. "An approach for solving the lot-sizing problem of a market-driven foundry," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 108-114, January.
    • Handle: RePEc:pal:jorsoc:v:61:y:2010:i:1:d:10.1057_jors.2008.151
    DOI: 10.1057/jors.2008.151
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2008.151
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2008.151?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    2. dos Santos-Meza, Elisangela & Oliveira dos Santos, Maristela & Nereu Arenales, Marcos, 2002. "A lot-sizing problem in an automated foundry," European Journal of Operational Research, Elsevier, vol. 139(3), pages 490-500, June.
    3. Willard I. Zangwill, 1969. "A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System--A Network Approach," Management Science, INFORMS, vol. 15(9), pages 506-527, May.
    4. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Siao-Leu Phouratsamay & Safia Kedad-Sidhoum & Fanny Pascual, 2021. "Coordination of a two-level supply chain with contracts," 4OR, Springer, vol. 19(2), pages 235-264, June.
    2. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    3. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    4. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    5. Tempelmeier, Horst, 2007. "On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 181(1), pages 184-194, August.
    6. Kajjoune, Oussama & Aouam, Tarik & Zouadi, Tarik & Ranjan, Ravi Prakash, 2023. "Dynamic lot-sizing in a two-stage supply chain with liquidity constraints and financing options," International Journal of Production Economics, Elsevier, vol. 258(C).
    7. Kerkkamp, R.B.O. & van den Heuvel, W. & Wagelmans, A.P.M., 2019. "Two-echelon lot-sizing with asymmetric information and continuous type space," Omega, Elsevier, vol. 87(C), pages 158-176.
    8. Vernon Ning Hsu, 2000. "Dynamic Economic Lot Size Model with Perishable Inventory," Management Science, INFORMS, vol. 46(8), pages 1159-1169, August.
    9. Boonmee, Atiwat & Sethanan, Kanchana, 2016. "A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry," European Journal of Operational Research, Elsevier, vol. 250(2), pages 652-665.
    10. Romeijn, H.E. & van den Heuvel, W.J. & Geunes, J., 2012. "Mitigating the Cost of Anarchy in Supply Chain Systems," Econometric Institute Research Papers EI 2012-03, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    11. Chung-Yee Lee & Sila Çetinkaya & Wikrom Jaruphongsa, 2003. "A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse," Operations Research, INFORMS, vol. 51(5), pages 735-747, October.
    12. Chung-Lun Li & Qingying Li, 2016. "Polynomial-Time Solvability of Dynamic Lot Size Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-20, June.
    13. Hark-Chin Hwang & Hyun-Soo Ahn & Philip Kaminsky, 2013. "Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem," Operations Research, INFORMS, vol. 61(2), pages 469-482, April.
    14. Yale T. Herer & Michal Tzur, 2001. "The dynamic transshipment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(5), pages 386-408, August.
    15. Azaron, Amir & Tang, Ou & Tavakkoli-Moghaddam, Reza, 2009. "Dynamic lot sizing problem with continuous-time Markovian production cost," International Journal of Production Economics, Elsevier, vol. 120(2), pages 607-612, August.
    16. Hark-Chin Hwang & Wilco van den Heuvel & Albert P. M. Wagelmans, 2023. "Multilevel Lot-Sizing with Inventory Bounds," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1470-1490, November.
    17. Jans, R.F., 2006. "Solving Lotsizing Problems on Parallel Identical Machines Using Symmetry Breaking Constraints," ERIM Report Series Research in Management ERS-2006-051-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    18. Hwang, Hark-Chin & Kang, Jangha, 2020. "The two-level lot-sizing problem with outbound shipment," Omega, Elsevier, vol. 90(C).
    19. Bruno, Giuseppe & Genovese, Andrea & Piccolo, Carmela, 2014. "The capacitated Lot Sizing model: A powerful tool for logistics decision making," International Journal of Production Economics, Elsevier, vol. 155(C), pages 380-390.
    20. Goisque, Guillaume & Rapine, Christophe, 2017. "An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels," European Journal of Operational Research, Elsevier, vol. 261(3), pages 918-928.

    More about this item

    Keywords

    foundry; lot-sizing; heuristic;
    All these keywords.

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:61:y:2010:i:1:d:10.1057_jors.2008.151. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.