Temat: parallel algorithm - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Parallel patterns determination in solving cyclic flow shop problem with setups
Autorzy:: Bożejko, W.
Chaczko, Z.
Uchroński, M.
Wodecki, M.
Powiązania:: https://bibliotekanauki.pl/articles/229926.pdf
Data publikacji:: 2017
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: cyclic scheduling
parallel algorithm
metaheuristics
Opis:: The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP). We propose to take advantage of the Intel Xeon Phi parallel computing environment during so-called ’blocks’ determination basing on patterns, in effect significantly improving the quality of obtained results.
Źródło:: Archives of Control Sciences; 2017, 27, 2; 183-195
1230-2384
Pojawia się w:: Archives of Control Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Flexible job shop problem - parallel tabu search algorithm for multi-GPU
Autorzy:: Bożejko, W.
Uchroński, M.
Wodecki, M.
Powiązania:: https://bibliotekanauki.pl/articles/229502.pdf
Data publikacji:: 2012
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: jobs scheduling
flexible manufacturing
parallel algorithm
discrete optimization
Opis:: In the paper we propose a new framework for the distributed tabu search algorithm designed to be executed with the use of a multi-GPU cluster, in which cluster of nodes are equipped with multicore GPU computing units. The proposed methodology is designed specially to solve difficult discrete optimization problems, such as a flexible job shop scheduling problem, which we introduce as a case study used to analyze the efficiency of the designed synchronous algorithm.
Źródło:: Archives of Control Sciences; 2012, 22, 4; 389-397
1230-2384
Pojawia się w:: Archives of Control Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Blocks for two-machines total weighted tardiness flow shop scheduling problem
Autorzy:: Bożejko, W.
Uchroński, M.
Wodecki, M.
Powiązania:: https://bibliotekanauki.pl/articles/202179.pdf
Data publikacji:: 2020
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: flow shop
two machine
due date
minimal costs
blocks of tasks
parallel algorithm
Opis:: The paper discusses a two-machine flow shop problem with minimization of the sum of tardiness costs, being a a generalization of the popular NP-hard single-machine problem with this criterion. We propose the introduction of new elimination block properties allowing for accelerating the operation of approximate algorithms of local searches, solving this problem and improving the quality of solutions determined by them.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 1; 31-41
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja