• DocumentCode
    3072978
  • Title

    A memetic algorithm to solve the open shop scheduling problem

  • Author

    Engin, Batuhan Eren ; Sumbul, Mehmet Onur ; Engin, Orhan ; Baysal, Mehmet Emin ; Sarucan, Ahmet

  • Author_Institution
    Ind. Eng. Dept., Selcuk Univ., Konya, Turkey
  • fYear
    2015
  • fDate
    27-29 May 2015
  • Firstpage
    1
  • Lastpage
    3
  • 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.
  • Keywords
    genetic algorithms; job shop scheduling; search problems; OSSP; genetic algorithm; local search algorithm; memetic algorithm; open shop scheduling problem; operation sequence; optimization; product families; Algorithm design and analysis; Job shop scheduling; Memetics; Processor scheduling; Sociology; Statistics; makespan minimization; memetic algorithm; metaheuristic; open shop scheduling; optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Modeling, Simulation, and Applied Optimization (ICMSAO), 2015 6th International Conference on
  • Conference_Location
    Istanbul
  • Type

    conf

  • DOI
    10.1109/ICMSAO.2015.7152243
  • Filename
    7152243
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3072978