IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v28y2000i2p175-184.html
   My bibliography  Save this article

A neural network model for solving the lot-sizing problem

Author

Listed:
  • Gaafar, Lotfi K.
  • Choueiki, M. Hisham

Abstract

Artificial neural network models have been used successfully to solve demand forecasting and production scheduling problems; the two steps that typically precede and succeed Material Requirements Planning (MRP). In this paper, a neural network model is applied to the MRP problem of lot-sizing. The model's performance is evaluated under different scenarios and is compared to common heuristics that address the same problem. Results show that the developed artificial neural network model is capable of solving the lot-sizing problem with notable consistency and reasonable accuracy.

Suggested Citation

  • Gaafar, Lotfi K. & Choueiki, M. Hisham, 2000. "A neural network model for solving the lot-sizing problem," Omega, Elsevier, vol. 28(2), pages 175-184, April.
    • Handle: RePEc:eee:jomega:v:28:y:2000:i:2:p:175-184
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(99)00035-3
    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. Robert C. Carlson & James V. Jucker & Dean H. Kropp, 1979. "Less Nervous MRP Systems: A Dynamic Economic Lot-Sizing Approach," Management Science, INFORMS, vol. 25(8), pages 754-761, August.
    2. Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Niloofar Jahani & Arash Sepehri & Hadi Rezaei Vandchali & Erfan Babaee Tirkolaee, 2021. "Application of Industry 4.0 in the Procurement Processes of Supply Chains: A Systematic Literature Review," Sustainability, MDPI, vol. 13(14), pages 1-25, July.
    2. Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    3. Amani, Farzaneh A. & Fadlalla, Adam M., 2017. "Data mining applications in accounting: A review of the literature and organizing framework," International Journal of Accounting Information Systems, Elsevier, vol. 24(C), pages 32-58.

    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. Jian Yang & Xiangtong Qi & Gang Yu, 2005. "Disruption management in production planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 420-442, August.
    2. 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.
    3. 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.
    4. Charles, Mehdi & Dauzère-Pérès, Stéphane & Kedad-Sidhoum, Safia & Mazhoud, Issam, 2022. "Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories," European Journal of Operational Research, Elsevier, vol. 302(1), pages 203-220.
    5. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    6. 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.
    7. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    8. Salewski, Frank & Nissen, Rüdiger, 1993. "Revidierende hierarchische Planung: Ein Konzept am Beispiel der Personaleinsatzplanung in Wirtschaftsprüfungsgesellschaften," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 335, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Hark‐Chin Hwang & Wilco van den Heuvel, 2012. "Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(3‐4), pages 244-253, April.
    10. Martel, Alain & Gascon, Andre, 1998. "Dynamic lot-sizing with price changes and price-dependent holding costs," European Journal of Operational Research, Elsevier, vol. 111(1), pages 114-128, November.
    11. Sahin, Funda & Powell Robinson, E. & Gao, Li-Lian, 2008. "Master production scheduling policy and rolling schedules in a two-stage make-to-order supply chain," International Journal of Production Economics, Elsevier, vol. 115(2), pages 528-541, October.
    12. Herbert Meyr & Mirko Kiel, 2022. "Minimizing setups and waste when printing labels of consumer goods," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(3), pages 733-761, September.
    13. Nadjib Brahimi & Stéphane Dauzère-Pérès & Najib M. Najid, 2006. "Capacitated Multi-Item Lot-Sizing Problems with Time Windows," Operations Research, INFORMS, vol. 54(5), pages 951-967, October.
    14. Aarts, E. H. L. & Reijnhoudt, M. F. & Stehouwer, H. P. & Wessels, J., 2000. "A novel decomposition approach for on-line lot-sizing," European Journal of Operational Research, Elsevier, vol. 122(2), pages 339-353, April.
    15. Yongpei Guan, 2011. "Stochastic lot-sizing with backlogging: computational complexity analysis," Journal of Global Optimization, Springer, vol. 49(4), pages 651-678, April.
    16. van den Heuvel, Wilco & Wagelmans, Albert P.M., 2006. "A polynomial time algorithm for a deterministic joint pricing and inventory model," European Journal of Operational Research, Elsevier, vol. 170(2), pages 463-480, April.
    17. Weihong Hu & Zhuoting Yu & Alejandro Toriello & Maged M. Dessouky, 2020. "Decomposition‐based approximation algorithms for the one‐warehouse multi‐retailer problem with concave batch order costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(7), pages 503-523, October.
    18. Piñeyro, Pedro & Viera, Omar, 2010. "The economic lot-sizing problem with remanufacturing and one-way substitution," International Journal of Production Economics, Elsevier, vol. 124(2), pages 482-488, April.
    19. 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.
    20. Heuvel, Wilco van den & Borm, Peter & Hamers, Herbert, 2007. "Economic lot-sizing games," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1117-1130, January.

    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:jomega:v:28:y:2000:i:2:p:175-184. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.