{'fraction_non_alphanumeric': 0.015968063872255488, 'fraction_numerical': 0.0, 'mean_word_length': 4.9, '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}}
Scheduling jobs on machine cells with some processing constraints

This paper presents an approach for scheduling jobs on machine cells with some processing constraints. A machine cell is a group of some machines. It is a managing unit in a shop. The shop managers assign the personnel and jobs to every cell. The components of cells can be changed with the demands of processed products and managers, which brings about great convenience in the management of semiautomatic manufacturing shops. However, it also increases the complexity of the scheduling problem in such shop. There are various types of cells in a shop. The authors give different scheduling approaches to different types of cells. As to the scheduling algorithm, they advance the WCPM (weighted critical path method) which optimizes the typical CPM and obtains a more satisfactory scheduling result. This approach has been used to implement a job-shop scheduling system for use in a Japanese factory producing flexible circuit boards.