Computer Science – Data Structures and Algorithms
Scientific paper
2009-04-06
Computer Science
Data Structures and Algorithms
Scientific paper
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.
Bein Wolfgang
Epstein Leah
Larmore Lawrence L.
Noga John
No associations
LandOfFree
A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-312963