<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Journal title</title>
<title_fa>عنوان نشریه</title_fa>
<short_title>International Journal of Supply and Operations Management</short_title>
<subject>Literature &amp; Humanities</subject>
<web_url>http://system.khu.ac.ir/ijsom</web_url>
<journal_hbi_system_id>1</journal_hbi_system_id>
<journal_hbi_system_user>admin</journal_hbi_system_user>
<journal_id_issn></journal_id_issn>
<journal_id_issn_online></journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_doi>doi</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>1394</year>
	<month>8</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2015</year>
	<month>11</month>
	<day>1</day>
</pubdate>
<volume>2</volume>
<number>3</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>An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation</title_fa>
	<title>An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation</title>
	<subject_fa></subject_fa>
	<subject></subject>
	<content_type_fa>Research Paper</content_type_fa>
	<content_type>مقاله پژوهشی</content_type>
	<abstract_fa>In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In this paper, a simple, efficient fitness function is proposed which has better performance compared to the other fitness functions in the literature. Defining a new mutation operator for ML is the other contribution of the current study. Comparing the results of the proposed GA with other approaches using the well-known benchmark sets in PSPLIB validates the effectiveness of the proposed algorithm to solve the MRCPSP.</abstract_fa>
	<abstract>In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In this paper, a simple, efficient fitness function is proposed which has better performance compared to the other fitness functions in the literature. Defining a new mutation operator for ML is the other contribution of the current study. Comparing the results of the proposed GA with other approaches using the well-known benchmark sets in PSPLIB validates the effectiveness of the proposed algorithm to solve the MRCPSP.</abstract>
	<keyword_fa>Combinatorial Optimization , Multi-mode project scheduling , Resource constraints , Genetic Algorithm , Random key representation , </keyword_fa>
	<keyword>Combinatorial Optimization , Multi-mode project scheduling , Resource constraints , Genetic Algorithm , Random key representation , </keyword>
	<start_page>905</start_page>
	<end_page>924</end_page>
	<web_url>http://system.khu.ac.ir/ijsom/browse.php?a_code=A-10-496-1&amp;slc_lang=fa&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Mohammad Hassan</first_name>
	<middle_name></middle_name>
	<last_name>Sebt</last_name>
	<suffix></suffix>
	<first_name_fa>Mohammad Hassan</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Sebt</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>sebt@aut.ac.ir</email>
	<code>1003194753284600189</code>
	<orcid>1003194753284600189</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Amirkabir University of Technology, Tehran, Iran</affiliation>
	<affiliation_fa>Amirkabir University of Technology, Tehran, Iran</affiliation_fa>
	 </author>


	<author>
	<first_name>Mohammad Reza</first_name>
	<middle_name></middle_name>
	<last_name>Afshar</last_name>
	<suffix></suffix>
	<first_name_fa>Mohammad Reza</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Afshar</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>m.afshar67@aut.ac.ir</email>
	<code>1003194753284600190</code>
	<orcid>1003194753284600190</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Amirkabir University of Technology, Tehran, Iran</affiliation>
	<affiliation_fa>Amirkabir University of Technology, Tehran, Iran</affiliation_fa>
	 </author>


	<author>
	<first_name>Yagub</first_name>
	<middle_name></middle_name>
	<last_name>Alipouri</last_name>
	<suffix></suffix>
	<first_name_fa>Yagub</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Alipouri</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>yalipouri@aut.ac.ir</email>
	<code>1003194753284600191</code>
	<orcid>1003194753284600191</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Amirkabir University of Technology, Tehran, Iran</affiliation>
	<affiliation_fa>Amirkabir University of Technology, Tehran, Iran</affiliation_fa>
	 </author>


</author_list>


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