{'fraction_non_alphanumeric': 0.008383233532934131, 'fraction_numerical': 0.0, 'mean_word_length': 5.285714285714286, '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}}
DYNAMIC SCHEDULING FOR A SINGLE MACHINE SYSTEM UNDER DIFFERENT SETUP AND BUFFER CAPACITY SCENARIOS

The problem of dynamic scheduling for single machine manufacturing systems has been extensively studied in the past under different setup scenarios, mainly for systems with infinite buffer capacity. This paper addresses a general framework and investigates similarities and differences between policies optimal if setup times and costs are or are not negligible, if buffers have a finite or an infinite capacity. The cost function takes into account of backlog and surplus, but also includes a demand loss component if buffers have a finite capacity and a setup cost if not negligible. Both a steady state and a transient optimization problem are considered and already known results are compared and extended to complete the analysis.