Showing 1 - 10 of 65
Persistent link: https://www.econbiz.de/10001888982
Persistent link: https://www.econbiz.de/10000927882
Persistent link: https://www.econbiz.de/10004300517
In this research we consider the problemof scheduling rounds of a non-professional table-tennisleague. We formalize the problem in terms of atimetabling optimization problem. Then we solve thishighly constrained problem with a permutation based GeneticAlgorithm for which feasibility preserving...
Persistent link: https://www.econbiz.de/10005840446
Many recent algorithmic approaches suffer from their limited applicability to dynamic scheduling scenarios. Genetic Algorithms have been shown to overcome this problem at the expense of searching less efficient. We propose a flexible dispatching procedure which is controlled by a Genetic...
Persistent link: https://www.econbiz.de/10005840459
In this paper we concentrate on Job Shop Scheduling as a representative of constrained combinatorial problems. We introduce a new permutation representation for this problem. Three crossover operators different in tending to preserve the relative order, the absolute order, and the position in...
Persistent link: https://www.econbiz.de/10005840460
The application of adaptive optimization strategies to scheduling in manufacturing systems has recently become a research topic of broad interest. Population based approaches to scheduling predominantly treat static data models, whereas real-world scheduling tends to be a dynamic problem. This...
Persistent link: https://www.econbiz.de/10005840463
A frequently observed difficulty in the application of genetic algorithms to the domain of optimization ariscs from premature convergence. In order to preserve genotype diversity we develop a new model of auto-adaptive behavior for individuals. In this model a population member is an active...
Persistent link: https://www.econbiz.de/10005840465
The population of parallel genetic algorithms (PGAs) can easily be split up to match the needs of a coarse grained parallelism. A cluster of interconnected workstations, seen as an MIMD-architecture, is the chosen hardware to express this kind of parallelism. A PGA implementation, as any other...
Persistent link: https://www.econbiz.de/10005840466
In dieser Arbeit wurde eine neue Form der Repräsentation von Maschinenbelegungsproblemen für Genetische Algorithmen vorgestellt. Sie behandelt die Maschinenbelegungsplanung in natürlicher Weise durch Reihenfolgenbildung von ausführenden Arbeitsgängen und umgeht dabei dennoch die...
Persistent link: https://www.econbiz.de/10005840467