{'fraction_non_alphanumeric': 0.010689990281827016, 'fraction_numerical': 0.0029154518950437317, 'mean_word_length': 5.560509554140127, '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}}
A winner determination algorithm for auction-based decentralized scheduling

This paper presents a formulation and an algorithm for the winner determination problem in auction-based decentralized scheduling. Without imposing a time line discretization, the proposed approach allows bidders to bid for the processing of a set of tasks under release time and due date constraints using an expressive bidding language designed for decentralized scheduling. The proposed winner determination algorithm uses a depth first branch and bound search. The search branches on bids and a constraint directed scheduling procedure is used at each node to verify the feasibility of the allocation. Experiments against a commercial optimization package, CPLEX 10.0, show that the proposed algorithm is more than an order of magnitude faster on average over a set of winner determination problems of decentralized scheduling generated based on a suite of job shop constraint satisfaction benchmark problems previously developed in the literature.