You are already at the latest version We tackle the problem of job shop scheduling. Exact methods are limited to small instances, and traditional metaheuristics do not guarantee feasibility at each iteration. In this research, we propose a new two phases hybrid metaheuristic. The first phase uses Gradient Descent on a convex energy function to quickly construct a feasible solution by fixing the operations sequence. We provide a mathematical proof of convergence for this phase to a feasible solution.
