<?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>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>32</Volume>
				<Issue>12</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Zoning constrained machine layout problem with mutual clearances</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">24059</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2022.57877.5453</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Zeynep</FirstName>
					<LastName>Uruk</LastName>
<Affiliation>Department of Industrial Engineering, Sakarya University, Sakarya, Turkey.</Affiliation>

</Author>
<Author>
					<FirstName>Nevra</FirstName>
					<LastName>Kazanci</LastName>
<Affiliation>Department of Industrial Engineering, Sakarya University, Sakarya, Turkey.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>03</Month>
					<Day>16</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, a single row machine layout problem is considered with zoning constraints and mutual clearances under an enhanced objective of minimizing material flow cost and machine installation cost. The problem is restricted by positive and negative zoning constraints to represent real-life problems. Moreover, the clearances needed between machine pairs are divided into two types, which are must and extra clearances. Extra clearances are reduced through mutual use between adjacent machines to decrease material flow costs. Objective function also considers fixed costs of locating machines which usually neglected in machine layout problems in literature but a necessity in real-life problems. Two mathematical models, namely nonlinear and linear mixed integer programs, are formulated to solve the problem optimally and to compare the effect of linearity and nonlinearity in mathematical programming formulations in terms of solution quality and time. The mathematical models are not effective in terms of time for large problem instances; therefore, a genetic algorithm is proposed to generate high-quality solutions within a reasonable time. It is shown that the genetic algorithm outperforms both the nonlinear and linear mathematical models with lower cost and shorter time.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Restricted single row machine layout problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Zoning constraints</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Mutual clearances</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Machine installation cost</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Flexible Manufacturing Systems (FMS)</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_24059_600d5fa630e5a8f78ef25121dc136a20.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
