Autor: Bożejko, J. - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A fine-grained parallel algorithm for the cyclic flexible job shop problem
Autorzy:: Bożejko, W.
Pempera, J.
Wodecki, M.
Powiązania:: https://bibliotekanauki.pl/articles/229531.pdf
Data publikacji:: 2017
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: job shop
cyclic scheduling
parallel algorithm
Opis:: In this paper there is considered a flexible job shop problem of operations scheduling. The new, very fast method of determination of cycle time is presented. In the design of heuristic algorithm there was the neighborhood inspired by the game of golf applied. Lower bound of the criterion function was used in the search of the neighborhood.
Źródło:: Archives of Control Sciences; 2017, 27, 2; 169-181
1230-2384
Pojawia się w:: Archives of Control Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Minimal cycle time determination and golf neighborhood generation for the cyclic flexible job shop problem
Autorzy:: Bożejko, W.
Pempera, J.
Wodecki, M.
Powiązania:: https://bibliotekanauki.pl/articles/201984.pdf
Data publikacji:: 2018
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: cyclic scheduling
metaheuristic
discrete optimization
planowanie cykliczne
metaheurystyka
dyskretna optymalizacja
Opis:: In the paper, a problem of scheduling operations in the cyclic flexible job shop system is considered. A new, very fast method of determining the cycle time for any order of tasks on machines is also presented. It is based on the analysis of the paths in the graph representing the examined problem. The theorems concerning specific properties of the graph are proven and used in the construction of the heuristic algorithm searching the solutions space by using the so-called golf neighborhood, which is generated in a way similar to the game of golf, which helps to intensify and diversify calculations. The conducted computational experiments fully confirmed the effectiveness of the proposed method. The proposed methods and properties can be adapted and used in the construction of local search algorithms for solving many other optimization problems.
Źródło:: Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 3; 333-344
0239-7528
Pojawia się w:: Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Algorithm for solving the Discrete-Continuous Inspection Problem
Autorzy:: Grymin, R.
Bożejko, W.
Chaczko, Z.
Pempera, J.
Wodecki, M.
Powiązania:: https://bibliotekanauki.pl/articles/1403679.pdf
Data publikacji:: 2020
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: discrete-continuous optimization
UAV
VTOL
autonomous drone
zero emission
Opis:: The article introduces an innovative approch for the inspection challenge that represents a generalization of the classical Traveling Salesman Problem. Its priciple idea is to visit continuous areas (circles) in a way, that minimizes travelled distance. In practice, the problem can be defined as an issue of scheduling unmanned aerial vehicle which has discrete-continuous nature. In order to solve this problem the use of local search algorithms is proposed.
Źródło:: Archives of Control Sciences; 2020, 30, 4; 653-666
1230-2384
Pojawia się w:: Archives of Control Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Bożejko, J." wg kryterium: Autor

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język