An Optimal Strategy for Online Non-uniform Length Order Scheduling

Authors:
Feifeng Zheng;E. Zhang;Yinfeng Xu;Xiaoping Wu
Affiliations:
School of Management, Xi'an JiaoTong University, Xi'an, China 710049;School of Information Management and Engineering, Shanghai University of Finance and Economics, China 200433;School of Management, Xi'an JiaoTong University, Xi'an, China 710049 and The State Key Lab for Manufacturing Systems Engineering, , Xi'an, China 710049;School of Management, Xi'an JiaoTong University, Xi'an, China 710049
Venue:
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Year:
2008

Citing 11
Cited 0

Nonclairvoyant scheduling

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Online computation and competitive analysis

Online computation and competitive analysis
Online interval scheduling

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Minimizing flow time nonclairvoyantly

Journal of the ACM (JACM)
Patience is a virtue: the effect of slack on competitiveness for admission control

Journal of Scheduling - Special issue: On-line algorithm part I
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines

Journal of the ACM (JACM)
Scheduling broadcasts with deadlines

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Laxity helps in broadcast scheduling

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Improved on-line broadcast scheduling with deadlines

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Competitive strategies for on-line production order disposal problem

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
A near optimal scheduler for on-demand data broadcasts

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper will study an online non-uniform length order scheduling problem. For the case where online strategies have the knowledge of Δbeforehand, which is the ratio between the longest and shortest length of order, Ting [3] proved an upper bound of $(\frac{6\Delta}{\log\Delta}+O(\Delta^{5/6}))$ and Zheng et al. [2] proved a matching lower bound. This work will consider the scenario where online strategies do not have the knowledge of Δat the beginning. Our main work is a $(\frac{6\Delta}{\log\Delta}+O(\Delta^{5/6}))$-competitive optimal strategy, extending the result of Ting [3] to a more general scenery.