Evolutionary algorithms (EAs) have been successfully applied to scheduling problems. Current improvements towards convergence issues in EAs include incest prevention and multiplicity features. A multiplicity feature allows multiple recombination on multiple parents [7, 8, 9, 10]. The method was successfully applied to multimodal optimization problems. As a consequence of this approach it was detected that all individuals of the final population are much more centred on the optimum. This is an important issue when the application requires provision of multiple alternative near-optimal solutions confronting system dynamics as in production planningEje: Inteligencia Computacional - MetaheurísticasRed de Universidades con Carreras en Informáti...
Evolutionary algorithms (EAs) can be used as optimisation mechanisms. Based on the model of natural ...
This work summarizes results when facing the problem of allocating a number of nonidentical tasks in...
The study of earliness and tardiness penalties in scheduling is a relatively recent area of research...
Evolutionary algorithms (EAs) have been successfully applied to scheduling problems. Current improve...
Scheduling concerns the allocation of limited resources for tasks over time. It is a process of maki...
Over the past few years, a continually increasing number of research efforts have investigated the a...
A job shop can be seen as a multi-operation model where jobs follows fixed routes, but not necessari...
Many researchers have shown interest to solve the job shop scheduling problem (JSSP) applying evolut...
Multiobjective optimization, also known as vector-valued criteria or multicriteria optimization, hav...
Evolutionary Computation is an emergent field, which provides new heuristics to function optimizatio...
This research proposes a method to solve the adaptive, multi-objective job shop scheduling problem. ...
In previous works the ability of CPS-MCPC (an evolutionary, co-operative, population search method w...
Evolutionary computation (EC) has been recently recognized as a research field, which studies a new ...
In an m-machines n-jobs flow-shop sequencing problem each job consists of m operations and each oper...
In evolutionary algorithms selection mechanisms aim to favour reproduction of better individuals imp...
Evolutionary algorithms (EAs) can be used as optimisation mechanisms. Based on the model of natural ...
This work summarizes results when facing the problem of allocating a number of nonidentical tasks in...
The study of earliness and tardiness penalties in scheduling is a relatively recent area of research...
Evolutionary algorithms (EAs) have been successfully applied to scheduling problems. Current improve...
Scheduling concerns the allocation of limited resources for tasks over time. It is a process of maki...
Over the past few years, a continually increasing number of research efforts have investigated the a...
A job shop can be seen as a multi-operation model where jobs follows fixed routes, but not necessari...
Many researchers have shown interest to solve the job shop scheduling problem (JSSP) applying evolut...
Multiobjective optimization, also known as vector-valued criteria or multicriteria optimization, hav...
Evolutionary Computation is an emergent field, which provides new heuristics to function optimizatio...
This research proposes a method to solve the adaptive, multi-objective job shop scheduling problem. ...
In previous works the ability of CPS-MCPC (an evolutionary, co-operative, population search method w...
Evolutionary computation (EC) has been recently recognized as a research field, which studies a new ...
In an m-machines n-jobs flow-shop sequencing problem each job consists of m operations and each oper...
In evolutionary algorithms selection mechanisms aim to favour reproduction of better individuals imp...
Evolutionary algorithms (EAs) can be used as optimisation mechanisms. Based on the model of natural ...
This work summarizes results when facing the problem of allocating a number of nonidentical tasks in...
The study of earliness and tardiness penalties in scheduling is a relatively recent area of research...