1996 Volume 9 Issue 1 Pages 24-33
This paper deals with an operation assignment problem. The problem is to process N products at one of parallel H machines in order to minimize the deviation of the processing time of each product from its desirable time interval. Then, we have to determine both the order and the machine to process each product.
The genetic algorithm (GA) is applied to this problem. Several individual descriptions and the related decoding methods are proposed. By examining numerical results, comparison is made among these individual descriptions from the viewpoints of accuracy and computation time. Consequently, the best individual description is found to be the one defined in such a way that both the order and the machine are determined by GA.