摘要
讨论了关于随机故障型单机排序研究领域中工件完工概率问题,具有随机压缩加工时间的二次超前-延误惩罚问题的最优解的存在性问题,以及关于一个随机序的定理的证明的改进.
This paper addresses three problems of scheduling jobs on a machine subject to stochastic breakdowns. The first one is whether all the jobs to be processed can be completed in probability 1. The second one is an improvement on a proof of a theorem with stochastic order. The third one is the existence of the optimal solution of the problem with quadratic early-tardy penalties and randomly compressible processing times.
出处
《西南大学学报（自然科学版）》
CAS
CSCD
北大核心
2008年第7期1-5,共5页
Journal of Southwest University(Natural Science Edition)
基金
国家自然科学基金资助项目(10471096)
沈阳师范大学博士启动基金资助项目(05455440102005)
关键词
排序
随机故障
完工时间
随机序
最优解
scheduling
stochastic breakdown
completion time
stochastic order
optimal solution
