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 meta-heuristic methods used by researchers are rigorously investigated; and meta-heuristic methods for solving multi-objective flexible job shop scheduling problems are suggested.
Flexible job shop scheduling multi objective scheduling scheduling
Birincil Dil | İngilizce |
---|---|
Konular | Endüstri Mühendisliği |
Bölüm | Reviews |
Yazarlar | |
Yayımlanma Tarihi | 1 Aralık 2013 |
Gönderilme Tarihi | 28 Mart 2013 |
Yayımlandığı Sayı | Yıl 2013 Cilt: 31 Sayı: 4 |
IMPORTANT NOTE: JOURNAL SUBMISSION LINK https://eds.yildiz.edu.tr/sigma/