Optimizing the Permutation Flowshop Scheduling Problem by Scatter Search


Creative Commons License

ÇİÇEKLİ U. G. , Bozkurt S.

EGE ACADEMIC REVIEW, cilt.16, ss.31-40, 2016 (ESCI İndekslerine Giren Dergi) identifier

  • Cilt numarası: 16
  • Basım Tarihi: 2016
  • Doi Numarası: 10.21121/eab.2018ozel24421
  • Dergi Adı: EGE ACADEMIC REVIEW
  • Sayfa Sayıları: ss.31-40

Özet

Scheduling is one of the decision-making processes that play a critical role in the production and service industries. Flow job scheduling is one of the types of scheduling where "n" job can be processed at "m" machines consequently. When the complexity of this problem increases, obtaining the optimum solution becomes difficult. But, solution can be found near the optimum in these complex problems by using the scatter search which is one of the meta heuristics. Scatter search method which is a branch of the evolutionary approach is an advantageous optimization technique due to producing two or more solution. In this study, the new model is developed for optimizing the permutation flowshop scheduling problem by scatter search.