Add to ORKGA new for the classical scheduling theory approach to solving distribution problems is offered. The approach is based on the introduction of the concepts of distribution matrices, estimate criteria of their properties and a developed algorithm of their enhancing transformations. The method named ‘selective-permutational’, as it is based on the selection and permutation of the perspective column elements of the distribution matrices, is formulated. Several examples are given
Abstract The purpose of this paper is to establish some guidelines for designing effective Estimatio...
The main idea in this paper is using sequential pattern mining to find the information which is help...
Permutation problems are combinatorial optimization problems whose solutions are naturally codified ...
A new for the classical scheduling theory approach to solving distribution problems is offered. The ...
AbstractA general model is proposed for the stochastic version of the single-machine allocation prob...
Abstract. In order to sequence the tasks of a job shop problem (JSP) on a number of machines related...
An algorithm for generating permutation distribution of ranks in a k-sample experiment is presented....
. In order to sequence the tasks of a job shop problem (JSP) on a number of machines related to the ...
The problem on improving precision properties of the fast approx imate algorithms without sacrifice ...
International audienceThis chapter presents the “group of permutable jobs” structure to represent se...
Abstract — Heterogeneity has been considered in scheduling, but without considering the temporal var...
Abstract The purpose of this paper is to establish some guidelines for designing effective Estimatio...
The main idea in this paper is using sequential pattern mining to find the information which is help...
Permutation problems are combinatorial optimization problems whose solutions are naturally codified ...
A new for the classical scheduling theory approach to solving distribution problems is offered. The ...
AbstractA general model is proposed for the stochastic version of the single-machine allocation prob...
Abstract. In order to sequence the tasks of a job shop problem (JSP) on a number of machines related...
An algorithm for generating permutation distribution of ranks in a k-sample experiment is presented....
. In order to sequence the tasks of a job shop problem (JSP) on a number of machines related to the ...
The problem on improving precision properties of the fast approx imate algorithms without sacrifice ...
International audienceThis chapter presents the “group of permutable jobs” structure to represent se...
Abstract — Heterogeneity has been considered in scheduling, but without considering the temporal var...
Abstract The purpose of this paper is to establish some guidelines for designing effective Estimatio...
The main idea in this paper is using sequential pattern mining to find the information which is help...
Permutation problems are combinatorial optimization problems whose solutions are naturally codified ...