期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2008
卷号：8
期号：9
页码：219-223
出版社：International Journal of Computer Science and Network Security
摘要：This paper introduces a technique for solving the flowshop scheduling problem. The major idea is to partition the set of feasible solutions into regions in order to diversify the search that is used on a Genetic Algorithm variation. The population is formed by every distinct subject and it is carried out constructively in such a way that any iteration guarantees a diversification on the search for a feasible solution. The problem is a very well known NP-Hard problem and it imposes great challenges for determining its optimal solution in the practice. Computational experiments are reported for the literature instances and the obtained results are compared with other techniques.
Loading...
