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

Date
Authors
Bein, Wolfgang
Epstein, Leah
Larmore, Lawrence L.
Noga, John
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
Computer Science - Data Structures and Algorithms, F.2, I.2.2
Citation
Collections