برنامه ریزی چرخه موازی با استفاده از الگوریتم تابو سرچ
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