fa مدل‌سازی یک مسأله زمان‌بندی کارگاه باز چند هدفه جدید و حل آن با استفاده از روش جستجوی پراکنده سایر موضوعاتی که به مرزهای دانش در مهندسی صنایع و تولید کمک می کند Other related Industrial and production reserach subjects in which has direct relation to the state-of-the art of the IE پژوهشي Research <p align="right"><span style="FONT-FAMILY: Nazanin FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman'" dir="rtl" lang="FA">در این مقاله، یک مدل ریاضی چندهدفه جدیدی برای زمان­بندی تولید در محیط کارگاه باز ارایه می‌شود.</span><span dir="ltr"></span><span dir="ltr"></span><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-family: Nazanin" lang="FA"><span dir="ltr"></span><span dir="ltr"></span> </span><span style="FONT-FAMILY: Nazanin FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman'" dir="rtl" lang="FA">اهداف مدل پیشنهادی شامل حداقل نمودن حداکثر زمان تکمیل کارها، مجموع زمان دیرکرد و زودکرد کارها و مجموع هزینه راه‌اندازی کارها است. مسأله مورد نظر با توجه به ماهیت پیچیده آن در زمره مسایل </span><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-family: Nazanin">NP-hard</span><span dir="rtl"></span><span dir="rtl"></span><span style="FONT-FAMILY: Nazanin FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman'" dir="rtl" lang="FA"><span dir="rtl"></span><span dir="rtl"></span> قرار می ‌گیرد، بنابراین یک الگوریتم فراابتکاری چندهدفه بر مبنای روش جستجوی پراکنده برای حل آن ارایه می ‌شود و مسایل متنوعی با ابعاد مختلف مورد حل قرار می­‌گیرد. در نهایت برای اثبات کارایی روش پیشنهادی، نتایج حاصل از آن با جواب‌های تولید شده توسط یک روش تکاملی چندهدفه معروف به </span><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-family: Nazanin">NSGA-II</span><span dir="rtl"></span><span dir="rtl"></span><span style="FONT-FAMILY: Nazanin FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman'" dir="rtl" lang="FA"><span dir="rtl"></span><span dir="rtl"></span> مقایسه می­‌شوند</span><span dir="ltr"></span><span dir="ltr"></span><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-family: Nazanin"><span dir="ltr"></span><span dir="ltr"></span>.</span><span dir="rtl"></span><span dir="rtl"></span><span style="FONT-FAMILY: Nazanin FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-ascii-font-family: 'Times New Roman' mso-hansi-font-family: 'Times New Roman'" dir="rtl" lang="FA"><span dir="rtl"></span><span dir="rtl"></span> نتایج مربوطه نشان دهنده کارایی روش پیشنهادی در تولید جواب‌های با کیفیت، متنوع و دارای پراکندگی بالا است</span></p> <span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA"><em>This paper </em><a name="OLE_LINK30"></a><a name="OLE_LINK29"></a><a name="OLE_LINK8"></a><a name="OLE_LINK7"><span style="mso-bookmark: OLE_LINK8"><span style="mso-bookmark: OLE_LINK29"><span style="mso-bookmark: OLE_LINK30"><font size="3" face="Times New Roman"><em>proposes </em></font></span></span></span></a><span style="mso-bookmark: OLE_LINK29"><span style="mso-bookmark: OLE_LINK30"><font size="3" face="Times New Roman"><em>a novel, </em></font><a name="OLE_LINK100"></a><a name="OLE_LINK99"><span style="mso-bookmark: OLE_LINK100"><font size="3" face="Times New Roman"><em>multi-objective </em></font></span></a><font size="3" face="Times New Roman"><em>integer programming model </em></font></span></span><em>for an open-shop scheduling problem (OSSP). </em></span><em><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: AdvGulliv-R mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA">Three objectives are to minimize the makespan</span><span style="FONT-FAMILY: "Times-Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-family: Times-Roman">,</span><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA"> total job <a name="OLE_LINK96"></a><a name="OLE_LINK95"><span style="mso-bookmark: OLE_LINK96"><font size="3" face="Times New Roman">tardiness and earliness</font></span></a>, and total jobs <a name="OLE_LINK98"></a><a name="OLE_LINK97"><span style="mso-bookmark: OLE_LINK98"><font size="3" face="Times New Roman">setup cost</font></span></a>.</span><span style="FONT-FAMILY: "Times-Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-family: Times-Roman"> </span><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: AdvGulliv-R mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA">Due the complexity to solve such a hard problem</span><span style="FONT-FAMILY: "Times-Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-family: Times-Roman">, </span><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: AdvGulliv-R mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA">we develop a meta-heuristic algorithm based on </span><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA">multi-objective </span><span style="FONT-FAMILY: "Times New Roman","serif" FONT-SIZE: 11pt mso-fareast-font-family: AdvGulliv-R mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA">scatter search (MOSS), and a number of test problems are solved by this proposed algorithm. Finally, to prove its efficiency, the related results are compared with the results obtained by the well-known multi-objective evolutionary algorithm, called NSGA-II. The results confirm the efficiency and the effectiveness of our proposed MOSS to provide good solutions, especially for medium and large-sized problems</span></em> مسایل زمان‌بندی کارگاه باز، زمان دیرکرد و زودکرد، حداکثر زمان تکمیل کارها، هزینه راه‌اندازی، جستجوی پراکنده چند هدفه، NSGA-II Open shop scheduling problems, Tardiness and earliness time, Makespan, Setup cost, NSGA-II, Multi-objective scatter search 153 164 http://ijiepm.iust.ac.ir/browse.php?a_code=A-10-243-9&slc_lang=fa&sid=1 Nafiseh Amiri 180031947532846004096 180031947532846004096 No Department of Industrial Engineering, Research & Science Branch, Islamic Azad University, Tehran, Iran Reza Tavakkoli-Moghaddam tavakoli@ut.ac.ir 180031947532846004097 180031947532846004097 Yes Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Yosouf Gholipour-Kanani 180031947532846004098 180031947532846004098 No Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran Seyed Ali Torabi 180031947532846004099 180031947532846004099 No Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran