Simulated annealing algorithm to solve flexible job shop problems

Authors

  • Róbert Hablik ETEO Software Factory Ltd.
  • Martin Szabó University of Miskolc

DOI:

https://doi.org/10.35925/j.multi.2020.4.45

Keywords:

production informatics, discrete production scheduling, simulated annealing, local search methods, global search methods

Abstract

The use of modern production IT tools and systems is essential for the more efficient and economical operations of production companies. The goal of companies is always to maximize profits and minimize production waste. Increasing work efficiency is possible only with the introduction of different IT methods and machine tools that expediently support production. However, the use of human labor is still essential, so it is advisable to set up systems that also allow for human intervention (supervision, control, and management). We have implemented a production informatics application that is suitable for scheduling one-path, one-pass, multi-operational tasks based on a preselected scheduling rule and objective function. The paper introduces an experimental software module that can schedule tasks with a simulated annealing algorithm, implemented to achieve better results. After presenting the theoretical foundations and the applied research methods, the publication also includes the results obtained with the algorithm and comparative analysis. The article is an excerpt from Róbert Hablik's dissertation entitled “Diszkrét ütemezési feladatok reaktív megoldási módszereinek implementálása és összehasonlító elemzése”

 

Downloads

Published

2020-12-19