| 单机E/T调度问题的动态规划新解法 |
| |
| 引用本文： | 涂菶生,吴民.单机E/T调度问题的动态规划新解法[J].南开大学学报,1999,32(3):47-52. |
| |
| 作者姓名： | 涂菶生 吴民 |
| |
| 作者单位： | 南开大学计算机与系统科学系!天津，300071，南开大学计算机与系统科学系!天津，300071 |
| |
| 基金项目： | 国家自然科学基金，国家攀登计划资助 |
| |
| 摘 要： | 本文利用最优调度的目标函数的性质，放弃了参数为整数的假定，改进了求解单机的Ｅ／Ｔ调度问题的动态规划算法，使其在时间复杂度和空间复杂度两方面都有提高
|
| 关 键 词： | E/T调度 动态规划 最优调度 |
NEW DYNAMIC PROGRAMMING ALGORITHMS FOR SINGLE MACHINE E/T SCHEDULING PROBLEMS |
| |
| Tu Fengsheng,Wu Min.NEW DYNAMIC PROGRAMMING ALGORITHMS FOR SINGLE MACHINE E/T SCHEDULING PROBLEMS[J].Acta Scientiarum Naturalium University Nankaiensis,1999,32(3):47-52. |
| |
| Authors: | Tu Fengsheng Wu Min |
| |
| Abstract: | While dynamic programming algorithms are efficient for solving single machine E/T scheduling problems, they usually require the assumption that some parameters must be integers. In this paper, we relax this assumption by taking advantage of piecewise property of object functions of the optimal schedulings, which reduces time complexities and space complexities of dynamic programming algorithms. |
| |
| Keywords: | E/T scheduling dynamic programming optimal scheduling |
| 本文献已被 CNKI 维普 等数据库收录！ |
