| 两台同类机极小化总完工时间的分批排序问题 |
| |
| 引用本文： | 焦李超,朱路宁.两台同类机极小化总完工时间的分批排序问题[J].滨州学院学报,2008,24(6). |
| |
| 作者姓名： | 焦李超 朱路宁 |
| |
| 作者单位： | 曲阜师范大学,运筹与管理学院,山东,日照,276826 |
| |
| 基金项目： | 国家自然科学基金，山东省自然科学基金 |
| |
| 摘 要： | 考虑了两台同类机极小化总完工时间的分批排序问题,给出了计算复杂性为O(n3)的动态规划算法,并将此算法推广到了工件具有学习效应的情况.
|
| 关 键 词： | 同类机 分批 排序 总完工时间 |
A Batch Scheduling that Minimizes the Total Completion Time on Two Uniform Machines |
| |
| JIAO Li-chao,ZHU Lu-ning.A Batch Scheduling that Minimizes the Total Completion Time on Two Uniform Machines[J].Journal of Binzhou University,2008,24(6). |
| |
| Authors: | JIAO Li-chao ZHU Lu-ning |
| |
| Abstract: | The problem of batch scheduling that minimizes the total completion time on two uniform machines is studied.A dynamic programming algorithm,whose computing complexity is O(n3) is given.Furthermore,the algorithm to the case of the jobs with learning effect is spread. |
| |
| Keywords: | uniform machines batching scheduling total completion time |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
