# American Institute of Mathematical Sciences

• Previous Article
Optimality conditions of fenchel-lagrange duality and farkas-type results for composite dc infinite programs
• JIMO Home
• This Issue
• Next Article
Alliance strategy of construction and demolition waste recycling based on the modified shapley value under government regulation
doi: 10.3934/jimo.2020132

## Research on the parallel–batch scheduling with linearly lookahead model

 College of Science, Zhongyuan University of Technology, Zhengzhou, Henan 450007, China

* Corresponding author: Chengwen Jiao

Received  April 2020 Revised  June 2020 Published  August 2020

Fund Project: The author is supported by NSFC under grant number 11701595

In this paper, we consider the new online scheduling model with linear lookahead intervals, which has the character that at any time $t$, one can foresee the jobs that will coming in the time interval $(t, \lambda t+\beta ]$ with $\lambda\geq1, \beta\geq 0$. We consider online scheduling of unit length jobs on $m$ identical parallel-batch machines under this new lookahead model to minimize the maximum flowtime and the makespan, respectively. We give some lower bounds for these problems with the batch capacity $b = \infty$ and $b<\infty$, respectively. And for the bounded model to minimize makespan, we give an online algorithm with competitive ratio $1+\alpha$ for $1\leq \lambda <4/3, 0\leq \beta\leq \frac{4-3\lambda}{6}$ and $\frac{3}{2}$ for $\lambda\geq1, 0\leq\beta<1$, where $\alpha$ is the positive root of $\lambda\alpha^2+(\lambda+\beta)\alpha+\beta-1 = 0$. The online algorithm is best possible when $1\leq \lambda <4/3, 0\leq \beta\leq \frac{4-3\lambda}{6}$.

Citation: Chengwen Jiao, Qi Feng. Research on the parallel–batch scheduling with linearly lookahead model. Journal of Industrial & Management Optimization, doi: 10.3934/jimo.2020132
##### References:

show all references