A Memetic Algorithm to Solve the Open Shop Scheduling Problem

dc.contributor.authorEngin, Batuhan Eren
dc.contributor.authorSümbül, Mehmet Onur
dc.contributor.authorEngin, Orhan
dc.contributor.authorBaysal, Mehmet Emin
dc.contributor.authorSarucan, Ahmet
dc.date.accessioned2020-03-26T19:00:24Z
dc.date.available2020-03-26T19:00:24Z
dc.date.issued2015
dc.departmentSelçuk Üniversitesien_US
dc.description6th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO) -- MAY 27-29, 2015 -- Istanbul, TURKEYen_US
dc.description.abstractOpen 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.en_US
dc.identifier.isbn978-1-4673-6601-4
dc.identifier.issn2473-4748en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://hdl.handle.net/20.500.12395/31764
dc.identifier.wosWOS:000380551800049en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.ispartof2015 6TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION, AND APPLIED OPTIMIZATION (ICMSAO)en_US
dc.relation.ispartofseriesInternational Conference on Modeling Simulation and Applied Optimization
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectopen shop schedulingen_US
dc.subjectmemetic algorithmen_US
dc.subjectmakespan minimizationen_US
dc.subjectoptimizationen_US
dc.subjectmetaheuristicen_US
dc.titleA Memetic Algorithm to Solve the Open Shop Scheduling Problemen_US
dc.typeConference Objecten_US

Dosyalar