<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Shahid Beheshti University</PublisherName>
				<JournalTitle>Journal of Industrial Management Perspective</JournalTitle>
				<Issn>2251-9874</Issn>
				<Volume>8</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2018</Year>
					<Month>05</Month>
					<Day>22</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Algorithm for Assembly Flowshops</ArticleTitle>
<VernacularTitle>Algorithm for Assembly Flowshops</VernacularTitle>
			<FirstPage>93</FirstPage>
			<LastPage>111</LastPage>
			<ELocationID EIdType="pii">87181</ELocationID>
			
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>Habib Reza</FirstName>
					<LastName>Gholami</LastName>
<Affiliation>PhD student, Islamic Azad University, Qazvin.</Affiliation>

</Author>
<Author>
					<FirstName>Esmaeil</FirstName>
					<LastName>Mehdizadeh</LastName>
<Affiliation>Associate Professor, Islamic Azad University, Qazvin.</Affiliation>

</Author>
<Author>
					<FirstName>Bahman</FirstName>
					<LastName>Naderi</LastName>
<Affiliation>Associate Professor, Kharazmi University.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2019</Year>
					<Month>09</Month>
					<Day>19</Day>
				</PubDate>
			</History>
		<Abstract>Assembly flowshop with setup times is one of the newset production scheduling problems. In this problem, parts in the first stage that is a flow shop system are produced. Then, in the second stage, they are assembled. The objective is to sequence the parts production and assembly to minimize makespan. There is not an effective mathematical model for this problem. This paper first reviews the available model and then proposes a mixed integer linear programming model. To solve the model, it proposes two metaheuristics, imperialist competitive and genetic algorithms. Finally, the performance of the model and algorithms are evaluated, and the results show that imperialist competitive algorithm performs well.</Abstract>
			<OtherAbstract Language="FA">Assembly flowshop with setup times is one of the newset production scheduling problems. In this problem, parts in the first stage that is a flow shop system are produced. Then, in the second stage, they are assembled. The objective is to sequence the parts production and assembly to minimize makespan. There is not an effective mathematical model for this problem. This paper first reviews the available model and then proposes a mixed integer linear programming model. To solve the model, it proposes two metaheuristics, imperialist competitive and genetic algorithms. Finally, the performance of the model and algorithms are evaluated, and the results show that imperialist competitive algorithm performs well.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Mixed Integer Linear Programming</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Assembly Flow Shops</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Setup Times</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Imperialist Competitive Algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Genetic algorithm</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jimp.sbu.ac.ir/article_87181_3a681b1a8b31649569cb6177dabe5ab0.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
