Minimizing the makespan in job shop scheduling under conflict graph constraints

Nour Elhouda Tellache, Abdenour Azerine

We study the job shop scheduling problem with a conflict graph (JSC), in which adjacent jobs in the conflict graph cannot be processed simultaneously on different machines, with th…