کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
497175 862878 2010 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A high performing metaheuristic for job shop scheduling with sequence-dependent setup times
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
A high performing metaheuristic for job shop scheduling with sequence-dependent setup times
چکیده انگلیسی

This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan. We develop an effective metaheuristic, simulated annealing with novel operators, to potentially solve the problem. Simulated annealing is a well-recognized algorithm and historically classified as a local-search-based metaheuristic. The performance of simulated annealing critically depends on its operators and parameters, in particular, its neighborhood search structure. In this paper, we propose an effective neighborhood search structure based on insertion neighborhoods as well as analyzing the behavior of simulated annealing with different types of operators and parameters by the means of Taguchi method. An experiment based on Taillard benchmark is conducted to evaluate the proposed algorithm against some effective algorithms existing in the literature. The results show that the proposed algorithm outperforms the other algorithms.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 10, Issue 3, June 2010, Pages 703–710
نویسندگان
, , ,