Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling

Graph coloring is one of the most studied combinatorial optimization problems that can be used to model several practical problems. This paper develops a reduction of job shop scheduling problem with unit-time operations to mixed graph coloring. In this study, a methodology based on Mixed Integer Linear Programming and tabu search (TS) algorithm are proposed for solving mixed graph coloring. The performances of the proposed methods are evaluated through several adapted Benchmarks.