{'fraction_non_alphanumeric': 0.01606145251396648, 'fraction_numerical': 0.0013966480446927375, 'mean_word_length': 5.312775330396476, '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}}
Integration of Simulation Modeling and Comparison of Scheduling Methods to Minimize the Makespan in a Printing Industry

This paper considers the problem of scheduling production activities in a real-life printing industry. The problem is modeled as a two-stage flexible flow shop problem with minimization of the makespan and the number of tardy jobs as the objective. Discrete event simulation has been performed using Extend simulation software to depict the real time model of the print industry. The setup time, processing time and completion time of the prioritized customers were obtained and validated with the real time industry inputs. After validation, the output of simulation data has been used to perform preliminary scheduling experiments. This paper deals with the comparison of three scheduling algorithms such as earliest completion time first (ECT), Earliest start time first (EST) and PCmax algorithm for the calculation of maximum occupancy time of various printing jobs. The results obtained using PC max shows the reduced make span of the printing jobs compared to other two algorithms with approximately 12% improvement in minimizing the makespan. Hence the P||Cmax scheduling method can be implemented in the industry to minimize the maximum occupancy time of a particular printing machine. This motivates the actual implementation of the proposed ILP (PCmax scheduling) procedure for the printing industry.