Year 2018, Volume 1, Issue 1, Pages 1 - 9 2018-12-20

Hybrid Metaheuristic for Optimization Job-Shop Scheduling Problem

Benhamza Karima [1] , Zedadra Ouarda [2]

42 76

Real Job-shop scheduling problem is one of the most difficult NP-Combinatorial issues. Exact resolution methods cannot handle large size cases. It is therefore necessary to use heuristic methods to solve them within a reasonable time. There are a large number of metaheuristic, which have the advantage of covering only part of the search space to find an acceptable solution. In this work, Genetic Algorithm and Simulated Annealing are used to solve Job-shop scheduling problem. The objective is to find the sequence of operations on the machines that will minimize the total time required to complete the set of jobs, also known as the "Makespan". Compared to traditional genetic algorithm, hybrid approach yields significant improvement in solution quality.

Scheduling Problem, Hybrid Metaheuristic, Optimization
  • C alis, B., Bulkan, S.: A research survey: review of AI solution strategies of job shop scheduling problem. Journal of Intelligent Manufacturing, 26(5), 961-973 (2015).
  • Boussad, I., Lepagnot, J., Siarry, P.: A survey on optimization metaheuristics. Information Sciences, 237, 82-117,(2013)
  • Van Laarhoven, P. J., Aarts, E. H.: Simulated annealing. In Simulated annealing: Theory and applications (pp. 7-15). Springer, Dordrecht (1987).
  • Gao, L.,Peng,C.Y.,Zhou,C.,Li,P.G.: Solving exible job shop scheduling problem using general particle swarm optimization. In Proceedings of the 36th CIE Conference on Computers and Industrial Engineering, pp.3018{3027, (2006).
  • Behnke, Dennis, and Martin Josef Geiger. "Test instances for the exible job shop scheduling problem with work centers." (2012).
  • J. Beasley. OR-Library. http://people.brunel.ac.uk/ mastjjb/jeb/info. html.
Primary Language en
Subjects Computer Science, Interdisciplinary Application
Journal Section Articles
Authors

Author: Benhamza Karima (Primary Author)
Institution: University of Guelma
Country: Algeria


Author: Zedadra Ouarda
Institution: University of Guelma
Country: Algeria


Bibtex @research article { ijiam533095, journal = {International Journal of Informatics and Applied Mathematics}, issn = {}, eissn = {2667-6990}, address = {International Society of Academicians}, year = {2018}, volume = {1}, pages = {1 - 9}, doi = {}, title = {Hybrid Metaheuristic for Optimization Job-Shop Scheduling Problem}, key = {cite}, author = {Karima, Benhamza and Ouarda, Zedadra} }
APA Karima, B , Ouarda, Z . (2018). Hybrid Metaheuristic for Optimization Job-Shop Scheduling Problem. International Journal of Informatics and Applied Mathematics, 1 (1), 1-9. Retrieved from http://dergipark.org.tr/ijiam/issue/43831/533095
MLA Karima, B , Ouarda, Z . "Hybrid Metaheuristic for Optimization Job-Shop Scheduling Problem". International Journal of Informatics and Applied Mathematics 1 (2018): 1-9 <http://dergipark.org.tr/ijiam/issue/43831/533095>
Chicago Karima, B , Ouarda, Z . "Hybrid Metaheuristic for Optimization Job-Shop Scheduling Problem". International Journal of Informatics and Applied Mathematics 1 (2018): 1-9
RIS TY - JOUR T1 - Hybrid Metaheuristic for Optimization Job-Shop Scheduling Problem AU - Benhamza Karima , Zedadra Ouarda Y1 - 2018 PY - 2018 N1 - DO - T2 - International Journal of Informatics and Applied Mathematics JF - Journal JO - JOR SP - 1 EP - 9 VL - 1 IS - 1 SN - -2667-6990 M3 - UR - Y2 - 2019 ER -
EndNote %0 International Journal of Informatics and Applied Mathematics Hybrid Metaheuristic for Optimization Job-Shop Scheduling Problem %A Benhamza Karima , Zedadra Ouarda %T Hybrid Metaheuristic for Optimization Job-Shop Scheduling Problem %D 2018 %J International Journal of Informatics and Applied Mathematics %P -2667-6990 %V 1 %N 1 %R %U
ISNAD Karima, Benhamza , Ouarda, Zedadra . "Hybrid Metaheuristic for Optimization Job-Shop Scheduling Problem". International Journal of Informatics and Applied Mathematics 1 / 1 (December 2018): 1-9.