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

随机加工时间的单机调度问题
引用本文:兰继斌,王中兴.随机加工时间的单机调度问题[J].广西科学,2000,7(4):260-261,269.
作者姓名:兰继斌  王中兴
作者单位:广西大学数学与信息科学系南宁市西乡塘路 530004
基金项目:广西教育厅科研项目,383,
摘    要:讨论n个独立工件在一台机器上加工。工件的加工时间服从正态分布,所有工件交货期设置公共交货期。目标是确定公共交货期及工件的最扰排序,使工件完工时间与公共交货期之差绝对值之和及工件完工时间之和的线性组合的期望值最小。

关 键 词:工件加工  单机调度  正态分布  公共交货期  排序
收稿时间:2000/1/17 0:00:00
修稿时间:2000/5/9 0:00:00

Single Machine Scheduling with Random Processing Time
Lan Jibin and Wang Zhongxing.Single Machine Scheduling with Random Processing Time[J].Guangxi Sciences,2000,7(4):260-261,269.
Authors:Lan Jibin and Wang Zhongxing
Institution:Dept. of Math. & Info., Guangxi Univ., Xixiangtanglu, Nanning, Guangxi, 530004, China and Dept. of Math. & Info., Guangxi Univ., Xixiangtanglu, Nanning, Guangxi, 530004, China
Abstract:The sequencing of n independent work pieces which are processed in a single-machine shop is discussed in which each job is assigned a common due-date k and each work piece processing time distribution is assumed to be independent normal distribution. The object is to determine a common due-date k* and to find an optimal sequence of n independent work pieces to minimize the expectation of the linear combination of total absolute deviation of completion time about a common due date and total completion time.
Keywords:work pieces process  single machine scheduling  normal distribution  common due date
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《广西科学》浏览原始摘要信息
点击此处可从《广西科学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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