<?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>Shahid Beheshti University</PublisherName>
				<JournalTitle>Journal of Industrial Management Perspective</JournalTitle>
				<Issn>2251-9874</Issn>
				<Volume>5</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2016</Year>
					<Month>02</Month>
					<Day>20</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Multi-Mode Resource Constrained Multi-Project Selecting and Scheduling Problem to Maximize Net Present Value</ArticleTitle>
<VernacularTitle>Multi-Mode Resource Constrained Multi-Project Selecting and Scheduling Problem to Maximize Net Present Value</VernacularTitle>
			<FirstPage>79</FirstPage>
			<LastPage>100</LastPage>
			<ELocationID EIdType="pii">87244</ELocationID>
			
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>Omid</FirstName>
					<LastName>Movahedian Attar</LastName>
<Affiliation>MSc. Student, Isfahan University.</Affiliation>

</Author>
<Author>
					<FirstName>Majid</FirstName>
					<LastName>Esmaelian</LastName>
<Affiliation>Assistant Professor, Isfahan University.</Affiliation>

</Author>
<Author>
					<FirstName>Dariush</FirstName>
					<LastName>Mohammadi Zanjirani</LastName>
<Affiliation>Assistant Professor, Isfahan University.</Affiliation>
<Identifier Source="ORCID">0000-0002-2987-6765</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2019</Year>
					<Month>09</Month>
					<Day>24</Day>
				</PubDate>
			</History>
		<Abstract>In this article, with the aim of maximizing net present value and considering various ways of the payment, the problem of selecting and scheduling several projects using mathematical programming and constraint programming have been investigated, in a way that the project feasibility with regards to the level of available resources is guaranteed and all of the prerequisite relationships are observed. Activities with the different modes of resources can be done. They uses renewable (human resources, equipment) and non-renewable (raw materials, budgets) resources. In calculating the costs, the overtime cost of renewable resources, late penalties or rewards of delivery before the project due date is considered. Created Models are tested by a number of projects from the PSPLIB libraries.</Abstract>
			<OtherAbstract Language="FA">In this article, with the aim of maximizing net present value and considering various ways of the payment, the problem of selecting and scheduling several projects using mathematical programming and constraint programming have been investigated, in a way that the project feasibility with regards to the level of available resources is guaranteed and all of the prerequisite relationships are observed. Activities with the different modes of resources can be done. They uses renewable (human resources, equipment) and non-renewable (raw materials, budgets) resources. In calculating the costs, the overtime cost of renewable resources, late penalties or rewards of delivery before the project due date is considered. Created Models are tested by a number of projects from the PSPLIB libraries.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Constraint Programming</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Mathematical Modeling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Net Present Value</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Project Scheduling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Project Selection</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jimp.sbu.ac.ir/article_87244_4d85c4fbd9735e5835715f890beccd20.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
