Jens Heger stellt ein Verfahren vor, das auf der prioritätsregelbasierten Reihenfolgeplanung
aufbaut. Da keine Regel existiert, die in allen Situationen das anvisierte Zielkriterium …

This paper presents a neighbourhood generation mechanism for the job shop scheduling
problems (JSSPs). In order to obtain a feasible neighbour with the generation mechanism, it …

This paper presents a parallel hybrid evolutionary algorithm executed in a grid environment.
The algorithm executes local searches using simulated annealing within a Genetic …

This paper presents the application of a local search algorithm for a logical representation of
the Job Shop Scheduling Problem (JSSP). This logical representation represents the JSSP …

This paper presents a parallel hybrid evolutionary algorithm executed in a grid environment.
The algorithm executes local searches using simulated annealing within a Genetic …

In this paper, the Zavala-Cruz Algorithm is presented to solve the knapsack problem with
one parameter. The foundation of the algorithm is shown; it is based largely on the algorithm …

This paper presents a neighborhood generation mechanism for the job shop scheduling
problems (JSSP). In order to obtain a feasible neighbor with the generation mechanism, it is …

This paper presents a parallel hybrid evolutionary algorithm executed in a grid environment.
The algorithm executes local searches using Simulated Annealing within a Genetic …

Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic
algorithms is the calculation of the critical path in a digraph. This paper presents an …

One of the most popular algorithms in the field of domain independent planning is POP-
partial order planning. POP considers a least commitment strategy to solve planning …