| 具有维修时间的两台平行机在线排序 |
| |
| 引用本文： | 冯琪,财玉华.具有维修时间的两台平行机在线排序[J].河南科技大学学报(自然科学版),2011,32(6):11-13,18. |
| |
| 作者姓名： | 冯琪 财玉华 |
| |
| 作者单位： | 1. 甲原工字阮埋字院,河南,郑州,450007
2. 郑州大学数学系,河南,郑州,450052 |
| |
| 基金项目： | 国家自然科学基金项目，河南省科技攻关项目 |
| |
| 摘 要： | 在排序问题中,机器可能出现故障或其他原因而需要维修,因此,在加工工件时把维修时间考虑进去是很必要的.对机器维修时间完全重合、可中断的两台平行机排序问题,本文考虑它的在线情形.通过分析不同情形,给出其任意在线算法竞争比的下界为2,并给出一个最好可能的在线算法.
|
| 关 键 词： | 平行机排序 维修时间 在线算法 竞争比 |
On-line Scheduling Problems of Two Parallel Machines with Maintenance Time |
| |
| FENG Qi,CAI Yu-Hua.On-line Scheduling Problems of Two Parallel Machines with Maintenance Time[J].Journal of Henan University of Science & Technology:Natural Science,2011,32(6):11-13,18. |
| |
| Authors: | FENG Qi CAI Yu-Hua |
| |
| Institution: | FENG Qi1,CAI Yu-Hua2 (1.College of Science,Zhongyuan University of Technology,Zhengzhou 450007,China,2.Department of Mathematics,Zhengzhou University,Zhengzhou 450052,China) |
| |
| Abstract: | In scheduling problems,the machines need to be repaired because of breakdowns or other reasons.Therefore,maintenance time during the processing of jobs is considered.For scheduling problems of two parallel identical machines with common maintenance time intervals and resumable availability,its on-line version was researched.In this paper,the lower bound of competitive ratio no less than 2 for arbitrary on-line algorithm by analysing different cases is proved.Moreover,a best possible on-line algorithm with c... |
| |
| Keywords: | Parallel machines scheduling Maintenance time On-line algorithm Competitive ratio |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
