Ahmed Kouider

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1