A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Data Structures and Algorithms, F.2; I.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/226072

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0904.1002
 http://arxiv.org/abs/0904.1002

Collections

arXiv