scholarly journals Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems

2015 ◽  
Vol 49 (3) ◽  
pp. 527-554
Author(s):  
Boadu Mensah Sarpong ◽  
Christian Artigues ◽  
Nicolas Jozefowiez
Keyword(s):  
Combinatorial Optimization ◽  
Lower Bound ◽  
Column Generation ◽  
Optimization Problems ◽  
Combinatorial Optimization Problems ◽  
Bound Sets

A Research on Flowshop Scheduling Problems With Column Generation

2012 ◽  
Author(s):  
H. Tanohata ◽  
T. Kaihara ◽  
N. Fujii
Keyword(s):  
Combinatorial Optimization ◽  
Local Search ◽  
Column Generation ◽  
Optimization Problems ◽  
New Method ◽  
Duality Gap ◽  
Scheduling Problems ◽  
Flowshop Scheduling ◽  
Feasible Schedule ◽  
Combinatorial Optimization Problems

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.

Sign in / Sign up

Export Citation Format

Share Document