{'fraction_non_alphanumeric': 0.014084507042253521, 'fraction_numerical': 0.0, 'mean_word_length': 4.5546875, '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}}
Due date assignment and scheduling with time and positional dependent effects

Abstract This paper studies a due date assignment and single machine scheduling problem. In this model, the actual processing time of a job depended both on its start time and position in a sequence. Each job has to be assigned a due date by which it must be completed. The goal is to determine schedule the jobs and the due dates so as to minimize the the criteria that includes the cost of changing the due dates, the total cost of discarded jobs and the total earliness of the scheduled jobs. For the proposed problems, polynomial-time algorithms are presented separately for the CON and SLK due-date assignment method versions.