A Memetic Algorithm to Solve the Open Shop Scheduling Problem
No Thumbnail Available
Date
2015
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Access Rights
info:eu-repo/semantics/closedAccess
Abstract
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.
Description
6th International Conference on Modeling, Simulation, and Applied Optimization (ICMSAO) -- MAY 27-29, 2015 -- Istanbul, TURKEY
Keywords
open shop scheduling, memetic algorithm, makespan minimization, optimization, metaheuristic
Journal or Series
2015 6TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION, AND APPLIED OPTIMIZATION (ICMSAO)
WoS Q Value
N/A
Scopus Q Value
N/A
