Temat: Jobs - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Multi-machine scheduling problem with setup times
Autorzy:: Bożejko, W.
Uchroński, M.
Wodecki, M.
Powiązania:: https://bibliotekanauki.pl/articles/229357.pdf
Data publikacji:: 2012
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: jobs scheduling
block properties
discrete optimization
Opis:: In this paper we consider a multi-machine scheduling problem with setup times, which is determined in the literature as the flexible job shop problem. It belongs to the strongly NP-complete complexity class. We propose an algorithm based on the tabu search method. The new elimination criteria were used in the construction process of blocks of the critical path.
Źródło:: Archives of Control Sciences; 2012, 22, 4; 441-449
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ł

Informacja