<?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>16</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2009</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Concurrent Project Scheduling and Material Planning: A Genetic Algorithm Approach</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">3289</ELocationID>
			
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>F.</FirstName>
					<LastName>Hassanzadeh</LastName>
<Affiliation>Department of Computer Engineering,Ferdowsi University of Mashhad</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Sheikh Sajadieh</LastName>
<Affiliation>Department of Industrial Engineering,Sharif University of Technology</Affiliation>

</Author>
<Author>
					<FirstName>S.</FirstName>
					<LastName>Shadrokh</LastName>
<Affiliation>-------,Azad University</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2010</Year>
					<Month>05</Month>
					<Day>12</Day>
				</PubDate>
			</History>
		<Abstract>Scheduling projects incorporated with materials ordering results in a more realistic
problem. This paper deals with the combined problem of project scheduling and material ordering. The
purpose of this paper is to minimize the total cost of this problem by determining the optimal values
of activity duration, activity nish time and the material ordering schedule subject to constraints. We
employ a genetic algorithm approach to solve it. Elements of the algorithm, such as chromosome
structure, untness function, crossover, mutation and local search operations are explained. The results
of the experimentation are quite satisfactory.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Project scheduling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Genetic Algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Material ordering</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_3289_72ee52614bd0be61c2aa5a5e5ec6006f.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
