{'fraction_non_alphanumeric': 0.033660589060308554, 'fraction_numerical': 0.009817671809256662, 'mean_word_length': 4.450381679389313, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead

This paper studies the online preemptive scheduling of equal-length intervals on a single machine with lookahead. Let p be the length (processing time) of all intervals. In the problem, at every time point t, online algorithms can foresee all the intervals that will arrive in the time segment (t,t + L) for a certain L. When L = p, Zheng et al. [Comput- ers & Operations Research, 2013] established a lower bound of 2 and provided an online algorithm with a competitive ratio of 3. In this paper, we provide for this problem an improved online algorithm with a competitive ratio of 2.