多台机器下的最小期望延误的随机排序问题  

Stochastic Schedulingto Minimize Expected Lateness in Multiple Identical Machines

作　　者：王艳红[1] 李蕊[1] 张文娟[1] 

机构地区：[1]西安工业大学理学院,西安710032

出　　处：《计算机与数字工程》2014年第5期800-801,816,共3页Computer & Digital Engineering

摘　　要：论文针对多台机器下,任务的预期时间为随机变量的排序问题,首先用LPT排序方法把任务安排到不同的机器上,然后用简单的随机方法来确定任务在机器上的特殊加工次序。由于随机预期时间是相互独立的并且服从指数分布,考虑将参数进行最大延误。This paper tackles the problem of scheduling jobs with random due dates on multiple identical machines in a stochastic environment. First LPT scheduling methods have been used to assign jobs to different machine centers, after that the particular sequence of jobs to be processed on the machine have been found using simple stochastic techniques. The per- formance parameter under consideration has been the maximum lateness concerning the stochastic due dates which are inde- pendent and exponentially distributed.

关 键 词：LPT排序 随机排序 最大延误 随机预期时间 

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