<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>International Journal of Applied Operational Research</title>
<title_fa>ژورنال بین المللی پژوهش عملیاتی</title_fa>
<short_title>International Journal of Applied Operational Research - An Open Access Journal</short_title>
<subject>Basic Sciences</subject>
<web_url>http://ijorlu.lahijan.iau.ir</web_url>
<journal_hbi_system_id>1</journal_hbi_system_id>
<journal_hbi_system_user>admin</journal_hbi_system_user>
<journal_id_issn>2251-6867</journal_id_issn>
<journal_id_issn_online>2251-9432</journal_id_issn_online>
<journal_id_pii>8</journal_id_pii>
<journal_id_doi>7</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid>14</journal_id_sid>
<journal_id_nlai>8888</journal_id_nlai>
<journal_id_science>13</journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1390</year>
	<month>8</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2011</year>
	<month>11</month>
	<day>1</day>
</pubdate>
<volume>1</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>Flow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search</title>
	<subject_fa>عمومى</subject_fa>
	<subject>General</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research</content_type>
	<abstract_fa></abstract_fa>
	<abstract>Flow shop scheduling problem with missing operations is studied in this paper. Missing
operations assumption refers to the fact that at least one job does not visit one machine in the
production process. A mixed-binary integer programming model has been presented for this problem
to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the
optimization problem. According to computational experiments on data sets, it is suggested that GA is
a more appropriate method to solve this problem. GA can reach good-quality solutions in short
computational time, and can be used to solve large scale problems effectively. 

Keywords:  Flow Shop Scheduling, Missing Operation, Mixed-Binary Integer Programming, Genetic
Algorithm, Tabu Search.</abstract>
	<keyword_fa></keyword_fa>
	<keyword></keyword>
	<start_page>0</start_page>
	<end_page>0</end_page>
	<web_url>http://ijorlu.lahijan.iau.ir/browse.php?a_code=A-10-1-48&amp;slc_lang=fa&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name></first_name>
	<middle_name></middle_name>
	<last_name>R. Ramezanian</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>Ramezanian@iust.ac.ir</email>
	<code>1003194753284600174</code>
	<orcid>1003194753284600174</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name></first_name>
	<middle_name></middle_name>
	<last_name>M. Saidi-Mehrabad</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></email>
	<code>1003194753284600175</code>
	<orcid>1003194753284600175</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name></first_name>
	<middle_name></middle_name>
	<last_name>D. Rahmani</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></email>
	<code>1003194753284600176</code>
	<orcid>1003194753284600176</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


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