jobshop – پی اچ دی یار https://phdyar.ir مرجع اخبار دکتری و کارشناسی ارشد Tue, 04 Sep 2018 07:05:35 +0000 fa-IR hourly 1 https://wordpress.org/?v=6.7.2 https://phdyar.ir/wp-content/uploads/2017/05/cropped-logo-2-32x32.png jobshop – پی اچ دی یار https://phdyar.ir 32 32 Parallel tabu search for the cyclic jobshop scheduling problem https://phdyar.ir/parallel-tabu-search-for-the-cyclic-jobshop-scheduling-problem/ https://phdyar.ir/parallel-tabu-search-for-the-cyclic-jobshop-scheduling-problem/#respond Tue, 04 Sep 2018 07:05:35 +0000 https://www.phdyar.ir/?p=3821 برنامه ریزی چرخه موازی با استفاده از الگوریتم تابو سرچ

چکیده:

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.

 

نویسندگان: Wojciech Bożejkoa, Andrzej Gnatowskia, Jarosław Pemperaa, Mieczysław Wodeckib

ژورنال: Computers & Industrial Engineering

سال انتشار: 2017

 

دانلود مقاله:

https://www.phdyar.ir/wp-content/uploads/2018/09/4.pdf

]]> https://phdyar.ir/parallel-tabu-search-for-the-cyclic-jobshop-scheduling-problem/feed/ 0