摘要
讨论一类具有随机加工时间的单机调度问题 ,所有工件设置一个公共交货期窗口 ,每个工件的加工时间服从正态分布 ,目标是确定 n个独立工件的一个排序 ,使工件的提前 /延期之和与完工时间之和的线性组合之期望值最小。问题的最优解具有 V-型特征。
This paper discusses the sequencing of n jobs with random processing times in a single machine shop in which each job is assigned a constant due window and each job processing time distribution is assumed independent normal distribution. The object is to find a sequencing of n jobs to minimize the expectation of the linear combination of earliness/tardiness and total completion times. The optimal sequence of n independent jobs has V character.
出处
《系统工程理论方法应用》
2000年第4期304-308,共5页
Systems Engineering Theory·Methodology·Applications
基金
广西省教育厅资助项目!( 1 999[383])
