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
On-line parallel machine scheduling with selective jobs
Author(s): 
Pages: 14-17
Year: Issue:  5
Journal: JOURNAL OF ZHOUKOU NORMAL UNIVERSITY

Keyword:  平行机在线算法工件可选择性竞争比;
Abstract: 研究了一类平行机在线排序问题,且工件可以选择.用三参数法表示该模型为:Pm|on-line,rj,D|∑,fJ.其中D指机器使用期限,fj为工件Jj的加工利润,目标函数是使得在机器使用期限内所获总利润最大.本文给出了该模型fj=1情形(即工件费用相同)的所有在线g法竞争比的上界1/2,进而给出了两台机器、fj=1且工件序列只含两类工件情形(小工件加工时间为1,大工件加工时间为d≥2)的在线算法(ξ)1,其竞争比为1/2,为最具竞争性的
Related Articles
loading...