{'fraction_non_alphanumeric': 0.009857612267250822, 'fraction_numerical': 0.0032858707557502738, 'mean_word_length': 5.4822695035460995, '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}}
Simulation study of dispatching rules in stochastic job shop dynamic scheduling

This paper presents a simulation study of dispatching rules in a stochastic job shop dynamic scheduling that considers random job arrivals and stochastic processing times. The computational simulation is employed to study the effects of some widely used dispatching rules in the performance of job shop manufacturing environment, in relation to the makespan, the total tardiness and number of tardy jobs. A simulation model was developed considering an experimental scenario, with 8 machines and 10 different types of orders. Results illustrate the performance of the dispatching rules at stochastic and dynamic shop floor conditions, taking into account the randomness of the orders arrival profile and of the production times, indicating the best option for a scenario in which there are no well established scheduling algorithms.