{'fraction_non_alphanumeric': 0.015503875968992248, 'fraction_numerical': 0.0008613264427217916, 'mean_word_length': 4.257918552036199, '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}}
Parallel Machine Scheduling with Rejection under Special Conditions

We consider a version of parallel machine scheduling with rejection. There are m machines and n jobs, and each job is either accepted and then processed by one of the machines, or rejected and then a rejected fee is paid. The goal is to find a way of partitioning the set of jobs into two subsets, the subset of accepted and the subset of rejected jobs, the subset of accepted and the subset of rejected jobs, and to schedule all the accepted jobs to m machines such that the sum of the makespan and the total rejection fees of the rejected jobs is minimized. In this paper, we focus on a special case of this NP-hard problem where the processing time of each job is a power of 2. We show that if one more condition is satisfied, namely, if the ratio of rejection fee and processing time of each job can be indexed in the same way as the order of processing time, then the problem is polynomial time solvable. We therefore present an efficient algorithm for this case. Our result is also applicable to the case in which the processing times are the powers of q, where q is a positive integer.