Esnek atölye tipi çizelgeleme problemlerinin meta sezgisel yöntemler ile çözümüne yönelik bir inceleme

Flexible job shop scheduling (FJSS) problems which are parts of real life applications are the extended case of classical job shop scheduling (JSS) problems. There are no parallel machines at JSS problems. FJSS Problems arise when works need to be done on parallel machines in the workshop. In FJSS problems, jobs have different routes and each job is consisted of at least one operation. These operations are processed by any of the machine sets which are parallel to each other. In literature; the number of studies on FJSS problems are more limited than the one on JSS problems. In this paper, recent studies in the literature on the topic of FJSS problems are reviewed. The findings and recommendations on the solution of this kind of problems by using meta-heuristic methods are presented.