Engin, Batuhan ErenSumbul, Mehmet OnurEngin, OrhanBaysal, Mehmet EminSarucan, Ahmet2020-03-262020-03-262015978-1-4673-6601-42473-4748https://hdl.handle.net/20.500.12395/317646th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO) -- MAY 27-29, 2015 -- Istanbul, TURKEYOpen 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.eninfo:eu-repo/semantics/closedAccessopen shop schedulingmemetic algorithmmakespan minimizationoptimizationmetaheuristicConference ObjectN/AWOS:000380551800049N/A