%0 Journal Article
%T Feasible Batch Scheduling Problem and Its Genetic Algorithm<br>可行批调度问题及其遗传算法
%A CHEN Tsiu-shuang
%A XU Guo-qing
%A TU Feng-sheng
%A <br>陈秋双
%A 徐国清
%A 涂奉生
%J 系统工程理论与实践
%D 2000
%I 
%X 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.
%K batch scheduling
%K feasible scheduling
%K genetic algorithm<br>批调度
%K 可行调度
%K 遗传算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=50BA57D645F1BD8D667B8B14F722B4FF&yid=9806D0D4EAA9BED3&vid=A04140E723CB732E&iid=94C357A881DFC066&sid=09ABD5535D9B6D45&eid=80A07035DF96B0C4&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=1&reference_num=0