<?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>Isfahan University of Technology</PublisherName>
				<JournalTitle>Journal of Computational Methods in Engineering</JournalTitle>
				<Issn>2228-7698</Issn>
				<Volume>26</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2022</Year>
					<Month>12</Month>
					<Day>31</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Batch Scheduling in Flexible Flow Shop</ArticleTitle>
<VernacularTitle>Batch Scheduling in Flexible Flow Shop</VernacularTitle>
			<FirstPage>41</FirstPage>
			<LastPage>52</LastPage>
			<ELocationID EIdType="pii">2987</ELocationID>
			
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName></FirstName>
					<LastName>M.R. Amin Naseri</LastName>
<Affiliation></Affiliation>

</Author>
<Author>
					<FirstName></FirstName>
					<LastName>I. Nakhaee</LastName>
<Affiliation></Affiliation>

</Author>
<Author>
					<FirstName></FirstName>
					<LastName>And M. A. Beheshti Nia</LastName>
<Affiliation></Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>12</Month>
					<Day>31</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it is shown that the problem is NP-Hard. Three heuristics will then be developed to solve the problem and a lower bound is also developed for evaluating the performance of the proposed heuristics. Results show that heuristic H3 gives better results compared to the others.</Abstract>
			<OtherAbstract Language="FA">In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it is shown that the problem is NP-Hard. Three heuristics will then be developed to solve the problem and a lower bound is also developed for evaluating the performance of the proposed heuristics. Results show that heuristic H3 gives better results compared to the others.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Scheduling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Flexible flow shop</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Sequencing</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Batch</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Heuristics</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jcme.iut.ac.ir/article_2987_ae1d2c2d957a01dcb3f3b39685cdb4fa.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
