摘要
讨论一类具有随机加工时间的单机调度问题 ,目标是确定 n个独立工件的最优排序 ,使工件提前完工时间之和 ,延误时间之和及守工时间之和的线性组合之期望值最小 .
This paper considers the scheduling of \$n\$ independent jobs with random processing times in a single machine shop in which each is assigned a common due date, the objective is to determine the optimal sequencing to minimize the expectation of the linear combination of the total earlinss, total tardiness and total completion times, under appropriate assumption, the shaping of optimal sequencing is derived.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2000年第6期112-114,共3页
Systems Engineering-Theory & Practice
基金
广西区教育厅资助 !1999[383]
关键词
单机调度
随机加工时间
V-型排序
single machine scheduling
random processing
V\|shaped sequencing
