<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>جدیدترین مقاله رشته مهندسی صنایع &#8211; پی اچ دی یار</title>
	<atom:link href="https://phdyar.ir/tag/%D8%AC%D8%AF%DB%8C%D8%AF%D8%AA%D8%B1%DB%8C%D9%86-%D9%85%D9%82%D8%A7%D9%84%D9%87-%D8%B1%D8%B4%D8%AA%D9%87-%D9%85%D9%87%D9%86%D8%AF%D8%B3%DB%8C-%D8%B5%D9%86%D8%A7%DB%8C%D8%B9/feed/" rel="self" type="application/rss+xml" />
	<link>https://phdyar.ir</link>
	<description>مرجع اخبار دکتری و کارشناسی ارشد</description>
	<lastBuildDate>Tue, 25 Sep 2018 21:02:06 +0000</lastBuildDate>
	<language>fa-IR</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.2.6</generator>

<image>
	<url>https://phdyar.ir/wp-content/uploads/2017/05/cropped-logo-2-32x32.png</url>
	<title>جدیدترین مقاله رشته مهندسی صنایع &#8211; پی اچ دی یار</title>
	<link>https://phdyar.ir</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>Optimized rescheduling of multiple production lines for flowshop production of reinforced precast concrete components</title>
		<link>https://phdyar.ir/optimized-rescheduling-multiple-lines/</link>
					<comments>https://phdyar.ir/optimized-rescheduling-multiple-lines/#respond</comments>
		
		<dc:creator><![CDATA[admin]]></dc:creator>
		<pubDate>Tue, 25 Sep 2018 21:02:06 +0000</pubDate>
				<category><![CDATA[مقالات علمی بروز]]></category>
		<category><![CDATA[مهندسی صنایع]]></category>
		<category><![CDATA[flowshop]]></category>
		<category><![CDATA[بروزترین مقالات ژورنالی]]></category>
		<category><![CDATA[جدیدترین مقاله رشته مهندسی صنایع]]></category>
		<category><![CDATA[حل مسئله flowshop]]></category>
		<category><![CDATA[دانلود جدیدترین مقالات مهندسی صنایع]]></category>
		<category><![CDATA[دانلود مقالات مهندسی صنایع]]></category>
		<category><![CDATA[مقالات ژورنالی]]></category>
		<guid isPermaLink="false">https://www.phdyar.ir/?p=4065</guid>

					<description><![CDATA[بازبینی بهینه شده از خطوط تولید چندگانه برای تولید جریان از قطعات بتنی تقویت شده بتن Flowshop production is adopted as the major type of production of reinforced precast concrete components and it has higher requirements on shop floor schedules than other types, especially that from rescheduling. However, up to now, very few approach for &#8230;]]></description>
										<content:encoded><![CDATA[<h1 style="text-align: center;"><span style="font-size: 14pt;"><strong><span id="result_box" class="" lang="fa" style="color: #000000;"><span class="">بازبینی بهینه شده از خطوط تولید چندگانه برای تولید جریان از قطعات بتنی تقویت شده بتن</span></span></strong></span></h1>
<p style="text-align: justify;">
<div id="as0005" style="text-align: justify;">
<p id="sp0135"><span style="font-size: 12pt; color: #000000;">Flowshop production is adopted as the major type of production of reinforced precast concrete components and it has higher requirements on shop floor schedules than other types, especially that from rescheduling. However, up to now, very few approach for the optimization of the shop floor rescheduling has been proposed in spite of its vital importance. This research proposes an approach for optimizing shop floor rescheduling of multiple production lines for flowshop production of reinforced precast concrete components. The approach comprehensively utilizes the over-assigned time, which is the difference value between the assigned production time and the estimated one of a production step for a precast component to deal with production emergencies. Meanwhile, it keeps the adjustment of schedules at minimum to avoid massive material re-dispatch. First of all, the optimization objectives and constraints of optimized shop floor rescheduling of multiple production lines for flowshop precast production are analyzed and a mathematic model is thus formulated. Then, the solver of the model is established by using genetic algorithm. Finally, the approach is validated by case studies. It is concluded that the approach contributes to the effective and efficient optimized rescheduling of multiple production lines for flowshop precast production.</span></p>
</div>
<p style="text-align: justify;">
<p>&nbsp;</p>
<p style="text-align: justify;"><span style="font-size: 12pt; color: #000000;"><strong>نویسندگان</strong>: Zhiliang Ma, Zhitian Yang, ShilongLiu, Song Wu</span></p>
<p style="text-align: justify;"><span style="font-size: 12pt; color: #000000;"><strong>ژورنال</strong>: Automation in Construction</span></p>
<p style="text-align: justify;"><span style="font-size: 12pt; color: #000000;"><strong>سال انتشار</strong>: 2018</span></p>
<p>&nbsp;</p>
<p>&nbsp;</p>
<p><span style="font-size: 12pt; color: #000000;"><strong>دانلود مقاله</strong>:</span></p>
<p style="text-align: center;"><span style="font-size: 12pt;"><a href="https://www.phdyar.ir/wp-content/uploads/2018/09/Optimized-rescheduling-of-multiple-production-lines-for-flowshop-production-of-reinforced-precast-concrete-components.pdf"><span style="color: #000000;">https://www.phdyar.ir/wp-content/uploads/2018/09/Optimized-rescheduling-of-multiple-production-lines-for-flowshop-production-of-reinforced-precast-concrete-components.pdf</span></a></span></p>
<p>&nbsp;</p>
]]></content:encoded>
					
					<wfw:commentRss>https://phdyar.ir/optimized-rescheduling-multiple-lines/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Parallel tabu search for the cyclic jobshop scheduling problem</title>
		<link>https://phdyar.ir/parallel-tabu-search-for-the-cyclic-jobshop-scheduling-problem/</link>
					<comments>https://phdyar.ir/parallel-tabu-search-for-the-cyclic-jobshop-scheduling-problem/#respond</comments>
		
		<dc:creator><![CDATA[admin]]></dc:creator>
		<pubDate>Tue, 04 Sep 2018 07:05:35 +0000</pubDate>
				<category><![CDATA[مقالات علمی بروز]]></category>
		<category><![CDATA[مهندسی صنایع]]></category>
		<category><![CDATA[flowshop]]></category>
		<category><![CDATA[jobshop]]></category>
		<category><![CDATA[الگوریتم تابو سرچ]]></category>
		<category><![CDATA[جدیدترین مقالات علمی]]></category>
		<category><![CDATA[جدیدترین مقاله رشته مهندسی صنایع]]></category>
		<category><![CDATA[رشته مهندسی صنایع]]></category>
		<guid isPermaLink="false">https://www.phdyar.ir/?p=3821</guid>

					<description><![CDATA[برنامه ریزی چرخه موازی با استفاده از الگوریتم تابو سرچ چکیده: In this paper, we consider a cyclic jobshop problem, consisting of production of a certain set of elements at fixed intervals. Optimization of the process is reduced to a minimization of a cycle time, i.e. the time, after which the next batch of the &#8230;]]></description>
										<content:encoded><![CDATA[<h1 style="text-align: center;"><strong>برنامه ریزی چرخه موازی با استفاده از الگوریتم تابو سرچ</strong></h1>
<p style="text-align: justify;">
<p style="text-align: justify;"><span style="font-size: 12pt;"><strong>چکیده</strong>:</span></p>
<p style="text-align: justify;"><span style="font-size: 12pt;">In this paper, we consider a cyclic jobshop problem, consisting of production of a certain set of elements at fixed intervals. Optimization of the process is reduced to a minimization of a cycle time, i.e. the time, after which the next batch of the same elements may be produced. We introduce a new parallel method for the cost function calculation. The parallelization is not trivial and cannot be done automatically by the existing compilers due to the recurrent character of formulas. Since the problem is strongly NP-hard, a heuristic algorithm was designed to solve it. Computational experiments were done in a multiprocessor environment, namely – in Intel Xeon Phi.</span></p>
<p>&nbsp;</p>
<p><span style="font-size: 12pt;"><strong>نویسندگان</strong>: Wojciech Bożejkoa, Andrzej Gnatowskia, Jarosław Pemperaa, Mieczysław Wodeckib</span></p>
<p><span style="font-size: 12pt;"><strong>ژورنال</strong>: Computers &amp; Industrial Engineering</span></p>
<p><span style="font-size: 12pt;"><strong>سال انتشار</strong>: 2017 </span></p>
<p>&nbsp;</p>
<p><span style="font-size: 12pt;"><strong>دانلود مقاله: </strong></span></p>
<p style="text-align: center;"><a href="https://www.phdyar.ir/wp-content/uploads/2018/09/4.pdf">https://www.phdyar.ir/wp-content/uploads/2018/09/4.pdf</a></p>
]]></content:encoded>
					
					<wfw:commentRss>https://phdyar.ir/parallel-tabu-search-for-the-cyclic-jobshop-scheduling-problem/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
