In this paper, we conduct a study of the job-shop scheduling problem with reverse flows. This NP-hard problem is characterized by two flows of jobs that cover the same machines in opposite directions. The objective is to minimize the maximal completion time of the jobs (i.e., the makespan).

In recent days, the industrial sector is characterised by saturated worldwide target markets and high expectations of the consumers. This new context subjects the company to a great deal of pressure. Therefore, companies try to optimise their supply chains in order to improve their...