Mathematical formulation for open shop scheduling problem
Abstract
In this paper we present a mathematical formulation for solving open shop scheduling problem. We derived different classes of valid inequalities to strength the model. Exhaustive computational experiments on the well known sets of Taillard's benchmarks are presented. The derived valid inequalities show a good improvement to the computational time for the proposed model.