| 处理机具有不同开始加工时间的可中断排序问题 |
| |
| 引用本文： | 赵传立,赵玉芳,等.处理机具有不同开始加工时间的可中断排序问题[J].运筹与管理,1997,6(3):16-19. |
| |
| 作者姓名： | 赵传立 赵玉芳 |
| |
| 作者单位： | 沈阳师范学院数学计算机系 |
| |
| 摘 要： | 本文对处理机具有的不同开始加工时间的可中断排序问题进行讨论，得到下面结论：若处理机具有相同开始加工时间的可中断排序问题存在最优排序算法，则相应的处理机具有不同开始加工时间的可中断排序问题也存在最优排序算法。
|
| 关 键 词： | 排序 最优排序 可中断最优排序 |
PREEMPTIVE SCHEDULING WITH NONSIMULTANEOUS PROCESSOR AVAILABLE TIME |
| |
| Zhao Chuanli,Zhao Yufang,Tang Hengyong.PREEMPTIVE SCHEDULING WITH NONSIMULTANEOUS PROCESSOR AVAILABLE TIME[J].Operations Research and Management Science,1997,6(3):16-19. |
| |
| Authors: | Zhao Chuanli Zhao Yufang Tang Hengyong |
| |
| Institution: | Department of Mathematics and Computer Shenyang Normal Institute |
| |
| Abstract: | The preemptive scheduling of processor with nonsimultaneous processor available time is discussed in this paper. We have proved that optimal algorithm also exists in the preemptive scheduling of processor with nonsimultaneous processor available time if it exists in the preemptive scheduling of processor with simultaneous processor available time. |
| |
| Keywords: | scheduling optimal scheduling preemptive optimal scheduling |
| 本文献已被 CNKI 维普 等数据库收录！ |
