A Taxonomy for the Flexible Job Shop Scheduling Problem

Çınar Ünal D., Topcu Y. İ., Oliveira J. A.

conference on Optimization Control and Applications in the Information Age, Macedonia, Greece, 15 - 20 June 2014, vol.130, pp.17-37 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume: 130
  • Doi Number: 10.1007/978-3-319-18567-5_2
  • City: Macedonia
  • Country: Greece
  • Page Numbers: pp.17-37
  • Istanbul Technical University Affiliated: No


This chapter aims at developing a taxonomic framework to classify the studies on the flexible job shop scheduling problem (FJSP). The FJSP is a generalization of the classical job shop scheduling problem (JSP), which is one of the oldest NP-hard problems. Although various solution methodologies have been developed to obtain good solutions in reasonable time for FSJPs with different objective functions and constraints, no study which systematically reviews the FJSP literature has been encountered. In the proposed taxonomy, the type of study, type of problem, objective, methodology, data characteristics, and benchmarking are the main categories. In order to verify the proposed taxonomy, a variety of papers from the literature are classified. Using this classification, several inferences are drawn and gaps in the FJSP literature are specified. With the proposed taxonomy, the aim is to develop a framework for a broad view of the FJSP literature and construct a basis for future studies.