A Memetic Algorithm to Solve the Open Shop Scheduling Problem
Küçük Resim Yok
Tarih
2015
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
6th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO) -- MAY 27-29, 2015 -- Istanbul, TURKEY
Anahtar Kelimeler
open shop scheduling, memetic algorithm, makespan minimization, optimization, metaheuristic
Kaynak
2015 6TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION, AND APPLIED OPTIMIZATION (ICMSAO)
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
