A memetic algorithm to solve the open shop scheduling problem

Open shop scheduling problem (OSSP) can basically be defined as a scheduling problem where each job has just one operation to be processed on each machine and operation sequence is free to decide. It is usually seen in facilities that produce similar product families. In this study a Memetic algorithm is proposed for solving the OSSP, and the results are promising.