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

Simple item page
dc.creatorBein, Wolfgang
dc.creatorEpstein, Leah
dc.creatorLarmore, Lawrence L.
dc.creatorNoga, John
dc.date2009-04-06
dc.date.accessioned2026-07-07T13:01:11Z
dc.date.available2026-07-07T13:01:11Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0904.1002
dc.identifierhttp://arxiv.org/abs/0904.1002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226072
dc.subjectData Structures and Algorithms
dc.subjectF.2; I.2.2
dc.titleA Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
dc.typetext

Files

Collections

arXiv