fa مدل سازی و حل مساله زمانبندی کار کارگاهی با زمانهای آماده‌سازی وابسته به توالی سایر موضوعاتی که به مرزهای دانش در مهندسی صنایع و تولید کمک می کند Other related Industrial and production reserach subjects in which has direct relation to the state-of-the art of the IE پژوهشي Research <p><table cellspacing="0" cellpadding="0" width="100%"><tbody><tr><td></td></tr></tbody></table></p><p align="right"><a name="OLE_LINK16"></a><a name="OLE_LINK16"></a><a name="OLE_LINK17"><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US"><span style="mso-bookmark: OLE_LINK16"><font face="Nazanin" size="3">در یک دهه اخیر تحقیقات نسبتا کمی بر روی مساله زمانبندی کار کارگاهی با زمان‌های آماده‌سازی وابسته به توالی جدایی‌ناپذیر (</font></span></span><span style="mso-bookmark: OLE_LINK16"><span style="FONT-SIZE: 10pt FONT-FAMILY: ">ISDSJSP</span><span dir="rtl"></span><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US"><span dir="rtl"></span>) انجام شده است. در زمینه حل این مساله نیز الگوریتم بهینه‌سازی دسته ذرات (</span><span style="FONT-SIZE: 10pt FONT-FAMILY: ">PSO</span><span dir="rtl"></span><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US"><span dir="rtl"></span>) مورد توجه قرار نگرفته است.</span></span></a><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US"> در این مقاله مساله </span><a name="OLE_LINK10"></a><a name="OLE_LINK11"><font size="2"><span style="FONT-SIZE: 10pt FONT-FAMILY: "><span style="mso-bookmark: OLE_LINK10"><font face="Times New Roman">ISDSJSP</font></span></span><span style="mso-bookmark: OLE_LINK10"><span dir="rtl"></span><span dir="rtl" style="FONT-SIZE: 10pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US"><span dir="rtl"></span> </span></span></font></a><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US">با تابع هدف کمینه‌سازی زمان پایان تمام کارها مدنظر قرار گرفته و یک مدل برنامه‌ریزی خطی عدد صحیح مختلط و یک الگوریتم ترکیبی </span><span style="FONT-SIZE: 10pt FONT-FAMILY: ">PSO</span><span dir="rtl"></span><span dir="rtl" style="FONT-SIZE: 10pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US"><span dir="rtl"></span> </span><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US">برای آن ارایه شده است. جواب بدست آمده توسط </span><span style="FONT-SIZE: 10pt FONT-FAMILY: ">PSO</span><span dir="rtl"></span><span dir="rtl" style="FONT-SIZE: 10pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US"><span dir="rtl"></span> </span><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US">با استفاده از یک الگوریتم آنیلینگ شبیه‌سازی شده بهبود داده شده است. عملکرد الگوریتم پیشنهادی (</span><span style="FONT-SIZE: 10pt FONT-FAMILY: ">HPSO</span><span dir="rtl"></span><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US"><span dir="rtl"></span>) نسبت به دو الگوریتم دیگر</span><span dir="ltr"></span><span lang="FA" style="FONT-SIZE: 11pt FONT-FAMILY: "><span dir="ltr"></span> </span><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US">بر روی مسایل نمونه تولید شده در این مقاله آزمایش شده است. نتایج حاصل، دقت و کارایی بیشتر جوابهای حاصل از </span><span style="FONT-SIZE: 10pt FONT-FAMILY: ">HPSO</span><span dir="rtl"></span><span dir="rtl" style="FONT-SIZE: 10pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US"><span dir="rtl"></span> </span><span lang="FA" dir="rtl" style="FONT-SIZE: 11pt FONT-FAMILY: Nazanin mso-fareast-font-family: 'Times New Roman' mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US">نسبت به دو الگوریتم دیگر را نشان می‌دهند</span></p> <p> <i> 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 </i><i /></p> زمانبندی کار کارگاهی، زمانهای آماده‌سازی وابسته به توالی جدایی ناپذیر، بهینه‌سازی دسته ذرات، فاکتورادیک، آنیلینگ شبیه‌سازی شده، جستجوی تصادفی حریصانه Job Shop Scheduling, Inseparable Sequence Dependent Setup Times, Particle Swarm Optimization (PSO), Factoradic, Simulated Annealing (SA), GRASP 103 115 http://ijiepm.iust.ac.ir/browse.php?a_code=A-10-149-1&slc_lang=fa&sid=1 Mehdi Behroozi mbehroozi@alum.sharif.edu 180031947532846002013 180031947532846002013 No Kourosh Eshghi eshghi@sharif.edu 180031947532846002014 180031947532846002014 Yes