摘要
对一种简化的调度问题进行了分析 ,说明了在一定的条件下 ,对某一范围的调度任务 ,的确存在着一种不变的模式 .文中对任务中不同的子任务对 (“订单对”)给出了一个指标 ,并以此指标来判断该子任务对在一个成功的生产调度方案中的先后顺序 ,是否在另一个类似的任务的成功生产调方案中能得到保持 .基于这一结果 。
A simplified scheduling problem is studied in this paper, with a conclusion that under certain conditions, there exists an invariable pattern among the successful solutions of the scheduling tasks within a certain bound. An index is given to different pairs of subtasks(i.e., ordering\|pairs) in a task to estimate whether the order of the two subtasks in a certain ordering\|pair will be kept in other similar tasks. Based on those results, an algorithm is proposed to execute machine learning on the empirical scheduling plans.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2001年第7期12-17,25,共7页
Systems Engineering-Theory & Practice
基金
国家 8 63高技术研究发展计划 ( 984 5-0 0 5)