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.
Primary Language | English |
---|---|
Subjects | Industrial Engineering |
Journal Section | Reviews |
Authors | |
Publication Date | December 1, 2013 |
Submission Date | March 28, 2013 |
Published in Issue | Year 2013 Volume: 31 Issue: 4 |
IMPORTANT NOTE: JOURNAL SUBMISSION LINK https://eds.yildiz.edu.tr/sigma/