Temat: job scheduling - 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ł

Skocz do pozycji: 2.

Tytuł:: Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach
Autorzy:: Bougloula, Aimade Eddine
Powiązania:: https://bibliotekanauki.pl/articles/24200517.pdf
Data publikacji:: 2023
Wydawca:: Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:: scheduling
optimization
scheduling problem
job shop
no-wait problem
Jaya algorithm
Opis:: This work is interested to optimize the job shop scheduling problem with a no wait constraint. This constraint occurs when two consecutive operations in a job must be processed without any waiting time either on or between machines. The no wait job shop scheduling problem is a combinatorial optimization problem. Therefore, the study presented here is focused on solving this problem by proposing strategy for making Jaya algorithm applicable for handling optimization of this type of problems and to find processing sequence that minimizes the makespan (Cmax). Several benchmarks are used to analyze the performance of this algorithm compared to the best-known solutions.
Źródło:: Management and Production Engineering Review; 2023, 14, 3; 148--155
2080-8208
2082-1344
Pojawia się w:: Management and Production Engineering Review
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Firefly algorithm applied to the job-shop scheduling problem
Autorzy:: Świtalski, Piotr
Bolesta, Arkadiusz
Powiązania:: https://bibliotekanauki.pl/articles/2052416.pdf
Data publikacji:: 2021
Wydawca:: Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:: scheduling
job shop
firefly algorithm
aitoa library
Opis:: The job shop scheduling problem (JSSP) is one of the most researched scheduling problems. This problem belongs to the NP-hard class. An optimal solution for this category of problems is rarely possible. We try to find suboptimal solutions using heuristics or metaheuristics. The firefly algorithm is a great example of a metaheuristic. In this paper, this algorithm is used to solve JSSP. We used some benchmarking JSSP datasets for experiments. The experimental program was implemented in the aitoa library. We investigated the optimal parameter settings of this algorithm in terms of JSSP. Analysis of the experimental results shows that the algorithm is useful to solve scheduling problems.
Źródło:: Studia Informatica : systems and information technology; 2021, 1-2(25); 87-100
1731-2264
Pojawia się w:: Studia Informatica : systems and information technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Cyclic flow shop scheduling problem with two-machine cells
Autorzy:: Bożejko, W.
Gnatowski, A.
Idzikowski, R.
Wodecki, M.
Powiązania:: https://bibliotekanauki.pl/articles/229393.pdf
Data publikacji:: 2017
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: job shop
cyclic scheduling
multi-machine
assignment
Opis:: In the paper a variant of cyclic production with setups and two-machine cell is considered. One of the stages of the problem solving consists of assigning each operation to the machine on which it will be carried out. The total number of such assignments is exponential. We propose a polynomial time algorithm finding the optimal operations to machines assignment.
Źródło:: Archives of Control Sciences; 2017, 27, 2; 151-167
1230-2384
Pojawia się w:: Archives of Control Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja