{'fraction_non_alphanumeric': 0.020999275887038378, 'fraction_numerical': 0.005792903692976104, 'mean_word_length': 5.253393665158371, '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}}
Real-time scheduling for multi headed placement machine

This paper proposes a methodology for real-time scheduling to sequence the pickup and placement of component on multi headed placement machines in printed circuit board (PCB) assembly. The latest technology of surface mount device (SMD) placement machines have a smart feeder carrier that automatically identifies the exact location of each component type on the feeder slot, detects component's missing from the component feeders (and continues working with other component types) and allows a component to be reloaded during a pick and place operation without stopping the operation. Assuming that the components on the feeder carrier may be misplaced or some of the required components are missing, we generate an initial schedule using a greedy constructive heuristic by only considering the available placement points. The initial solution can immediately be used to assemble components for the first PCB. While the placement machine is assembling components, we employ the CPU free time (whilst the robot arm is moving) to improve the initial schedule by using a randomised hill climbing search technique. Thus, the subsequent PCB's will use the improved schedule. Our experimental result on two data sets show that we gain 58.79% and 76.69% (respectively) improvement on assembly cycle time over the initial schedule.