IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v134y2011i1p255-261.html
   My bibliography  Save this article

A decomposition approach for the piece-mold-machine manufacturing problem

Author

Listed:
  • Ibarra-Rojas, Omar J.
  • Ríos-Mercado, Roger Z.
  • Rios-Solis, Yasmin A.
  • Saucedo-Espinosa, Mario A.

Abstract

This study addresses a real manufacturing process of pieces that are produced with molds that are mounted on machines. The characteristics of the system include setup times between jobs, dedicated parallel machines, dedicated molds, and a different production rate for each piece-mold pair. There is a demand for each type of piece, and when the company fails to meet this demand, it is often forced to buy pieces from other companies to avoid loss of customers. We describe the system with a new integer quadratically constrained programming model. The proposed formulation improves others in the literature as we do not force a mold to be mounted on a single machine, which is a more realistic description of the production process itself. To solve the problem we decompose the formulation into two subproblems: one that solves the lot-sizing of the products and another one that verifies if there is a feasible schedule for the solution of the first subproblem. This methodology is empirically tested, demonstrating its effectiveness on real size instances. Moreover, it reveals that the counterintuitive case where a mold visits more than one machine happens more often than expected.

Suggested Citation

  • Ibarra-Rojas, Omar J. & Ríos-Mercado, Roger Z. & Rios-Solis, Yasmin A. & Saucedo-Espinosa, Mario A., 2011. "A decomposition approach for the piece-mold-machine manufacturing problem," International Journal of Production Economics, Elsevier, vol. 134(1), pages 255-261, November.
    • Handle: RePEc:eee:proeco:v:134:y:2011:i:1:p:255-261
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527311002908
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Chen, Jeng-Fung & Wu, Tai-Hsi, 2006. "Total tardiness minimization on unrelated parallel machine scheduling with auxiliary equipment constraints," Omega, Elsevier, vol. 34(1), pages 81-89, January.
    2. Weng, Michael X. & Lu, John & Ren, Haiying, 2001. "Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective," International Journal of Production Economics, Elsevier, vol. 70(3), pages 215-226, April.
    3. Haase, Knut & Kimms, Alf, 2000. "Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities," International Journal of Production Economics, Elsevier, vol. 66(2), pages 159-169, June.
    4. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    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. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    2. Tiacci, Lorenzo & Saetta, Stefano, 2012. "Demand forecasting, lot sizing and scheduling on a rolling horizon basis," International Journal of Production Economics, Elsevier, vol. 140(2), pages 803-814.
    3. Yiyong Xiao & Meng You & Xiaorong Zuo & Shenghan Zhou & Xing Pan, 2018. "The Uncapacitatied Dynamic Single-Level Lot-Sizing Problem under a Time-Varying Environment and an Exact Solution Approach," Sustainability, MDPI, vol. 10(11), pages 1-14, October.
    4. Kovcs, Andrs & Brown, Kenneth N. & Tarim, S. Armagan, 2009. "An efficient MIP model for the capacitated lot-sizing and scheduling problem with sequence-dependent setups," International Journal of Production Economics, Elsevier, vol. 118(1), pages 282-291, March.
    5. 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.
    6. Ferreira, Deisemara & Clark, Alistair R. & Almada-Lobo, Bernardo & Morabito, Reinaldo, 2012. "Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production," International Journal of Production Economics, Elsevier, vol. 136(2), pages 255-265.
    7. Daniel Quadt & Heinrich Kuhn, 2009. "Capacitated lot‐sizing and scheduling with parallel machines, back‐orders, and setup carry‐over," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(4), pages 366-384, June.
    8. Abdolreza Roshani & Massimo Paolucci & Davide Giglio & Melissa Demartini & Flavio Tonelli & Maxim A. Dulebenets, 2023. "The capacitated lot-sizing and energy efficient single machine scheduling problem with sequence dependent setup times and costs in a closed-loop supply chain network," Annals of Operations Research, Springer, vol. 321(1), pages 469-505, February.
    9. Vallada, Eva & Ruiz, Rubén, 2011. "A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 211(3), pages 612-622, June.
    10. Lee, Younsoo & Lee, Kyungsik, 2020. "Lot-sizing and scheduling in flat-panel display manufacturing process," Omega, Elsevier, vol. 93(C).
    11. Ríos-Solís, Yasmín Á & Ibarra-Rojas, Omar J. & Cabo, Marta & Possani, Edgar, 2020. "A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production," European Journal of Operational Research, Elsevier, vol. 284(3), pages 861-873.
    12. Anzanello, Michel J. & Fogliatto, Flavio S. & Santos, Luana, 2014. "Learning dependent job scheduling in mass customized scenarios considering ergonomic factors," International Journal of Production Economics, Elsevier, vol. 154(C), pages 136-145.
    13. Wolosewicz, Cathy & Dauzère-Pérès, Stéphane & Aggoune, Riad, 2015. "A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 3-12.
    14. Lee, Jinkyu & Bae, Sanghyeon & Kim, Woo Chang & Lee, Yongjae, 2023. "Value function gradient learning for large-scale multistage stochastic programming problems," European Journal of Operational Research, Elsevier, vol. 308(1), pages 321-335.
    15. Amorim, P. & Belo-Filho, M.A.F. & Toledo, F.M.B. & Almeder, C. & Almada-Lobo, B., 2013. "Lot sizing versus batching in the production and distribution planning of perishable goods," International Journal of Production Economics, Elsevier, vol. 146(1), pages 208-218.
    16. Rossi, Tommaso & Pozzi, Rossella & Testa, Mariapaola, 2017. "EOQ-based inventory management in single-machine multi-item systems," Omega, Elsevier, vol. 71(C), pages 106-113.
    17. Timo Hilger & Florian Sahling & Horst Tempelmeier, 2016. "Capacitated dynamic production and remanufacturing planning under demand and return uncertainty," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(4), pages 849-876, October.
    18. Bouchery, Yann & Hezarkhani, Behzad & Stauffer, Gautier, 2022. "Coalition formation and cost sharing for truck platooning," Transportation Research Part B: Methodological, Elsevier, vol. 165(C), pages 15-34.
    19. 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.
    20. Nascimento, Mariá C.V. & Resende, Mauricio G.C. & Toledo, Franklina M.B., 2010. "GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem," European Journal of Operational Research, Elsevier, vol. 200(3), pages 747-754, February.

    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:eee:proeco:v:134:y:2011:i:1:p:255-261. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.