<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Journal title</title>
<title_fa>عنوان نشریه</title_fa>
<short_title>International Journal of Industrial Engineering &amp; Production Management</short_title>
<subject>Literature &amp; Humanities</subject>
<web_url>http://ijiepm.iust.ac.ir</web_url>
<journal_hbi_system_id>18</journal_hbi_system_id>
<journal_hbi_system_user>agent2</journal_hbi_system_user>
<journal_id_issn></journal_id_issn>
<journal_id_issn_online></journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_doi>doi</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid></journal_id_sid>
<journal_id_nlai></journal_id_nlai>
<journal_id_science></journal_id_science>
<language>fa</language>
<pubdate>
	<type>jalali</type>
	<year>1388</year>
	<month>5</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2009</year>
	<month>8</month>
	<day>1</day>
</pubdate>
<volume>20</volume>
<number>2</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>fa</language>
	<article_id_doi></article_id_doi>
	<title_fa>کمینه‌سازی حداکثر زمان تکمیل در مسأله زمانبندی تولید کارگاهی با ماشینهای موازی</title_fa>
	<title>Minimizing Makespan in Job Shop Scheduling Problem with Parallel Machines</title>
	<subject_fa></subject_fa>
	<subject></subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research</content_type>
	<abstract_fa>&lt;p align=&quot;right&quot;&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;در این مقاله، مسأله زمانبندی تولید کارگاه منعطف &lt;/span&gt;&lt;span dir=&quot;ltr&quot;&gt;&lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;&lt;span dir=&quot;ltr&quot;&gt;&lt;/span&gt;(Flexible Job Shop)&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; با تعریف جدیدی از انعطاف پذیری مورد بررسی قرار می­گیرد. در این نوع انعطاف پذیری برای مساله فرض می­شود که در هر ایستگاه عملیاتی چند ماشین وجود دارند که کارها در هر ایستگاه می­توانند به یکی از آنها تخصیص داده شود. تابع هدف کمینه­سازی بازه ساخت &lt;/span&gt;&lt;span dir=&quot;ltr&quot;&gt;&lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;&lt;span dir=&quot;ltr&quot;&gt;&lt;/span&gt;(make span)&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; &lt;span lang=&quot;FA&quot;&gt;&lt;font face=&quot;Nazanin&quot; size=&quot;3&quot;&gt;است. ابتدا مدل ریاضی مساله ارائه شده و سپس&lt;/font&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;NP-hard&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; بودن مسأله نشان داده می­شود. بعلت &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;NP-hard&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; بودن مساله استفاده از روشهای دقیق برای حل آن در زمان چندجمله­ای ممکن نیست و باید از الگوریتمهای ابتکاری برای حل آن استفاده نمود. ­به این منظور دو الگوریتم ابتکاری به نامهای &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H1&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; و &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H2&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; به ترتیب برای مسائل با ابعاد بزرگ و معمولی برای حل مساله ارائه می­شود. بعلت اینکه این مسأله تا کنون در ادبیات موضوع مورد مطالعه قرار نگرفته است، معیار مناسبی برای ارزیابی الگوریتم­های ارائه شده وجود ندارد. بنابراین بمنظور ارزیابی الگوریتمهای ارائه شده، سه الگوریتم ابتکاری با نامهای &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H3&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;، &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H4&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; و &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H5&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; و همچنین یک کران پایین برای آن ارائه می­شود و نتایج الگوریتمهای &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H1&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; و &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H2&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; با آنها مقایسه شده است. نتایج محاسبات نشان می­دهد که الگوریتم پیشنهادی &lt;/span&gt;&lt;span dir=&quot;ltr&quot;&gt;&lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;&lt;span dir=&quot;ltr&quot;&gt;&lt;/span&gt;&lt;font face=&quot;Times New Roman&quot;&gt;&lt;span style=&quot;mso-spacerun: yes&quot;&gt; &lt;/span&gt;H2&lt;/font&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;برای مسائل با ابعاد کوچک، جوابهای بهتری را نسبت به الگوریتمهای دیگر ارائه می­دهد. اما در مسائل با ابعاد بزرگ &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H1&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; به طور مجانبی کاراتر از &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H2&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; است. همچنین کارائی الگوریتم &lt;/span&gt;&lt;span style=&quot;FONT-SIZE: 9pt FONT-FAMILY: &quot;Times New Roman&quot; mso-fareast-font-family: 'Times New Roman' mso-ansi-language: EN-US mso-fareast-language: EN-US mso-bidi-language: FA mso-bidi-font-size: 11.0pt mso-bidi-font-family: Nazanin&quot;&gt;H3&lt;/span&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt;&lt;span lang=&quot;FA&quot; dir=&quot;rtl&quot; style=&quot;FONT-SIZE: 11pt FONT-FAMILY: Nazanin 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' mso-ansi-font-size: 9.0pt&quot;&gt;&lt;span dir=&quot;rtl&quot;&gt;&lt;/span&gt; پایین­تر از سایر الگوریتمها است.&lt;/span&gt;&lt;/p&gt;</abstract_fa>
	<abstract></abstract>
	<keyword_fa>تولید کارگاهی انعطاف‌پذیر ، ماشینهای موازی، مدلسازی ریاضی، الگوریتمهای ابتکاری</keyword_fa>
	<keyword>Flexible Job Shop, Parallel Machines, Mathematical Modeling, Heuristic Algorithms</keyword>
	<start_page>11</start_page>
	<end_page>21</end_page>
	<web_url>http://ijiepm.iust.ac.ir/browse.php?a_code=A-10-1-101&amp;slc_lang=fa&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>S. H. </first_name>
	<middle_name></middle_name>
	<last_name>Zegordi</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>zegordi@modares.ac.ir .</email>
	<code>180031947532846001354</code>
	<orcid>180031947532846001354</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>  M.A. </first_name>
	<middle_name></middle_name>
	<last_name>BeheshtiNia   </last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>beheshtinia@modares.ac.i</email>
	<code>180031947532846001421</code>
	<orcid>180031947532846001421</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>N. </first_name>
	<middle_name></middle_name>
	<last_name>Jafari Hajagha</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>n_jafari@modares.ac.ir </email>
	<code>180031947532846001422</code>
	<orcid>180031947532846001422</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
