Prototyped genetic search: a cybernetical approach to job‐shop scheduling problems

Amar Khoukhi (Ls. 14 Rue Amirat Abdelkader Ouled‐Moussa, Boumèrdes, Algeria)


ISSN: 0368-492X

Publication date: 1 February 2002


In the context of systems and cybernetics theory, we present a new general stochastic method of search and optimization of solutions of problems that we have named Prototyped Genetic Search. Our new method is based mainly on prototype and learning concepts, although it uses concepts of population and evolution just as Evolutionary Algorithms. Moreover, and in order to show the interest of this method and to demonstrate its real potential, we have chosen to apply it on the Job‐Shop Scheduling Problem in the context of the flexible production. This paper is also the opportunity for us to present an other new kind of genetic algorithms, resulting from the integration of the recursivity in the basis functioning of genetic algorithms, and that we have named Recursive Genetic Algorithm.



Khoukhi, A. (2002), "Prototyped genetic search: a cybernetical approach to job‐shop scheduling problems", Kybernetes, Vol. 31 No. 1, pp. 96-114.

Download as .RIS




Copyright © 2002, MCB UP Limited

Please note you might not have access to this content

You may be able to access this content by login via Shibboleth, Open Athens or with your Emerald account.
If you would like to contact us about accessing this content, click the button and fill out the form.
To rent this content from Deepdyve, please click the button.