<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Iranian Journal of Operations Research</title>
<title_fa>مجله انجمن ایرانی تحقیق در عملیات</title_fa>
<short_title>IJOR</short_title>
<subject>Basic Sciences</subject>
<web_url>http://iors.ir/journal</web_url>
<journal_hbi_system_id>0</journal_hbi_system_id>
<journal_hbi_system_user>user</journal_hbi_system_user>
<journal_id_issn>2008-1189</journal_id_issn>
<journal_id_issn_online></journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_doi>10.29252/iors</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid></journal_id_sid>
<journal_id_nlai></journal_id_nlai>
<journal_id_science></journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1397</year>
	<month>4</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2018</year>
	<month>7</month>
	<day>1</day>
</pubdate>
<volume>9</volume>
<number>1</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>fa</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>Assigning independent resources to fire stations to minimize the influence of the shortage</title>
	<subject_fa>Mathematical Modeling and Applications of OR</subject_fa>
	<subject>Mathematical Modeling and Applications of OR</subject>
	<content_type_fa>پژوهشی</content_type_fa>
	<content_type>Original</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;em&gt;A new integer program is presented to model an independent resources assignment problem with resource shortages in the context of municipal fire service. When shortage in resources exists, a critical task for fire department&amp;#39;s administrator in a city is to assign the available resources to the fire stations such that the effect of the shortage to cover (in providing service, in extinguishing fire and so on) is minimized. To solve the problem, we propose a polynomial time greedy algorithm. &lt;/em&gt;</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Resource assignment problem, Integer programming, Fire stations, Shortage, 
Greedy algorithm</keyword>
	<start_page>77</start_page>
	<end_page>83</end_page>
	<web_url>http://iors.ir/journal/browse.php?a_code=A-10-1422-5&amp;slc_lang=fa&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Reza</first_name>
	<middle_name></middle_name>
	<last_name>Ghanbari</last_name>
	<suffix></suffix>
	<first_name_fa>رضا</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>قنبری</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>rghanbari@um.ac.ir</email>
	<code>1111111111</code>
	<orcid>1111111111</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Ferdowsi University of Mashhad, Mashhad</affiliation>
	<affiliation_fa>دانشگاه فردوسی مشهد</affiliation_fa>
	 </author>


	<author>
	<first_name>Effat</first_name>
	<middle_name></middle_name>
	<last_name>Sadat Alavi</last_name>
	<suffix></suffix>
	<first_name_fa>عفت السادات</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>علوی</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>rghanbari@um.ac.ir</email>
	<code>1111111111</code>
	<orcid>1111111111</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Ferdowsi University of Mashhad, Mashhad</affiliation>
	<affiliation_fa>دانشگاه فردوسی مشهد</affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
