MULTI OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEMS

Kaya S., FIĞLALI N.

SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI, cilt.31, sa.4, ss.605-623, 2013 (ESCI) identifier

  • Yayın Türü: Makale / Derleme
  • Cilt numarası: 31 Sayı: 4
  • Basım Tarihi: 2013
  • Dergi Adı: SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI)
  • Sayfa Sayıları: ss.605-623
  • Anahtar Kelimeler: Flexible job shop scheduling, multi objective scheduling, GENETIC ALGORITHM, TABU SEARCH, HYBRID, OPTIMIZATION, SIMULATION, MODEL
  • Kocaeli Üniversitesi Adresli: Evet

Özet

Flexible job shop scheduling problem, is an extension of the classical job shop scheduling problem. In Flexible job shop scheduling problem, there are more than one machine with the same features for the same purpose. The problem can be defined as appointing the jobs to the machines (assignment) and ordering the jobs at each machine (sequencing) to serve the desired purpose. Multi-objective flexible job shop scheduling problem is of great importance in production management and combinatorial optimization. Because of the calculation complexity, finding the optimal solution for the actual situation of medium-sized problems is very difficult with traditional optimization methods. In this study, recent works on multi-objective flexible job shop scheduling problems is examined and a comprehensive literature review is presented. Especially, the metaheuristic methods used by researchers are rigorously investigated; and meta-heuristic methods for solving multi-objective flexible job shop scheduling problems are suggested.