Combinatorial Benders cuts for assembly line balancing problems with setups

详细信息    查看全文

• 作者：Sener Akpinar ; ^a ; ^{sener.akpinar@deu.edu.tr} ; Atabak Elmi^b ; Tolga Bektaş^c
• 关键词：Combinatorial optimization ; Type-I assembly line balancing problem ; Sequence-dependent setup times ; Benders decomposition ; Combinatorial Benders cuts
• 刊名：European Journal of Operational Research
• 出版年：2017
• 出版时间：1 June 2017
• 年：2017
• 卷：259
• 期：2
• 页码：527-537
• 全文大小：506 K
• 卷排序：259

文摘

We proposed an exact solution algorithm for setup assembly line balancing problem. The algorithm is based on Benders decomposition. We improved and used a previously proposed formulation of the problem. The performance of the proposed algorithm was tested on a set of benchmark instances. The results confirm the superiority of the algorithm in terms of computational time.