The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Online batch scheduling problem on uniform machines with agreeable processing times
Author(s): 
Pages: 111-118
Year: Issue:  1
Journal: Operations Research Transactions

Keyword:  分批排序在线算法同类机竞争比一致性;
Abstract: 研究了工件满足一致性,批容量无界的两台同类机在线分批排序问题,目标为极小化工件的最大完工时间和极小化工件的最大流程时间,三元素法分别表示为Q2/ri<rj(→)pi≤pj,B=∞,on-line[Cmax,Q2[ri<rj(→)pi≥pj,B=∞,on-line| Fmax.不失一般性,假设第一台机器速度为1,第二台机器速度为s,s≥1.对于上述两类问题设计了一个在线算法,并分析了算法竞争比的上界.对第一类问题该在线算法的竞争比不超过s+α,这里α为α2+ sα-1=0的正根,特别地,当s=1时,该算法的竞争比不超过1.618.对第二类排序问题,该在线算法的竞争比不超过1+1/α.
Related Articles
No related articles found