A Proposal of Column Generation with Cut Generation for Flowshop Scheduling Problems

Abstract

We propose a column generation with cut generation for flowshop scheduling problems. In the proposed method, constraints for eliminating some of violation for machine capacity constraints are imposed to the pricing problems for arbitrarily selected two jobs. We show that lower bound can be strengthened by the cut generation without significantly increasing total computing time. Computational experiments show that the proposed method can derive solutions with smaller duality gap compared with those of the conventional column generation.