首页 | 本学科首页   官方微博 | 高级检索  
     检索      

多项式可解的单机加权E/T调度问题
引用本文:贾春福,涂菶生.多项式可解的单机加权E/T调度问题[J].南开大学学报,1999,32(1):47-49.
作者姓名:贾春福  涂菶生
作者单位:南开大学计算机与系统科学系
摘    要:研究了目标函数为完成时间与交货期差平方的加权和的单机调度问题,在工件的权值与加工时间成比例时,给出了问题的最优解.然后,在假设描述机器随机故障次数的计数过程为广义泊松过程时,将上述结果推广到机器有随机故障的情形.

关 键 词:E/T调度  权值  交货期  随机故障
修稿时间:1997-01-06

SINGLE MACHINE WEIGHTED E/T SCHEDULING SOLVED IN POLYNOMIAL BOUND TIME
Jia Chunfu,Tu Fengsheng.SINGLE MACHINE WEIGHTED E/T SCHEDULING SOLVED IN POLYNOMIAL BOUND TIME[J].Acta Scientiarum Naturalium University Nankaiensis,1999,32(1):47-49.
Authors:Jia Chunfu  Tu Fengsheng
Abstract:The problem of scheduling n jobs on a single machine to minimize the weighted sum of squared deviations of jobs' completion times from their due dates is considered . The optimal solution is abstained when the weights are proportional to the processing times. Moreover, The case of the problem where the machine is subject to stochastic breakdowns when the counting process N(t) describing the number of breakdowns is a generalized Poisson process is discussed also.
Keywords:E/T scheduling  weight  due date  stochastic breakdowns  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号