{'fraction_non_alphanumeric': 0.024566473988439308, 'fraction_numerical': 0.0, 'mean_word_length': 5.4766355140186915, '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}}
Reactive Tabu Search for job-shop scheduling problems

A Job-shop scheduling problem (JSP) can be formulated as a combinatorial optimization problem. Up to now, the problem has been solved by various metaheuristic methods such as Genetic Algorithm (GA) and Tabu Search (TS). Recently, practical methods for JSP considering various practical constraints have been developed. However, although one of the challenges for practical production environment is considering various kinds of small quantity production, methods for JSPs considering the situation have not been developed yet. This paper presents a reactive tabu search for JSP toward handling various kinds of small quantity production.