Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server

What is it about?

This paper cnsiders the problem of scheduling a set of jobs on two identical parallel machines with setups performed by a single server. The objective is to minimize the makespan. A simulated annealing and a genetic algorithm are given and tested on instances with up to 1000 jobs.

Featured Image