{'fraction_non_alphanumeric': 0.017640573318632856, 'fraction_numerical': 0.0, 'mean_word_length': 4.7834394904458595, '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}}
Batching and sequencing of jobs with order availability at a single facility

A single facility scheduling problem concerned with the production of jobs in a set of customer orders is analysed. Each order consists of several jobs. Based on the concept of group technology, jobs can be grouped into different classes. Jobs in the same class can be processed together in a combined batch, where batches of different classes are initiated with a setup time. Furthermore, the order availability is assumed, which means the finished jobs of an order cannot be shipped out to its customer until all other jobs in the same order have been completed. Under the above production environment, a branch-and-bound algorithm is developed to determine a schedule with the minimum mean flow time of orders. A heuristic is also developed to solve large-sized problems. Computational results of both approaches are reported.