A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs
Wolfgang Bein, Leah Epstein, Lawrence L. Larmore, John Noga
TL;DR
This paper presents a Java program that precisely determines the competitive ratio for the online list s-batch problem with unit jobs, confirming it as 619/583.
Contribution
The authors developed a computational method to exactly verify the competitive ratio for a specific online batching problem, advancing precise analysis in this area.
Findings
Competitive ratio is exactly 619/583.
Java program successfully verifies the ratio.
Provides a computational approach for similar problems.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Scheduling and Optimization Algorithms · Advanced Manufacturing and Logistics Optimization