引用本文
  • 兰继斌,王中兴.随机加工时间的单机调度问题[J].广西科学,2000,7(4):260-261,269.    [点击复制]
  • Lan Jibin,Wang Zhongxing.Single Machine Scheduling with Random Processing Time[J].Guangxi Sciences,2000,7(4):260-261,269.   [点击复制]
【打印本页】 【在线阅读全文】【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 380次   下载 449 本文二维码信息
码上扫一扫!
随机加工时间的单机调度问题
兰继斌, 王中兴
0
(广西大学数学与信息科学系, 南宁市西乡塘路 530004)
摘要:
讨论n个独立工件在一台机器上加工。工件的加工时间服从正态分布,所有工件交货期设置公共交货期。目标是确定公共交货期及工件的最优排序,使工件完工时间与公共交货期之差绝对值之和及工件完工时间之和的线性组合的期望值最小.
关键词:  工件加工  单机调度  正态分布  公共交货期
DOI:
投稿时间:2000-01-17修订日期:2000-05-09
基金项目:广西区教育厅资助(No.1999[383])。
Single Machine Scheduling with Random Processing Time
Lan Jibin, Wang Zhongxing
(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.
Key words:  work pieces process  single machine scheduling  normal distribution  common due date

用微信扫一扫

用微信扫一扫