Abstract
This paper suggested improvement of the searching ability in genetic algorithm on job-shop scheduling with batch splitting. Batch splitting reduces make-span because similar batches which occur by splitting can be in processes simultaneously. However, the number of batches increases as a result of splitting the original batches. It may complicate scheduling problems. So, this paper proposed genetic algorithm on job shop scheduling considered influence by batch splitting. The algorithm generates either of an active schedule or a non-delay schedule according to a gene. It has an influence good for the searching ability because the generating ratio changes dynamically by selection. Numerical experiments show the characteristics of the proposed algorithm.
