Abstract: The Job Shop Scheduling Problem (JSP) is one of the typical combinatorial optimization challenges, and has been a hot and difficult topic in academic research since the 1950s. In recent ...

Abstract: We consider the problem of minimizing the makespan on batch processing identical machines, subject to compatibility constraints, where two jobs are ...