Feasible Batch Scheduling Problem and Its Genetic Algorithm
可行批调度问题及其遗传算法

A discrimination problem, i. e., whether there exists a schedule in which all demands can be satisfied in time, is studied. Its equivalent feasible batch scheduling problem (FBSP) is obtained. By analyzing the features of the FBSP, the solutions to the batch scheduling problem(BSP) are represented in binary codes naturally. Based on it, a genetic algorithm, which can overcome the drawback of permutation-based GA that is often used in scheduling, is presented. Computational results show the effectiveness of the algorithm.