IDEAS home Printed from https://ideas.repec.org/a/spr/sjobre/v76y2024i2d10.1007_s41471-024-00183-5.html
   My bibliography  Save this article

Using Recurrent Neural Networks for the Performance Analysis and Optimization of Stochastic Milkrun-Supplied Flow Lines

Author

Listed:
  • Insa Südbeck

    (Leibniz University Hannover)

  • Julia Mindlina

    (Leibniz University Hannover)

  • André Schnabel

    (Leibniz University Hannover)

  • Stefan Helber

    (Leibniz University Hannover)

Abstract

Long-term throughput, as a key performance indicator of a stochastic flow line, is affected by numerous parameters describing the features of the flow line, such as processing time and buffer size. Fast and accurate evaluation methods for a given set of values for those parameters are a prerequisite to systematically optimize such a flow line. In this paper, we consider the case of a flow line with random processing times, limited buffer capacities and so-called milkruns that supply the machines with material parts that are required to perform, e.g., assembly operations on workpieces. In such a system, shortages in the supply of material parts can limit the performance of the flow line. Up to now, there are no accurate analytical approaches to quantify the complex interactions in such milkrun-supplied flow lines for realistic problem sizes. We propose to use recurrent neural networks to determine the long-term throughput of such flow lines enabling us to evaluate production systems of flexible size. Our results show that the throughput can be determined accurately and quickly via recurrent neural networks. Furthermore, we use this new evaluation procedure as a building block to optimize this type of flow line using gradient and local search techniques.

Suggested Citation

  • Insa Südbeck & Julia Mindlina & André Schnabel & Stefan Helber, 2024. "Using Recurrent Neural Networks for the Performance Analysis and Optimization of Stochastic Milkrun-Supplied Flow Lines," Schmalenbach Journal of Business Research, Springer, vol. 76(2), pages 267-291, June.
  • Handle: RePEc:spr:sjobre:v:76:y:2024:i:2:d:10.1007_s41471-024-00183-5
    DOI: 10.1007/s41471-024-00183-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s41471-024-00183-5
    File Function: Abstract
    Download Restriction: no

    File URL: https://libkey.io/10.1007/s41471-024-00183-5?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
    ---><---

    References listed on IDEAS

    as
    1. Stanley Gershwin & James Schor, 2000. "Efficient algorithms for buffer space allocation," Annals of Operations Research, Springer, vol. 93(1), pages 117-144, January.
    2. Sophie Weiss & Justus Arne Schwarz & Raik Stolletz, 2019. "The buffer allocation problem in production lines: Formulations, solution methods, and instances," IISE Transactions, Taylor & Francis Journals, vol. 51(5), pages 456-485, May.
    3. Diomidis Spinellis & Michael J. Vidalis & Michael E. J. O'Kelly & Chrissoleon T. Papadopoulos, 2009. "Analysis and Design of Discrete Part Production Lines," Springer Optimization and Its Applications, Springer, number 978-0-387-89494-2, March.
    4. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    5. Stanley B. Gershwin, 1987. "An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking," Operations Research, INFORMS, vol. 35(2), pages 291-305, April.
    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. Ziwei Lin & Nicla Frigerio & Andrea Matta & Shichang Du, 2021. "Multi-fidelity surrogate-based optimization for decomposed buffer allocation problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 223-253, March.
    2. Konstantinos S. Boulas & Georgios D. Dounias & Chrissoleon T. Papadopoulos, 2023. "A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 823-852, February.
    3. Bengisu Urlu & Nesim K. Erkip, 2020. "Safety stock placement for serial systems under supply process uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 395-424, June.
    4. Stefan Helber & Carolin Kellenbrink & Insa Südbeck, 2024. "Evaluation of stochastic flow lines with provisioning of auxiliary material," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 669-708, September.
    5. Sachs, F.E. & Helber, S. & Kiesmüller, G.P., 2022. "Evaluation of Unreliable Flow Lines with Limited Buffer Capacities and Spare Part Provisioning," European Journal of Operational Research, Elsevier, vol. 302(2), pages 544-559.
    6. Mehmet Ulaş Koyuncuoğlu & Leyla Demir, 2021. "A comparison of combat genetic and big bang–big crunch algorithms for solving the buffer allocation problem," Journal of Intelligent Manufacturing, Springer, vol. 32(6), pages 1529-1546, August.
    7. Elisa Gebennini & Andrea Grassi & Cesare Fantuzzi & Stanley Gershwin & Irvin Schick, 2013. "Discrete time model for two-machine one-buffer transfer lines with restart policy," Annals of Operations Research, Springer, vol. 209(1), pages 41-65, October.
    8. Colledani, Marcello & Tolio, Tullio, 2009. "Performance evaluation of production systems monitored by statistical process control and off-line inspections," International Journal of Production Economics, Elsevier, vol. 120(2), pages 348-367, August.
    9. Jeffrey M. Alden & Lawrence D. Burns & Theodore Costy & Richard D. Hutton & Craig A. Jackson & David S. Kim & Kevin A. Kohls & Jonathan H. Owen & Mark A. Turnquist & David J. Vander Veen, 2006. "General Motors Increases Its Production Throughput," Interfaces, INFORMS, vol. 36(1), pages 6-25, February.
    10. Shi, Chuan & Gershwin, Stanley B., 2009. "An efficient buffer design algorithm for production line profit maximization," International Journal of Production Economics, Elsevier, vol. 122(2), pages 725-740, December.
    11. Michael Manitz, 2015. "Analysis of assembly/disassembly queueing networks with blocking after service and general service times," Annals of Operations Research, Springer, vol. 226(1), pages 417-441, March.
    12. Kiesmüller, G.P. & Sachs, F.E., 2020. "Spare parts or buffer? How to design a transfer line with unreliable machines," European Journal of Operational Research, Elsevier, vol. 284(1), pages 121-134.
    13. Osorio, Carolina & Bierlaire, Michel, 2012. "A tractable analytical model for large-scale congested protein synthesis networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 588-597.
    14. Nahas, Nabil & Ait-Kadi, Daoud & Nourelfath, Mustapha, 2006. "A new approach for buffer allocation in unreliable production lines," International Journal of Production Economics, Elsevier, vol. 103(2), pages 873-881, October.
    15. Beixin Xia & Binghai Zhou & Ci Chen & Lifeng Xi, 2016. "A generalized-exponential decomposition method for the analysis of inhomogeneous assembly/disassembly systems with unreliable machines and finite buffers," Journal of Intelligent Manufacturing, Springer, vol. 27(4), pages 765-779, August.
    16. Andrea Matta & Francesca Simone, 2016. "Analysis of two-machine lines with finite buffer, operation-dependent and time-dependent failure modes," International Journal of Production Research, Taylor & Francis Journals, vol. 54(6), pages 1850-1862, March.
    17. Belmansour, Ahmed-Tidjani & Nourelfath, Mustapha, 2010. "An aggregation method for performance evaluation of a tandem homogenous production line with machines having multiple failure modes," Reliability Engineering and System Safety, Elsevier, vol. 95(11), pages 1193-1201.
    18. Kolb, Oliver & Göttlich, Simone, 2015. "A continuous buffer allocation model using stochastic processes," European Journal of Operational Research, Elsevier, vol. 242(3), pages 865-874.
    19. Elisa Gebennini & Andrea Grassi & Cesare Fantuzzi, 2015. "The two-machine one-buffer continuous time model with restart policy," Annals of Operations Research, Springer, vol. 231(1), pages 33-64, August.
    20. Jean-Sébastien Tancrez, 2020. "A decomposition method for assembly/disassembly systems with blocking and general distributions," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 272-296, June.

    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:spr:sjobre:v:76:y:2024:i:2:d:10.1007_s41471-024-00183-5. 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.springer.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.