کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6895291 1445941 2018 30 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Solving the flexible job shop scheduling problem with sequence-dependent setup times
ترجمه فارسی عنوان
حل مسئله برنامه ریزی شغل انعطاف پذیر با زمان راه اندازی وابسته به دنباله
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی
This paper addresses the flexible job shop scheduling problem with sequence-dependent setup times and where the objective is to minimize the makespan. We first present a mathematical model which can solve small instances to optimality, and also serves as a problem representation. After studying structural properties of the problem using a disjunctive graph model, we develop a tabu search algorithm with specific neighborhood functions and a diversification structure. Extensive experiments are conducted on benchmark instances. Test results first show that our algorithm outperforms most existing approaches for the classical flexible job shop scheduling problem. Additional experiments also confirm the significant improvement achieved by integrating the propositions introduced in this study.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 265, Issue 2, 1 March 2018, Pages 503-516
نویسندگان
, , ,