job shop scheduling problem:literature review
DOI:
https://doi.org/10.25130/tjps.v25i4.277Keywords:
metaheuristics; job shop scheduling; flexible job shop scheduling; makespan;Abstract
As an extension of the Job Shop Scheduling (JSP), Flexible job-shop Scheduling Problem (FJSP), can be defined as one of the most significant problems in up-to-date manufacturing systems, recently a lot of studies have been conducted to address FJSP. Initially, the problem can be defined, after that, literature can be categorized based on different methods that have used from the year 2010 for the resolution of this problem. Lastly, certain conclusions have been provided based on the results of the conducted survey.
Downloads
Published
How to Cite
License
Copyright (c) 2022 Tikrit Journal of Pure Science
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
