{'fraction_non_alphanumeric': 0.024489795918367346, 'fraction_numerical': 0.0, 'mean_word_length': 5.294871794871795, '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}}
Single-Machine Scheduling Problems with Past-Sequence-Dependent Setup Times and Deterioration Jobs

This paper considers a single-machine scheduling model with past-sequence-dependent setup times and deterioration jobs, where the actual processing time of a job is a function of the job’s scheduled position. It shows that the optimal schedules for the single-machine scheduling problems to minimize makespan and total completion time are both V-shaped with respect to job processing times.