A Research on Flowshop Scheduling Problems With Column Generation
Keyword(s):
Column generation is a method to calculate lowerbound for combinatorial optimization problems, although a feasible schedule is generally obtained with the upperbound. Therefore, in this paper, a new method is proposed to solve the flowshop scheduling problems with column generation, which is composed of the local search and duality gap termination condition. The neighborhood of the local search is composed of columns, and the method is applied in column generation to improve the upperbound and lowerbound. The effectiveness of the proposed method is verified by computational experiments.
2017 ◽
Vol 6
(2)
◽
pp. 117-142
◽
2010 ◽
Vol E93-D
(5)
◽
pp. 1127-1136
◽
2020 ◽
Vol 10
(3)
◽
pp. 2484
◽
2017 ◽
Vol 68
(11)
◽
pp. 1377-1398
◽
2018 ◽
Vol 27
(05)
◽
pp. 1850021
◽