%0 Journal Article
%A Samouei, P.
%A Fattahi, P.
%T An Analytical and comparative approach for using Metaheuristic algorithms for job shop scheduling problems
%J Journal of Operational Research and Its Applications
%V 14
%N 1
%U http://jamlu.liau.ac.ir/article-1-854-en.html
%R
%D 2017
%K Job shop scheduling problem, Tabu Search (TS), Simulated Annealing (SA), Genetic Algorithm(GA), Particle Swarm Optimization(PSO),
%X One of the most important problems in research and applied fields of production management is a suitable scheduling for different operations. So, there are many approaches for job workshop or job non-workshop scheduling problems. Since job workshop scheduling problems (JSP) belong to NP-Hard class, some metaheuristics methods such as Tabu Search, Simulated Annealing, Genetic Algorithm and Particle Swarm Optimization have used in different papers to solve such problems. This paper tries to solve these problems by using these algorithms and compares their conclusions. Therefore, problems with different sizes are used and are analyzed by time, quantified, and parametric approaches.
%> http://jamlu.liau.ac.ir/article-1-854-en.pdf
%P 63-76
%& 63
%!
%9 Research
%L A-11-237-2
%+ , Department of Industrial Engineering, Alzahra University, Tehran
%G eng
%@ 2251-7286
%[ 2017