| 有限制条件的单台机器的排序问题 |
| |
| 引用本文： | 唐保祥.有限制条件的单台机器的排序问题[J].西北师范大学学报,2000,36(4):22-26. |
| |
| 作者姓名： | 唐保祥 |
| |
| 作者单位： | 天水师范学院数学系!甘肃天水741001 |
| |
| 摘 要： | 根据给定n个工件在一台机器上加工时工件间的先后关系 ,定义了一个n个顶点的有向图D ,简化图D得排序图D ,通过穷举图D 的顶点的拓扑序列 ,搜索出了n个工件完工时间之和最小、机器加工完n个工件总时间最少和延误损失最少的加工顺序 .
|
| 关 键 词： | 有向图 前代 后代 最长路 排序图 拓扑序列 |
The sequencing problem of one machine with limited conditions |
| |
| TANG Bao-xiang.The sequencing problem of one machine with limited conditions[J].Journal of Northwest Normal University Natural Science (Bimonthly),2000,36(4):22-26. |
| |
| Authors: | TANG Bao-xiang |
| |
| Abstract: | A directed graph D with n vertexes is defined according to the sequence of n given spare parts that are processed on one machine.When the graph D is simplified,a sequencing graph D * is obtained.By wholly enumerating the topological sequence of vertexes of graph D * ,we can hunt the processing sequence that the sum of the time that n spare sparts complete processing is the least,the sum of the time that the machine completes n spare parts is the least and the loss because of delay is the least. |
| |
| Keywords: | directed graph last generation next generatiom longest path sequencing graph toplogical sequence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
