链优先约束工件单机随机排序问题  

Stochastic Single Machine Scheduling Problem with Chains Precedence Constraints Jobs

作　　者：赵传立[1] 唐恒永[1] 

机构地区：[1]沈阳师范大学数学与系统科学学院,辽宁沈阳110034

出　　处：《系统工程》2003年第5期43-47,共5页Systems Engineering

摘　　要：讨论单机随机排序问题 ,目标函数为确定工件的排列顺序使工件的加权完工时间和的数学期望最小。设工件间具有平行链优先约束 ,机器发生随机故障。考虑两种情况 ,第一种情况是链不允许中断 ,第二种情况是链允许中断 。The stochastic single machine scheduling problem was considered in order to determine job permutation sequence that minimizes the mean weighted sum of completion times. It is assumed that job is subject to parallel chains precedence constraints and the machine is subject to a sequence of stochastic breakdowns. Two versions of the problem are addressed. In the first one the chains is not allowed be interrupted, whereas in the second one the chains can be interrupted. For both cases, the optimal algorithms are presented, respectively.

关 键 词：单机随机排序问题 目标函数 数学期望 链优先约束 最优算法 

分 类 号：O223[理学—运筹学与控制论]