Volume 21, Issue 4 (IJIEPM 2011)                   2011, 21(4): 103-115 | Back to browse issues page

XML Persian Abstract Print


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

Behroozi M, Eshghi K. Modeling and Solving Job Shop Scheduling Problem with Sequence Dependent Setup Times. Journal title 2011; 21 (4) :103-115
URL: http://ijiepm.iust.ac.ir/article-1-494-en.html
, eshghi@sharif.edu
Abstract:   (11439 Views)

  In recent decade, many researches has been done on job shop scheduling problem with sequence dependent setup times (SDSJSP), but with respect to the knowledge of authors in very few of them the assumption of existing inseparable setup has been considered. Also, in attracted metaheuristic algorithms to this problem the Particle Swarm Optimization has not been considered. In this paper, the ISDSJSP with makespan minimization is considered. For this problem an MILP model has been developed and a PSO algorithm has been applied to solve it. In order to improve final solution obtained by PSO a simulated annealing algorithm has been applied. The proposed hybrid algorithm (HPSO) has been applied on some generated benchmark problems and the results indicate the effectiveness and efficiency of the proposed hybrid PSO with respect to two other algorithms

Full-Text [PDF 614 kb]   (3255 Downloads)    

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

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.