{'fraction_non_alphanumeric': 0.03412073490813648, 'fraction_numerical': 0.02230971128608924, 'mean_word_length': 5.254098360655738, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A competitive scheduling problem and its relevance to UMTS channel assignment

This article investigates a two‐user competitive scheduling problem. The problem arises in a Universal Mobile Telecommunication System (UMTS) developed within the European IST project FUTURE: given two mobile terminals, one wants to maximize the on‐time data packets transmitted to one user, while guaranteeing a certain amount of on‐time data packets to the other. We show that the problem is NP‐hard, despite peculiar properties of data and solutions. We propose a fast lagrangian heuristic able to cope with a severe real‐time requirement, and compare it to a greedy‐like heuristic on a set of practical instances. © 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44(2), 132–141 2004