{'fraction_non_alphanumeric': 0.016563146997929608, 'fraction_numerical': 0.002070393374741201, 'mean_word_length': 5.3618421052631575, '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}}
Types of Flexible Job Shop Scheduling: A Constraint Programming Experiment

The scheduling of jobs is a crucial task in every production company and becomes more and more important in the light of the fourth industrial revolution (Industry 4.0) that aims at fully automated processes. One such problem formulation with big practical relevance is the flexible job shop scheduling problem (FJSSP). Since the classic problem formulation is more general than what can be found in most of nowadays industrial environments, this paper introduces different types of flexibility and investigates how the flexibility type, the amount of allowed flexibility and the presence of machine dependent processing times influence the solution quality that can be achieved by a state-of-the-art constraint solver within limited time. Results show that certain forms of flexibility, higher flexibility factors and the absence of machine dependent processing times can ease the problem.