Home > Papers

 
 
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
Li Wenhua,Yuan Jinjiang #
Department of Mathematics, Zhengzhou University
*Correspondence author
#Submitted by
Subject:
Funding: NSFC（No.10901142）, NSFC（No.10971201）, SRFDP（No.20070459002）, NSFHN（No.082300410070）
Opened online:11 January 2011
Accepted by: none
Citation: Li Wenhua,Yuan Jinjiang.Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time[OL]. [11 January 2011] http://en.paper.edu.cn/en_releasepaper/content/4403852
 
 
This paper considers online scheduling on m unbounded parallel-batch machines to minimize maximum flow-time of the jobs. The research shows that no online algorithm can have a competitive ratio less than, where is the positive root of, and this lower bound is still valid even when all jobs have the same processing times. An online algorithm of competitive ratio 1+1/m is presented in the paper. When the jobs have the same processing times, a best possible online algorithm of competitive ratio is established.
Keywords:operations research; online scheduling; parallel-batch machines; makespan; competitive ratio
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 371
Bookmarked 0
Recommend 5
Comments Array
Submit your papers