Volume 14, Issue 1 (4-2017)                   jor 2017, 14(1): 63-76 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Samouei P, Fattahi P. An Analytical and comparative approach for using Metaheuristic algorithms for job shop scheduling problems. jor 2017; 14 (1) :63-76
URL: http://jamlu.liau.ac.ir/article-1-854-en.html
, Department of Industrial Engineering, Alzahra University, Tehran
Abstract:   (4348 Views)

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.

Full-Text [PDF 952 kb]   (4543 Downloads)    
Type of Study: Research | Subject: Special
Received: 2016/09/3 | Accepted: 2017/02/11 | Published: 2017/06/13

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.