A genetic algorithm for scheduling open shops with sequence-dependent setup times

In the open shop scheduling problem with sequence-dependent setup times, there is no established order for the processing of the jobs, which leads to a large number of possible solutions for the scheduling problem. Furthermore, there is a setup time between two consecutive operations, which depends on the job previously processed. In this work we propose a hybrid genetic algorithm for the OSSP with sequence-dependent setup times and total...