IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v27y2019i2d10.1007_s10100-018-0570-7.html
   My bibliography  Save this article

Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming

Author

Listed:
  • Daniel Leitold

    (University of Pannonia)

  • Agnes Vathy-Fogarassy

    (University of Pannonia)

  • Janos Abonyi

    (University of Pannonia)

Abstract

According to the Industry 4.0 paradigms, the balancing of stochastic production lines requires easily implementable, flexible and robust tools for task to workstations assignment. An algorithm that calculates the performance indicators of the production line based on the convolution of the empirical density distribution functions of the working times and applies dynamic programming to assign tasks to the workstations is proposed. The sequence of tasks is optimised by an outer simulated annealing loop that operates on the set of interchangeable task-pairs extracted from the precedence graph of the task-ordering constraints. Eight line-balancing problems were studied and the results by Monte Carlo simulations were validated to demonstrate the applicability of the algorithm. The results confirm that our methodology does not just provide optimal solutions, but it is an excellent tool in terms of the sensitivity analysis of stochastic production lines.

Suggested Citation

  • Daniel Leitold & Agnes Vathy-Fogarassy & Janos Abonyi, 2019. "Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 455-473, June.
    • Handle: RePEc:spr:cejnor:v:27:y:2019:i:2:d:10.1007_s10100-018-0570-7
    DOI: 10.1007/s10100-018-0570-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-018-0570-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-018-0570-7?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. Thomas R. Hoffmann, 1963. "Assembly Line Balancing with a Precedence Matrix," Management Science, INFORMS, vol. 9(4), pages 551-562, July.
    2. Pape, Tom, 2015. "Heuristics and lower bounds for the simple assembly line balancing problem type 1: Overview, computational tests and improvements," European Journal of Operational Research, Elsevier, vol. 240(1), pages 32-42.
    3. Franco Guerriero & John Miltenburg, 2003. "The stochastic U‐line balancing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 31-57, February.
    4. Edward P. C. Kao & Maurice Queyranne, 1982. "On Dynamic Programming Methods for Assembly Line Balancing," Operations Research, INFORMS, vol. 30(2), pages 375-390, April.
    5. Robert L. Carraway, 1989. "A Dynamic Programming Approach to Stochastic Assembly Line Balancing," Management Science, INFORMS, vol. 35(4), pages 459-471, April.
    6. Wen-Chyuan Chiang, 1998. "The application of a tabu search metaheuristic to the assembly line balancing problem," Annals of Operations Research, Springer, vol. 77(0), pages 209-227, January.
    7. Michael Held & Richard M. Karp & Richard Shareshian, 1963. "Assembly-Line Balancing---Dynamic Programming with Precedence Constraints," Operations Research, INFORMS, vol. 11(3), pages 442-459, June.
    8. Steven T. Hackman & Michael J. Magazine & T. S. Wee, 1989. "Fast, Effective Algorithms for Simple Assembly Line Balancing Problems," Operations Research, INFORMS, vol. 37(6), pages 916-924, December.
    9. Becker, Christian & Scholl, Armin, 2006. "A survey on problems and methods in generalized assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 694-715, February.
    10. Chiang, Wen-Chyuan & Urban, Timothy L., 2006. "The stochastic U-line balancing problem: A heuristic procedure," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1767-1781, December.
    11. James R. Jackson, 1956. "A Computing Procedure for a Line Balancing Problem," Management Science, INFORMS, vol. 2(3), pages 261-271, April.
    12. Boysen, Nils & Fliedner, Malte & Scholl, Armin, 2007. "A classification of assembly line balancing problems," European Journal of Operational Research, Elsevier, vol. 183(2), pages 674-693, December.
    13. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    14. Bautista, Joaquín & Pereira, Jordi, 2009. "A dynamic programming based heuristic for the assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 787-794, May.
    15. Edward P. C. Kao, 1976. "A Preference Order Dynamic Program for Stochastic Assembly Line Balancing," Management Science, INFORMS, vol. 22(10), pages 1097-1104, June.
    16. L. G. Mitten, 1974. "Preference Order Dynamic Programming," Management Science, INFORMS, vol. 21(1), pages 43-46, September.
    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. Anna Olkiewicz & Marcin Okliewicz & Radosław Wolniak & Paula Donajska, 2020. "Factors Influencing the Organization of Work in a Fish Processing Industrial Enterprise," European Research Studies Journal, European Research Studies Journal, vol. 0(Special 1), pages 502-515.
    2. Diefenbach, Johannes & Stolletz, Raik, 2022. "Stochastic assembly line balancing: General bounds and reliability-based branch-and-bound algorithm," European Journal of Operational Research, Elsevier, vol. 302(2), pages 589-605.
    3. Reinhard Neck, 2020. "CEJOR special issue: dynamic optimization in management and economics," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(2), pages 367-369, June.

    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. Boysen, Nils & Schulze, Philipp & Scholl, Armin, 2022. "Assembly line balancing: What happened in the last fifteen years?," European Journal of Operational Research, Elsevier, vol. 301(3), pages 797-814.
    2. Bautista, Joaquín & Pereira, Jordi, 2011. "Procedures for the Time and Space constrained Assembly Line Balancing Problem," European Journal of Operational Research, Elsevier, vol. 212(3), pages 473-481, August.
    3. Bautista, Joaquín & Pereira, Jordi, 2009. "A dynamic programming based heuristic for the assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 787-794, May.
    4. Battaïa, Olga & Dolgui, Alexandre, 2013. "A taxonomy of line balancing problems and their solutionapproaches," International Journal of Production Economics, Elsevier, vol. 142(2), pages 259-277.
    5. Boysen, Nils & Fliedner, Malte, 2008. "A versatile algorithm for assembly line balancing," European Journal of Operational Research, Elsevier, vol. 184(1), pages 39-56, January.
    6. Marcus Ritt & Alysson M. Costa & Cristóbal Miralles, 2016. "The assembly line worker assignment and balancing problem with stochastic worker availability," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 907-922, February.
    7. Özcan, Ugur, 2010. "Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm," European Journal of Operational Research, Elsevier, vol. 205(1), pages 81-97, August.
    8. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    9. Diefenbach, Johannes & Stolletz, Raik, 2022. "Stochastic assembly line balancing: General bounds and reliability-based branch-and-bound algorithm," European Journal of Operational Research, Elsevier, vol. 302(2), pages 589-605.
    10. Urban, Timothy L. & Chiang, Wen-Chyuan, 2016. "Designing energy-efficient serial production lines: The unpaced synchronous line-balancing problem," European Journal of Operational Research, Elsevier, vol. 248(3), pages 789-801.
    11. Michels, Adalberto Sato & Lopes, Thiago Cantos & Magatão, Leandro, 2020. "An exact method with decomposition techniques and combinatorial Benders’ cuts for the type-2 multi-manned assembly line balancing problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    12. E. C. Sewell & S. H. Jacobson, 2012. "A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem," INFORMS Journal on Computing, INFORMS, vol. 24(3), pages 433-442, August.
    13. Vilà, Mariona & Pereira, Jordi, 2013. "An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time," European Journal of Operational Research, Elsevier, vol. 229(1), pages 106-113.
    14. Franco Guerriero & John Miltenburg, 2003. "The stochastic U‐line balancing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(1), pages 31-57, February.
    15. Eduardo Álvarez-Miranda & Jordi Pereira & Harold Torrez-Meruvia & Mariona Vilà, 2021. "A Hybrid Genetic Algorithm for the Simple Assembly Line Balancing Problem with a Fixed Number of Workstations," Mathematics, MDPI, vol. 9(17), pages 1-19, September.
    16. Schulze, Philipp & Scholl, Armin & Walter, Rico, 2024. "R-SALSA: A branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines," European Journal of Operational Research, Elsevier, vol. 312(1), pages 38-55.
    17. Sternatz, Johannes, 2014. "Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry," European Journal of Operational Research, Elsevier, vol. 235(3), pages 740-754.
    18. Hamta, Nima & Fatemi Ghomi, S.M.T. & Jolai, F. & Akbarpour Shirazi, M., 2013. "A hybrid PSO algorithm for a multi-objective assembly line balancing problem with flexible operation times, sequence-dependent setup times and learning effect," International Journal of Production Economics, Elsevier, vol. 141(1), pages 99-111.
    19. Wen-Chyuan Chiang & Timothy L. Urban & Chunyong Luo, 2016. "Balancing stochastic two-sided assembly lines," International Journal of Production Research, Taylor & Francis Journals, vol. 54(20), pages 6232-6250, October.
    20. M. H. Alavidoost & M. H. Fazel Zarandi & Mosahar Tarimoradi & Yaser Nemati, 2017. "Modified genetic algorithm for simple straight and U-shaped assembly line balancing with fuzzy processing times," Journal of Intelligent Manufacturing, Springer, vol. 28(2), pages 313-336, 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:spr:cejnor:v:27:y:2019:i:2:d:10.1007_s10100-018-0570-7. 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.