<?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>Shahed University</PublisherName>
				<JournalTitle>Journal of Quality Engineering and Production Optimization</JournalTitle>
				<Issn></Issn>
				<Volume>2</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2017</Year>
					<Month>06</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A new approach in graph- based integrated production and distribution scheduling for perishable products</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>65</FirstPage>
			<LastPage>76</LastPage>
			<ELocationID EIdType="pii">462</ELocationID>
			
<ELocationID EIdType="doi">10.22070/jqepo.2017.1858.1040</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Fateme</FirstName>
					<LastName>Marandi</LastName>
<Affiliation>amirkabir university</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>08</Month>
					<Day>06</Day>
				</PubDate>
			</History>
		<Abstract>&lt;em&gt;This study is concerned with how the quality of perishable products can be improved by shortening the time interval between production and distribution. As special types of food such as dairy products decay fast, the integration of production and distribution scheduling (IPDS) is investigated. An integrated scheduling of both processes improves the performance and costs because the separated scheduling of these processes without considering mutual requirements leads to non-optimal solutions. &lt;/em&gt;&lt;em&gt;An optimal solution to &lt;/em&gt;&lt;em&gt;IPDS&lt;/em&gt;&lt;em&gt; requires simultaneously solving of the production scheduling and vehicle routing problems. &lt;/em&gt;&lt;em&gt;This article deals with&lt;/em&gt;&lt;em&gt; a variation of IPDS that contains a short shelf-life product; hence, there is no inventory of the product in the process. Once an amount of products is produced, they must be transported with non-negligible transportation time directly to various customer locations. The objective is to determine the minimum cost of the makespan and number of vehicles required to complete the distribution of the products to satisfy the demand of a given set of customers over a wide geographic region. The overall problem consists of&lt;/em&gt;&lt;em&gt; permutation flow shop scheduling with&lt;/em&gt;&lt;em&gt; machines, &lt;/em&gt; &lt;em&gt; jobs and vehicles with different speeds and transportation capacities which transport &lt;/em&gt; &lt;em&gt; jobs from the manufacturing company to &lt;/em&gt; &lt;em&gt; customers distributed in various zones by determining the vehicle routes and number of vehicles. After developing a&lt;/em&gt;&lt;em&gt;n Integer Linear Programming (ILP) model of the problem, because it is NP-hard, a new graph-based heuristic method is proposed to efficiently solve the problem.&lt;/em&gt;</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Production and distribution</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Permutation flow ‌shop scheduling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Vehicle routing problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Integration</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Graph-based scheduling</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jqepo.shahed.ac.ir/article_462_51d92be1c60d1db1d2e5e7a07da55b26.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
