CORC  > 上海财经大学  > 上海财经大学
Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
Gu, Manzhan2; Lu, Xiwen1
刊名ANNALS OF OPERATIONS RESEARCH
2011-11
卷号191期号:1页码:97-113
关键词Scheduling Online algorithm Asymptotical optimality Uniform machines
ISSN号0254-5330
DOI10.1007/s10479-011-0985-1
英文摘要We study the stochastic online scheduling on m uniform machines with the objective to minimize the expected value of total weighted completion times of a set of jobs that arrive over time. For each job, the processing time is a random variable, and the distribution of processing time is unknown in advance. The actual processing time could be known only when the job is completed. For the problem, we propose a policy which is proved to be asymptotically optimal when the processing times and weights are uniformly bounded, i.e. the relative error of the solution achieved by our policy approaches zero as the number of jobs increases to infinity.
WOS研究方向Operations Research & Management Science
语种英语
出版者SPRINGER
WOS记录号WOS:000297358300005
内容类型期刊论文
源URL[http://10.2.47.112/handle/2XS4QKH4/2228]  
专题上海财经大学
通讯作者Lu, Xiwen
作者单位1.E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China;
2.Shanghai Univ Finance & Econ, Dept Appl Math, Shanghai 200433, Peoples R China
推荐引用方式
GB/T 7714
Gu, Manzhan,Lu, Xiwen. Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines[J]. ANNALS OF OPERATIONS RESEARCH,2011,191(1):97-113.
APA Gu, Manzhan,&Lu, Xiwen.(2011).Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines.ANNALS OF OPERATIONS RESEARCH,191(1),97-113.
MLA Gu, Manzhan,et al."Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines".ANNALS OF OPERATIONS RESEARCH 191.1(2011):97-113.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace