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

关于具有正比权值完工时间与公共交货期偏差最小化单机调度问题的注记
引用本文:贾春福.关于具有正比权值完工时间与公共交货期偏差最小化单机调度问题的注记[J].南开大学学报,2005,38(4):86-89.
作者姓名:贾春福
作者单位:南开大学,信息技术科学学院,天津,300071
摘    要:讨论了工件权值与加工时间成正比、完工时间与公共交货期绝对偏差权和最小化单机调度问题(简记为PTD问题).1997年,Alidaee和Dragan证明了PTD问题LPT(LargestProcessingTime)调度最优.并给出一个简单证明;还讨论了加工时间随机的情形,指出依加工时间似然比单减得到的工件调度最优.

关 键 词:调度  单机  正比权值  随机加工时间  似然比
文章编号:0465-7942(2005)04-0086-05
收稿时间:09 10 2003 12:00AM
修稿时间:2003年9月10日

Note on Single Machine Scheduling with Proportional Job Weights to Minimize Deviations of Completion Times about a Common Due Date
Jia Chunfu.Note on Single Machine Scheduling with Proportional Job Weights to Minimize Deviations of Completion Times about a Common Due Date[J].Acta Scientiarum Naturalium University Nankaiensis,2005,38(4):86-89.
Authors:Jia Chunfu
Institution:School of Information Technical Sciences, Nankai University, Tianjin 300071, China
Abstract:The problem of minimizing total weighted absolute deviations of job completion times from a common due date on a single machine with proportional job weights (PTD) is considered. Alidaee and Dragan in 1997 showed that LPT (largest processing time) job schedule is optimal for this problem. In this paper, a simple proof of the result of PTD problem is given. Moreover, the stochastic counterpart of the PTD problem with random processing times (SPTD) is also discussed, and the job schedule in decreasing order in the sense of likelihood ratio is shown optimal.
Keywords:scheduling  single machine  proportional weight  random processing times  likelihood ratio
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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