Solving a job-shop scheduling problem by an adaptive algorithm based on learning

What is it about?

This conference paper considers the makespan minimization job shop scheduling problem. We present an adaptive algorithm using a learning stage, where knowledge has been accumulated during the solution of similar job shop problems. Computational results are given for some benchmark instances.

Featured Image