Displaying similar documents to “Evolutionary algorithms for job-shop scheduling”

Solving the simple plant location problem by genetic algorithm

Jozef Kratica, Dušan Tošic, Vladimir Filipović, Ivana Ljubić (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.

Lower bounds for the scheduling problem with uncertain demands

Djamel Berkoune, Khaled Mesghouni, Besoa Rabenasolo (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain...