<?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 Sistan and Baluchestan</PublisherName>
				<JournalTitle>Iranian Journal of Fuzzy Systems</JournalTitle>
				<Issn>1735-0654</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>10</Month>
					<Day>17</Day>
				</PubDate>
			</Journal>
<ArticleTitle>An interactive algorithm for linear assignment problem on fuzzy graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>18</LastPage>
			<ELocationID EIdType="pii">10245</ELocationID>
			
<ELocationID EIdType="doi">10.22111/ijfs.2026.54652.9680</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>J.</FirstName>
					<LastName>Tayyebi</LastName>
<Affiliation>Department of Industrial Engineering, Birjand University of Technology, Birjand, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>E.</FirstName>
					<LastName>Hosseinzade</LastName>
<Affiliation>Department of Mathematics, Kowsar University, Bojnord, Iran</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Niksirat</LastName>
<Affiliation>Department of Computer Science, Faculty of Industrial and Computer Engineering, Birjand University of Technology, Birjand, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2026</Year>
					<Month>02</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<Abstract>The assignment problem is a foundational combinatorial optimization problem that requires a decision maker to allocate agents to tasks in order to minimize the total cost incurred. From a graph-theoretic perspective, this problem can be framed as a matching problem on a bipartite graph. This paper presents a natural extension of the traditional assignment  problem by considering fuzzy graphs as the underlying framework. This extension proves significant in practical situations where expert opinions contribute to assessing the relative significance level of agents (or tasks) and the satisfaction levels associated with different assignments. The main goal for the decision maker is not just to minimize costs but also to  consider expert opinions. This paper addresses this problem by first formulating it as a tri-objective optimization  problem. Subsequently, the ϵ-constraint method is applied to propose an interactive algorithm designed to identify  satisfactory solutions. Finally, a practical example of assigning teachers to schools is provided to demonstrate the  algorithm in a real-world application. </Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Assignment problem, combinatorial optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Fuzzy graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">significance level</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">satisfaction level</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">ϵ-constraint method</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">interactive algorithm</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijfs.usb.ac.ir/article_10245_393770c2566853fcb080268d9608f84a.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
