Affiliation:
1. College of Science, Zhongyuan University of Technology, Zhengzhou, Henan 450007, P. R. China
2. School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, P. R. China
Abstract
In this paper, we propose a new online scheduling model with linear lookahead intervals, which has the character that at any time [Formula: see text], one can foresee the jobs that will coming in the time interval [Formula: see text] in which [Formula: see text]. In this new lookahead model, the length of the lookahead intervals are variable as the time going on and the number of jobs increasing, and has the tend of steady growth. In this paper, we consider online scheduling of unit length jobs on [Formula: see text] identical parallel-batch machines under this new lookahead model to minimize makespan. The batch capacity is unbounded, that is [Formula: see text]. We present an optimal online algorithm for [Formula: see text], and provide a best possible online algorithm of competitive ratio [Formula: see text] for [Formula: see text], where [Formula: see text] is the positive root of [Formula: see text].
Publisher
World Scientific Pub Co Pte Lt
Subject
Management Science and Operations Research,Management Science and Operations Research
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献