| 机器随机故障时使拖后工件数最少的单机调度问题 |
| |
| 引用本文： | 贾春福.机器随机故障时使拖后工件数最少的单机调度问题[J].南开大学学报,1997,30(2):9-13. |
| |
| 作者姓名： | 贾春福 |
| |
| 作者单位： | 南开大学计算机与系统科学系!天津，300071 |
| |
| 基金项目： | 国家自然科学基金，国家“863”高技术自动化领域CIMS主题项目资助 |
| |
| 摘 要： | 本文讨论了机器随机故障时，使拖后工件数最少的的单机调度问题，结果表明，确定情况下的Ｍｏｏｒｅ－Ｈｏｄｇｓｏｎ算法，在机器随机故障时，能以概率１确定最优工件排序。
|
| 关 键 词： | 单机调度 随机故障 拖后工件数 调度 排序 |
SCHEDULING FOR MINIMIZING THE NUMBER OF TARDY JOBS ON SINGLE MACHINE SUBJECT TO STOCHASTIC BREAKDOWNS |
| |
| Jia Chunfu,Tu Fengsheng.SCHEDULING FOR MINIMIZING THE NUMBER OF TARDY JOBS ON SINGLE MACHINE SUBJECT TO STOCHASTIC BREAKDOWNS[J].Acta Scientiarum Naturalium University Nankaiensis,1997,30(2):9-13. |
| |
| Authors: | Jia Chunfu Tu Fengsheng |
| |
| Abstract: | n this paper, a scheduling problem for minimizing the number.of tardy jobs on a single machine which is subject to stochastic breakdowns is discussed. The result shows thatMoors--Hodgson algorithm can also determine the optimal sequence of the scheduling problem with probability I when the machine is subject to stochastic breakdowns. |
| |
| Keywords: | single machine scheduling stochastic breakdown the number of tardy jobs |
| 本文献已被 CNKI 维普 等数据库收录！ |
