随机加工时间的单机调度问题

Single Machine Scheduling with Random Processing Time

关键词:  工件加工  单机调度  正态分布  公共交货期

Key words:  work pieces process  single machine scheduling  normal distribution  common due date

摘要:

讨论n个独立工件在一台机器上加工。工件的加工时间服从正态分布,所有工件交货期设置公共交货期。目标是确定公共交货期及工件的最优排序,使工件完工时间与公共交货期之差绝对值之和及工件完工时间之和的线性组合的期望值最小.

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.