<?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>University of Tehran Press</PublisherName>
				<JournalTitle>Advances in Industrial Engineering</JournalTitle>
				<Issn>2783-1744</Issn>
				<Volume>48</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2014</Year>
					<Month>09</Month>
					<Day>23</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Bi-objective Model for a Flowshop Scheduling Problem with Availability Constraint of Machines</ArticleTitle>
<VernacularTitle>ارائة مدل دوهدفه برای مسئلة زمان‌بندی جریان کارگاهی با محدودیت دسترسی به ماشین‌ها</VernacularTitle>
			<FirstPage>189</FirstPage>
			<LastPage>200</LastPage>
			<ELocationID EIdType="pii">52913</ELocationID>
			
<ELocationID EIdType="doi">10.22059/jieng.2014.52913</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mohammad</FirstName>
					<LastName>Rezaei Malek</LastName>
<Affiliation></Affiliation>

</Author>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Tavakkoli Moghaddam</LastName>
<Affiliation></Affiliation>

</Author>
<Author>
					<FirstName>Farshid</FirstName>
					<LastName>Evaz Abadian</LastName>
<Affiliation></Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2013</Year>
					<Month>07</Month>
					<Day>20</Day>
				</PubDate>
			</History>
		<Abstract> This paper presents a new bi-objective mathematical model for a permutation flowshop scheduling problem with availability constraint in case of preventive maintenance operations on machines. In this paper, preventive maintenance is flexible and there is not a certain time for the maintenance operation; however, time between two consecutive maintenance operations for each machine should not be greater than a given time. The model has two objectives; (1) minimizing the makespan (i.e., &lt;em&gt;C&lt;sub&gt;max&lt;/sub&gt;&lt;/em&gt;) and, (2) minimizing the sum of earliness and tardiness simultaneously. This study reports the results obtained by the Reservation Level Tchebycheff Procedure (RLTP) and the &lt;em&gt;ε&lt;/em&gt;-constraint method for solving a case study problem. The results show high quality of reached solutions from RLTP in comparison with the &lt;em&gt;ε&lt;/em&gt;-constraint method.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Permutation flowshop scheduling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Preventive maintenance</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Earliness and tardiness</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Cmax</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Bi-objective optimization</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://aie.ut.ac.ir/article_52913_e45b32259e066802d748902278f0fbaa.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
