共 50 条
On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
被引:0
|作者:
Ruyan Fu
Ji Tian
Jinjiang Yuan
机构:
[1] Zhengzhou University,Department of Mathematics
来源:
关键词:
On-line scheduling;
Batch machine;
Job families;
Competitive ratio;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
We study the on-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs. In this model, jobs arrive over time and jobs from different families cannot be scheduled in a common batch. We provide a best possible on-line algorithm for the problem with competitive ratio
\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$(\sqrt{17}+3)/4\approx1.7808$\end{document}
.
引用
收藏
页码:91 / 97
页数:6
相关论文