Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  task sequencing
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
Evolutionary algorithms are one of the heuristic techniques used to solve task sequencing problems. An important example of such a problem is the issue of sequencing production tasks. The combinatorial optimization of task sequences allows the minimization of the cost or time of a set of production tasks by reducing the components of these values which are present in the transitions between tasks. This paper aims to analyze the influence of the production nature expressed by a set of production task parameters and a definition of the task transition cost on the effectiveness of the modification of the evolutionary algorithm based on new directed stochastic mutation operators. The research carried out included the influence of the space dimension of the task parameters, the number of levels of the value of the cost function, and a definition of this function. The results obtained allow us to assess the effectiveness of the directed mutation in task sequencing for productions of various natures.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.