{'fraction_non_alphanumeric': 0.01220865704772475, 'fraction_numerical': 0.0, 'mean_word_length': 5.136054421768708, '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}}
Solving Single Machine Scheduling Problem With Common Due Date

The paper addresses an n-job single machine scheduling problem with common due date to minimize the sum of total inventory and penalty costs. Earliness and tardiness are considered harmful to profitability. Earliness causes inventory carrying costs and possible loss of product quality, while tardiness causes loss of customer goodwill and damage reputation as well as delay of payment. Thus the scheduling problem of minimizing the total sum of earliness and tardiness with a common due date on a single machine is important and a competitive task in the delivery of goods in production plants, and it is known to be NP-hard. A simple, easy to understand/implement heuristic algorithm which can be performed manually for small problems and computationally feasible for large problems is presented and illustrated with numerical example.