Nour ElHouda Tellache

Minimizing the makespan in job shop scheduling under conflict graph constraints

This work establishes a polynomial equivalence between JSC and a variant of the resource-constrained job shop problem with unit-capacity resources and proposes a genetic algorithm using permutation-with-repetition encoding and active, non-delay, and hybrid schedule evaluation procedures.