Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach

Furugi, Ahad

doi:10.1080/0305215x.2021.1953003

Cited by 7 publications

(1 citation statement)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The present paper describes, to the best of the authors' knowledge, the first exact algorithm for the SALBP-II with zoning restrictions. The algorithm employs the principles of Benders decomposition, a technique that has seen a limited number of applications to other variants of the assembly line balancing problems Dolgui, 2013 and2015;Akpinar et al, 2017;Huang et al, 2021;Furugi, 2022). Operating on a formulation that appears in Baybars (1986), the algorithm introduces a new set of constraints on the domain of the decision variables at each iteration.…”

Section: Introductionmentioning

confidence: 99%

Benders Decomposition Algorithm for Solving the Type-II Simple Assembly Line Balancing Problem with Zoning Restrictions

Hamzadayı

2022

Yüzüncü Yıl Üniversitesi Fen Bilimleri Enstitüsü Dergisi

View full text Add to dashboard Cite

This paper considers the type-II assembly line balancing problem under zoning constraints, where a number of tasks must be assigned to a number of workstations while respecting compatibility (or otherwise) between tasks and stations, and by observing the precedence relationships between tasks. The objective is to minimize the latest completion time at any station. The paper proposes an exact algorithm that takes into account an exact formulation of the problem as well as iteratively introduces a set of constraints in the spirit of Benders decomposition. In addition to boundary constraints on the decision variables, the algorithm makes use of combinatorial cuts and a referenced local search in order to generate upper bounds. The algorithm is extensively evaluated on benchmark instances, which indicates that it outperforms the state-of-the-art approaches to the problem.

show abstract

Section: Introductionmentioning

confidence: 99%

Benders Decomposition Algorithm for Solving the Type-II Simple Assembly Line Balancing Problem with Zoning Restrictions

Hamzadayı

2022

Yüzüncü Yıl Üniversitesi Fen Bilimleri Enstitüsü Dergisi

View full text Add to dashboard Cite

show abstract

Benders’ decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers

Şahin

Kellegöz²

2022

Ann Oper Res

View full text Add to dashboard Cite

An Improved Tunicate Swarm Algorithm with Best-random Mutation Strategy for Global Optimization Problems

Gharehchopogh

2022

J Bionic Eng

View full text Add to dashboard Cite

Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach

Cited by 7 publications

References 35 publications

Benders Decomposition Algorithm for Solving the Type-II Simple Assembly Line Balancing Problem with Zoning Restrictions

Benders Decomposition Algorithm for Solving the Type-II Simple Assembly Line Balancing Problem with Zoning Restrictions

Benders’ decomposition based exact solution method for multi-manned assembly line balancing problem with walking workers

An Improved Tunicate Swarm Algorithm with Best-random Mutation Strategy for Global Optimization Problems

Contact Info

Product

Resources

About