| 工件加工时间恶化问题的若干研究 |
| |
| 引用本文： | 黄宜坤.工件加工时间恶化问题的若干研究[J].临沂师范学院学报,2006,28(6):20-23. |
| |
| 作者姓名： | 黄宜坤 |
| |
| 作者单位： | 临沂师范学院,数学系,山东,临沂,276005 |
| |
| 摘 要： | 主要研究关于工件加工时间恶化的若干问题,给出了最大完工时间问题的一些性质、总完工时间问题的算法和性质,并根据实际问题,设计了一些新模型,相应地给出了该问题所具有的性质及一些简单算法．
|
| 关 键 词： | 平行机排序 算法 竞争比 |
| 文章编号： | 1009-6051（2006）06-0020-04 |
| 收稿时间： | 2006-10-15 |
| 修稿时间： | 2006-10-15 |
A Research on the Problem of Deterioration of Processing Time |
| |
| HUANG Yi-kun.A Research on the Problem of Deterioration of Processing Time[J].Journal of Linyi Teachers' College,2006,28(6):20-23. |
| |
| Authors: | HUANG Yi-kun |
| |
| Institution: | Department of Mathematic, Linyi Normal University, Linyi Shandong 276005, China |
| |
| Abstract: | In this paper we investigate several parallel machine scheduling problems with deterioration of processing time. We present some properties for the value of the makespan (maximum load), and some algorithm and properties for the classical scheduling (load balancing) problem. Based on the actual problems, we design several new models and give algorithms and properties respectively. |
| |
| Keywords: | parallel machine scheduling algorithm competitive ratio |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
