| 可行批调度问题及其遗传算法 |
| |
| 引用本文： | 陈秋双,徐国清,涂奉生.可行批调度问题及其遗传算法[J].系统工程理论与实践,2000,20(5):70-75. |
| |
| 作者姓名： | 陈秋双 徐国清 涂奉生 |
| |
| 作者单位： | 南开大学计算机与系统科学系 |
| |
| 基金项目： | “863”高技术CIMS主题!863－511－944－017，国家自然科学基金!69674013，天津青年基金!973701111 |
| |
| 摘 要： | 对判定问题一是否存在使所有需求都可按时满足的调度一进行了研究，通过将其转化成等价的可行批调度问题，分析可行批调度的性质，把问题的解自然表示成了二进制编码的形式，在此基础上，提出了相应的遗传算法，它克服了调度研究中常用的基于排列编码的遗传算法的缺点，仿真结果验证了算法的有效性.
|
| 关 键 词： | 批调度 可行调度 遗传算法 |
Feasible Batch Scheduling Problem and Its Genetic Algorithm |
| |
| CHEN Tsiu-shuang,XU Guo-qing,TU Feng-sheng.Feasible Batch Scheduling Problem and Its Genetic Algorithm[J].Systems Engineering —Theory & Practice,2000,20(5):70-75. |
| |
| Authors: | CHEN Tsiu-shuang XU Guo-qing TU Feng-sheng |
| |
| Institution: | Depart. of Computer & System Sciences, Nankai University |
| |
| Abstract: | 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. |
| |
| Keywords: | batch scheduling feasible scheduling genetic algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
