确定单位作业列表s-批处理精确竞争比的程序
数据结构与算法
2009-04-08 v1
摘要
We consider the online list s-batch problem, where all the jobs have processing time 1 and we seek to minimize the sum of the completion times of the jobs. We give a Java program which is used to verify that the competitiveness of this problem is 619/583.
引用
@article{arxiv.0904.1002,
title = {A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs},
author = {Wolfgang Bein and Leah Epstein and Lawrence L. Larmore and John Noga},
journal= {arXiv preprint arXiv:0904.1002},
year = {2009}
}