J4 ›› 2009, Vol. 44 ›› Issue (12): 36-40.

• Articles • Previous Articles     Next Articles

An algorithm for online batch scheduling with nonidentical job sizes

BAI Qingguo, WANG Zhongzhi, ZHANG Yuzhong   

  1. School of Operations Research and Management, Qufu Normal University, Rizhao 276826, Shandong, China
  • Received:2008-11-03 Online:2009-12-16 Published:2010-02-05

PDF (PC)

754

Abstract:

16160 the  case that all jobs have only two distinct arrival times, and a lower bound is also derived.

Key words: online algorithm, the competitive ratio, batch scheduling

CLC Number: 

  • O224
[1] ZHAO Hong-luan,WANG Xiao-li,QI Xing-qin . Single processor scheduling with batching and with penalty of common due window location [J]. J4, 2006, 41(1): 74-77 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd