Method for optimization of an order of component mounting, apparatus using the same, and mounter

Description

TECHNICAL FIELD

[0001] The present invention relates to a method for determining the optimal order in which a mounter is to mount electronic components onto a substrate, such as a printed circuit board. In particular, the invention relates to the optimization of the order of component mounting for a mounter equipped with a head unit that picks up a plurality of components and mounts them onto a substrate.

BACKGROUND ART

[0002] The order in which a mounter mounts electronic components on a printed circuit board or other substrate is conventionally optimized to minimize the tact time, which is to say, the time taken by mounting. As part of such optimization, it is necessary to optimize beforehand the order in which the various component feeders containing the components to be mounted are arranged within the mounter.

[0003] One example of such technology is the method for optimizing an order of component mounting disclosed by Japanese Laid-Open Patent Application H05-104364. This method is made up of a number of steps. In a first step, a number of component feeders are sorted into groups based on the mounting speeds of the components, and feeders containing components that are mounted at few positions on a substrate are paired off with feeders in the same group that contain components that are mounted at many positions, thereby evening out the total number of components mounted by each pair of feeders. In the second step, the order of the feeders is determined by arranging the feeder groups in order of mounting speed and arranging the feeders in each group in the pairs determined in the first step. Finally, in the third step, an optimization process is performed with only the mounting order of components as a parameter.

[0004] The above method avoids the need to perform a complex optimization of two parameters, namely the order of feeders and the mounting order of components, and can be completed in a short time since optimization is performed for a single parameter.

[0005] However, the above conventional optimization method has a premise that the head unit picks up only one component at a time from a component feeder during mounting. The method cannot be used by a mounter equipped with an advanced head unit (sometimes called a “line gang pickup head”) that picks up a number of components (such as ten components) and then mounts them on a substrate.

[0006] The recent explosion in demand for electronic appliances such as mobile phones and notebook computers has been accompanied by the development of mounters equipped with high-productivity line gang pickup heads that pick up many components and mount them on substrates. This has resulted in demands for a new optimization method for the order of component mounting for use by such advanced mounters.

DISCLOSURE OF THE INVENTION

[0007] In view of the stated problem, it is a first object of the present invention to provide (a) an optimizing method for an order of component mounting used by a highly productive mounter, which is to say, an order of component mounting that enables components to be mounted with increased productivity, as well as (b) an optimizing apparatus that uses this method, and (c) a mounter that mounts components according to a method that has been optimized by this method.

[0008] As a more specific example, the invention has an object of providing a method, etc., for optimizing an order of component mounting for a mounter that is equipped with a line gang pickup head which picks up a plurality of components and mounts the components on a substrate.

[0009] The stated first object can be realized by an optimizing method that optimizes, using a computer, a component mounting order in which a production line composed of at least one mounter mounts a plurality of components on a substrate, the optimizing method including: a classifying step for classifying the plurality of components into component groups by setting groupings of components whose heights are equal or within a predetermined range as the component groups; and a sorting step for determining a mounting order for each component group so that components belonging to component groups of low components are mounted on the substrate first.

[0010] As a result of using the above method, components are mounted in order starting with the groups of low components. This avoids problems that occur when high components are mounted on a substrate first, such problems including restrictions on the movement of the line gang pickup head that result in increases in mounting time, and collisions between components that have been picked up by the line gang pickup head and components that have already been mounted on the substrate. This also makes fine pitch mounting (where components are mounted at high speed at extremely close positions on a substrate) possible, and increases the quality of mounting.

[0011] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order in which a mounter equipped with a first stage and second stage mounts a plurality of components on a substrate, the first and second stage being independent and each including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that store components, and mounts the components on a substrate, the optimizing method assigning component cassettes to the first stage and second stage so as to even out a load of the stages during mounting and including: an initial assigning step for assigning, according to predetermined rules, each of the plurality of components to one of the first and second stages, and for specifying a plurality of mountains, a mountain being a plurality of related component tapes, a component tape being a group of components of a same type, for the assigned components so as to maximize the number of times the mounting heads can pick up n components, and a rearranging step for changing, by reassigning components between the first and second stages in units of component tapes or mountains, a pattern in which components have been assigned to the first and second stages in the initial assigning step so as to make load levels of the first and second stages approximately equal, the load level of a stage showing a magnitude of processing required to mount all of the components assigned to the stage.

[0012] As a result of using the above method, when components are successively mounting by a production line that is composed of two or more independent mounters, the processing loads of each stage can be balanced, thereby increasing the pipeline efficiency of the production line and reducing the overall mounting time for components.

[0013] The stated first object can also be realized by an optimizing method for optimizing, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the optimizing method including: a classifying step for classifying the plurality of components into a small component group and a general component group, based on heights of components; a small component optimizing step for optimizing, using a first algorithm, a mounting order for components belonging to the small component group; and a general component optimizing step for optimizing, using a second algorithm that differs from the first algorithm, a mounting order for components belonging to the general component group.

[0014] The above method takes advantage of the characteristics of the components mounted onto a majority of circuit boards, such as those found in mobile phones. For such circuit boards, a great many (such as 90%) of the components are small components called “chip components”, such as resistors, with the few (such as 10%) remaining components being larger, irregularly shaped components, such as connectors, that are called general components. As a result, the above method can achieve a high optimization level relative to the time required for optimization.

[0015] As a specific example, an algorithm that performs optimization at high-speed by forming pickup patterns in which ten tasks are simultaneously picked up may be used for small parts. A flexible algorithm that finds an optimal mounting order by switching between potential mounting orders with a mounting time of each task as an evaluation function may be used for general parts, however By doing so, the overall optimization level can be raised.

[0016] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the mounter including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes for a case where component tapes are held in the component cassettes, a component tape being a group of components of a same type and the optimizing method optimizing an arrangement of the components tapes in the component cassettes, the optimizing method including: a histogram generating step for generating a component histogram in which the plurality of components to be mounted are shown in units of component tapes that have been arranged in descending order of a number of components to be mounted for each component tape; and a diagram generating step (1) for taking partial histograms, which are each a part of the generated component histogram, (2) for arranging the partial histograms at two-dimensional coordinates where an arrangement of component cassettes is shown by a horizontal axis and a number of pickup operations by the mounting head is shown by a vertical axis, so that the partial histograms arranged in two dimensions form a diagram, the diagram being generated so that for as many rows in the diagram as possible, a number of components on the row is n or an integer multiple of n, and (3) for setting an arrangement of component tapes corresponding to the generated diagram as an optimal arrangement of component tapes.

[0017] When the above method is used, the width of a diagram formed from a component histogram showing the optimized arrangement of component tapes is close to n (the number of components that can be picked up by the line gang pickup head) or an integer multiple of n. As a result, the line gang pickup head can often pick up n components in a single nozzle stroke, so that mounting can be completed for all of the components with a low number of nozzle strokes.

[0018] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the mounter including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes for a case where component tapes are held in the component cassettes, a component tape being a group of components of a same type and the optimizing method optimizing an arrangement of the components tapes in the component cassettes, the optimizing method including: a histogram generating step for generating a component histogram in which the plurality of components to be mounted are shown in units of component tapes that have been arranged in descending order of a number of components to be mounted for each component tape; a cutting down step for repeatedly removing pickup patterns, each of which is a series of n consecutive components aligned in a horizontal direction, from the generated component histogram so that component tapes with few components to be mounted are taken first, the cutting down step ending when no more pickup patterns of n components can be taken; a core crush processing step for reshaping a remaining part of the component histogram after the cutting down step has been performed with an aim of producing a diagram which is n-components wide; and a combining step for arranging all of the components removed during the cutting down step and the components in the reshaped part of the component histogram at corresponding positions on a horizontal axis, combining the arranged components to produce an updated component histogram, and setting an arrangement of component tapes corresponding to the updated component histogram as an optimized arrangement for the component tapes.

[0019] Performing the cutting down process in this way has the following advantages over a task group method that generates tasks where n components can be simultaneously picked up (or in other words, task groups) by finding sets of n component tapes with the same number of components to be mounted and simultaneously mounting one component from each of the n component tapes.

[0020] Firstly, in the cutting down process, the component histogram is divided in units of component tapes and the resulting divisions can be assigned to the front and rear stages, so that compared to the task group method, components can be moved in smaller units, thereby reducing the frequency with which gaps appear on the Z-axis (i.e., in component supplying units) and facilitating adjustments to the balance of the front and rear stages.

[0021] Secondly, in the task group method, components are divided within task groups, and the resulting component tapes are arranged into component cassettes, while in the cutting down process, components are only divided for the core cassette tapes, resulting in a lower number of divisions being produced. This suppresses the number of component cassettes required to hold component tapes that are generated by the division of components.

[0022] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order for a mounter, the mounter being equipped with a mounting head that picks up components from an arrangement of component cassettes that store components and mounts the components on a substrate, the optimizing method including: an initializing step for generating an initial state that is a first state to be used, a state being one out of all potential mounting orders for all of the components in the component mounting order; a state changing step for generating a second state by provisionally changing the first state; a judging step for judging whether both (1) the mounter can mount all of the components according to a mounting order that corresponds to the generated second state, and (2) the mounter takes less time when all of the components are mounted according to the second state than when all of the components are mounted according to the first state; and a repeated control step for optimizing the mounting order of the components by setting the second state as a new first state when a judging step judges that the mounter can mount all of the components and that less time is taken when the components are mounted according to the second state, and then having the state changing step and the judging step repeatedly performed so that the first state is updated.

[0023] As a result, a global minimum in a distribution of tact times plotted against states can definitely be found as the optimal solution.

[0024] Here, in the state changing step, all of the possible states may be classified into a plurality of groups, and the second state may be generated so that a probability of containing the state generated as the second state is equal for each of the plurality of groups.

[0025] In the above method, an optimal solution is found by incorporating both a local search and a global search. This avoids the undesired result of the method finding a solution that is locally optimal but not globally optimal.

[0026] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method determining an arrangement of tasks where a task is a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, wherein the mounting head can be equipped with a maximum of n interchangeable nozzles for picking up components, the components to be mounted include at least two types of components that are picked up using different types of nozzle, and the optimizing method includes: a histogram generating step for generating, for a case where groups of components of the same type are treated as single component tapes and for each nozzle type required by the components to be mounted, a two-dimensional histogram in which a horizontal axis represents an arrangement of component tapes and a vertical axis represents a number of components to be mounted, the component tapes in each histogram for each nozzle type being arranged in descending order of the number of components to be mounted, and for arranging the generated histograms on a horizontal axis; and a task generating step for repeatedly scanning the generated histograms on the horizontal axis, removing components to generate tasks, and arranging the generated tasks in order, until all of the components in the arranged histograms have been removed.

[0027] Even when performing optimization for general components that need to be picked up using different types of nozzles, the initial state for the search of an optimal mounting order is not a randomly selected mounting order, but a mounting order that increases (using “appropriation”) the numbers of components picked up in single nozzle strokes by the line gang pickup head, in the same way as with small components.

[0028] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up components from an arrangement of component cassettes that hold the components and mounts the components on a substrate, for a case where groups of components of the same type are treated as component tapes and the optimizing method optimizes an arrangement of component tapes that are held in the component cassettes while respecting restrictions that require certain component tapes to be arranged at certain positions, the optimizing method including: a provisional optimizing step for optimizing, in units of component tapes, an arrangement of all the components to be mounted without considering the restrictions; and a changing step for changing the arrangement of component tapes produced by the provisional optimizing step so that the arrangement respects the restrictions.

[0029] With the above method, at a first stage, components are optimized on the assumption that are not subject to a fixed arrangement, so that a same optimization algorithm is used regardless of whether or not a fixed arrangement is present for components. This means that a single algorithm can be used regardless whatever fixed arrangement is present.

[0030] In this algorithm that handles a fixed arrangement, an ideal arrangement of component tapes for the case where optimization is performed in the absence of a fixed arrangement is broken down to deal with restrictions due to the presence of the fixed arrangement. This makes it possible for a user to compare the mounting time for the ideal arrangement of component tapes with the mounting time for the arrangement where this is a fixed arrangement of component tapes.

[0031] As a result, users can be provided with information that allows them to compare the advantage of the ease of equipment maintenance when a fixed arrangement is used with the advantage of a shorter mounting time when mounting time is not used, and so to reconsider the tradeoff involved when a fixed arrangement is used.

[0032] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up components from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method including: a task group generating step for generating task groups that are arrangements of tasks, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components; and a task interchanging step for changing an order of tasks within each task group so as to minimize a time required to mount all components each task group, and setting a mounting order of components corresponding to a resulting order of tasks as an optimal component mounting order.

[0033] The above method reduces the distance moved by the line gang pickup head when returning from a mounting of components in one task to pick up components in a next task. This reduces the total mounting time for all the task groups.

[0034] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method including: a task group generating step for generating task groups that are arrangements of tasks, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components; and a task interchanging step for changing, within each task group, a mounting order of components so as to minimize a time required to mount all components composing the task group, without changing a combination of component types in each task.

[0035] Here, the task interchanging step may include: a detecting step for detecting, for a case where for each task, straight lines are drawn between mounting points on the substrate of adjacent components that are picked up, whether there is an intersection between straight lines that belong to two different tasks that are composed of combinations of the same component types; and an interchanging step for interchanging, when the detecting step has detected an intersection, components of the same component type between the two tasks to eliminate the detected intersection.

[0036] As a result, inefficient mounting paths that are used to mount components in tasks can be eliminated, so that the overall distance moved during the mounting of components can be reduced. This in turn reduces the overall mounting time of each task group.

[0037] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that (1) picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes including double cassettes that are capable of holding two types of components, and (2) mounts the components on a substrate, the optimizing method respecting a restriction that requires the two types of components held in a double cassette to be tape-held components with a same feed pitch, and optimizing an arrangement of component tapes for a case where components are arranged in component cassettes in units of component tapes, a component tape being a group of components of a same type, the optimizing method including: a first optimizing step for determining, for all components that use a first feed pitch, an order of component tapes that maximizes a number of times the mounting head can pick up n components; a first folding step for cutting the determined order of components at a central position into a former half and latter half and combining the former half and latter half with component tapes belonging to the former and latter halves in alternating positions; a second optimizing step for determining, for all components that use a second feed pitch, an order of component tapes that maximizes a number of times the mounting head can pick up n components; a second folding step for cutting the determined order of components at a central position into a former half and latter half and combining the former half and latter half with component tapes belonging to the former and latter halves in alternating positions; and a combining step for combining an arrangement of component tapes produced by the first folding step with an arrangement of component tapes produced by the second folding step and setting a result of combining as an optimal arrangement of component tapes.

[0038] With the above method, an arrangement of component tapes is determined so as to maximize a number of times that a line gang pickup head can simultaneously pick up n components, while maintaining the pairs of component tapes with the same feed pitches. This method optimizes the order of component mounting, even for a mounter that users double cassettes.

[0039] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that has n nozzles, n being no less than 2, and so can pick up a maximum of n components from an arrangement of component cassettes that hold the components and mount the components on a substrate, the optimizing method optimizing an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, while respecting a restriction whereby only m nozzles out the n nozzles can mount components in a specific region of the substrate, the optimizing method including: a component histogram generating step for arranging, in units of component tapes, components that are not arranged in the specific region in descending order of a number of components to be mounted to produce a first component histogram and for arranging, in units of component tapes, components that are arranged in the specific region in descending order of a number of components to be mounted to produce a second component histogram; a cutting down step for repeatedly removing pickup patterns composed of n consecutive components in a horizontal direction from each of the first and second component histograms in order so that components in component tapes with few components to be mounted are removed first, until no more pickup patterns can be removed, and arranging the pickup patterns at corresponding positions on a first coordinate axis and a second coordinate axis; a core crush processing step for arranging, at corresponding positions on the first and second coordinate axes, component tapes in the first and second component histograms after the cutting down step, with an aim of producing a diagram which is n-components wide; and a combining step for combining the component histograms arranged on the first and second coordinate axes by the core crush processing step and setting an arrangement of component tapes that corresponds to a component histogram that results from the combining as the optimal arrangement of component tapes.

[0040] As a further possibility, the stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order in which a mounter equipped with a first stage and second stage mounts a plurality of components on a substrate, the first and second stage being independent and each including a mounting head that picks up components from an arrangement of component cassettes that store components and mounts the components on a substrate, the optimizing method assigning component cassettes to the first stage and second stage while respecting a restriction whereby only one of the first and second stages is able to mount components in a specific region of the substrate, the optimizing method including: a first assigning step for specifying, for all the components in the mounting order to be optimized, component tapes, a component tape being a group of components of a same type, that include components that can only be mounted by the first stage, and assigning the specified component tapes to the first stage; a second assigning step for specifying, for all the components in the mounting order to be optimized, component tapes that include components that can only be mounted by the second stage, and assigning the specified component tapes to the second stage; and a dividing step for assigning component tapes, for all the components in the mounting order to be optimized, that were not assigned by either the first assigning step or the second assigning step to one of the first and second stages.

[0041] The order of component mounting can be optimized for a case when there are restrictions on the mounting operation performed by the line gang pickup head when mounting components on a substrate, such as an LL-sized substrate, is longer than normal in the transportation direction, or a case when there are restrictions on the mounting operation performed by the line gang pickup head when mounting components on a substrate, such as an XL-sized substrate, is longer than normal in a direction perpendicular to the transportation direction.

[0042] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method optimizing an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, the optimizing method including: a sorting step for arranging, in units of component tapes, the plurality of components to be mounted on a first coordinate axis in descending order of a number of components; and an interchanging step for repeatedly removing component tapes in descending order of components from an arrangement on the first coordinate axis produced in the sorting step and arranging the component tapes on a second coordinate axis that corresponds to an arrangement of component cassettes, wherein the interchanging step (1) arranges a first component tape removed from the arrangement on the first coordinate axis on the second coordinate axis, (2) arranges each of a second to an mth component tape removed from the arrangement on the first coordinate axis on the second coordinate axis at a position that alternates between a start and an end of an arrangement of preceding component tapes on the second coordinate axis, and (3) arranges each component tape from an m+1th component tape onwards on the second coordinate axis at an end of an arrangement of preceding component tapes on the second coordinate axis.

[0043] With the above method, the component tapes are interchanged to produce a component histogram in the shape of a triangle that has one side steeper than another side. This processing produces, without dividing component tapes (and increasing the total number of component tapes required), a component histogram that is close to an ideal form resulting from optimization through a core crush process. When there is a restriction in the number of component tapes that can be used or limited free space in the component supplying units, components can be arranged in a manner that enables the components to be mounted with a low number of tasks.

[0044] The stated first object can also be realized by an optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method optimizing, for a case where there are a plurality of sets of NC (Numeric Control) data corresponding to a plurality of different substrates, an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, the optimizing method including: a detecting step for detecting, from all the sets of NC data, each NC data group, an NC data group being a plurality of sets of NC data that have a predetermined resemblance, including a characteristic whereby sets of NC data contain matching types of components; a combining step for combining all sets of NC data in each NC data group to produce a new set of NC data for each NC data group; and an arrangement determining step for determining an optimal arrangement of component tapes for each set of NC data after the combining step, the sets of NC data being arranged in descending order of a number of substrates to be manufactured for each set of NC data, wherein when the arrangement determining step determines an arrangement of component tapes for each set of NC data, matching component tapes that have already been arranged for a previous set of NC data-are not arranged again.

[0045] With the above method, it is possible to optimize an arrangement of component tapes that is used by two or more sets of NC data. If the component supplying units of mounters are constructed in accordance with an arrangement of component tapes determined by this method, it is no longer necessary to change the arrangement of component cassettes set in the component supplying units when switching between the types of substrate being produced by the mounters.

BRIEF DESCRIPTION OF THE DRAWINGS

[0046]
FIG. 1 shows the entire construction of a mounting system 10 according to the present invention.

[0047]
FIG. 2 is an overhead view showing the overall construction of a mounter used in the present component mounting system.

[0048]
FIG. 3 is a depiction of the positional relationship between the line gang pickup head of a mounter and the component feeders.

[0049]
FIG. 4A shows one example of the specific construction of the four component supplying units within the two stages provided in the present mounter.

[0050]
FIG. 4B is a table showing the number of component feeders and their positions on the Z-axis.

[0051]
FIGS. 5A and 5B are a drawing and table showing examples of the positions in the Z-axis of component supplying units where components can be picked up by a line gang pickup head with ten nozzles.

[0052]
FIGS. 6A to 6D show various chip-shaped electronic components to be mounted.

[0053]
FIG. 7 shows one example of a carrier tape that holds components and the supply reel for this carrier tape.

[0054]
FIG. 8 shows a component feeder in which taped electronic components have been loaded.

[0055]
FIG. 9 is a block diagram showing the hardware construction of an optimization apparatus.

[0056]
FIG. 10 shows an example of the mounting point data shown in FIG. 9.

[0057]
FIG. 11 shows an example of the component library shown in FIG. 9.

[0058]
FIG. 12 shows an example of the mounter information shown in FIG. 9.

[0059]
FIG. 13 is a functional block diagram showing the construction of the optimization apparatus.

[0060]
FIG. 14 shows the functional modules that compose the optimization program shown in FIG. 9.

[0061]
FIG. 15A shows the component groups that are generated by the component group generating part, while FIG. 15B shows one example of a component table generated in the component group generating process performed by the component group generating part.

[0062]
FIG. 16 shows the processing whereby the first LBM part 315a of the tact time balance optimization part allocates task groups to stages.

[0063]
FIG. 17 shows the distribution of tact times before the estimated tact time balancing process performed by the second LBM part of the tact time balance optimization part, the movement of task groups performed by the optimization, and the distribution of tact times after the optimization.

[0064]
FIG. 18 is a flowchart for the optimization process for the tact time balance performed by the second LBM part of the tact time balance optimization part.

[0065]
FIG. 19 is a flowchart showing a simplification of the optimization of the order of mounting for small components performed by the small component optimizing part of the state optimizing part.

[0066]
FIG. 20 is used to explain the pickup patterns.

[0067]
FIG. 21 shows the component histogram for components for which the task group generation method generates pickup patterns and the pickup patterns generated from this component histogram.

[0068]
FIG. 22 shows the unarranged part of the component histogram, and the pickup patterns that are generated from this unarranged part of the component histogram.

[0069]
FIG. 23 shows a component histogram for all of the components for which pickup patterns are generated by the cut down procedure.

[0070]
FIG. 24 shows how ten consecutive components are removed at a time (i.e., “cut down”) from the component histogram shown in FIG. 23.

[0071]
FIG. 25 shows a component histogram for the components that are left over after cut down process shown in FIG. 24.

[0072]
FIG. 26 shows how a diagram is generated from the component histogram shown in FIG. 25 in accordance with the task group generating method.

[0073]
FIG. 27 shows the pickup patterns for component tapes whose positions on the Z-axis have been determined by the cut down procedure.

[0074]
FIG. 28 shows a component histogram (constructed without changing the Z-axis) corresponding to the pickup patterns shown in FIG. 27.

[0075]
FIG. 29 is a flowchart for the procedure used when optimizing the order of mounting for components according to random selection.

[0076]
FIG. 30 shows how two mounting points are interchanged according to random selection.

[0077]
FIG. 31 shows the optimization of the mounting order of components due to intersection disentanglement FIG. 32 shows the return paths for the line gang pickup head that are generated when optimizing the order of tasks using the return optimization method.

[0078]
FIG. 33 shows the return paths for the line gang pickup head that are generated when a plurality of pickup patterns include the same position.

[0079]
FIG. 34A is a flowchart showing the procedure used when the general component optimizing part optimizes the mounting order of general components. FIG. 34B shows the relationship between states and tact times to illustrate the approach used by this optimization to find the optimal solution.

[0080]
FIG. 35 is a flowchart showing the detailed procedure used when performing optimization according to the hill-climbing method (steps S551, S553) shown in FIG. 34A.

[0081]
FIG. 36 is a flowchart showing the detailed procedure used when performing optimization according to the multicanonical method (step S552) shown in FIG. 34A.

[0082]
FIG. 37 shows one example of the intermediate representations used by the general component optimizing part 316b, and how these are converted to an arrangement on the Z-axis.

[0083]
FIG. 38 is a component histogram for explaining the concept of optimization using the “task group method”.

[0084]
FIG. 39 is a flowchart showing the optimization processing for small components.

[0085]
FIG. 40A shows a component histogram in which there are 21 component tapes, and FIG. 40B shows how the cut down procedure is performed on this component histogram.

[0086]
FIG. 41 is a component histogram showing how the core crush process is performed.

[0087]
FIG. 42 is a component histogram showing the state after the cut down process and core crush process have been performed.

[0088]
FIG. 43 shows some mounting paths in order to illustrate the concept of optimization through intersection disentanglement.

[0089]
FIG. 44 shows the movement of the line gang pickup head in order to explain the concept of return optimization.

[0090]
FIG. 45 is a component histogram showing the concept of optimization in the presence of a restriction due to a fixed arrangement.

[0091]
FIG. 46 shows the restricted regions on an LL-sized substrate and an XL-based substrate, based on the limitation on the movement of the line gang pickup head when mounting components.

[0092]
FIG. 47 is a component histogram that is used to illustrate the concept of optimization for LL-sized substrates.

[0093]
FIG. 48 is a component histogram that is used to illustrate step (1) of optimization according to the cut down procedure.

[0094]
FIG. 49 is a component histogram that is used to illustrate step (2) of the same procedure.

[0095]
FIG. 50 is a component histogram that is used to illustrate step (3) of the same procedure.

[0096]
FIG. 51 is a component histogram that is used to illustrate step (4) of the same procedure.

[0097]
FIG. 52 is a component histogram that is used to illustrate step (5) of the same procedure.

[0098]
FIG. 53 is a component histogram that is used to illustrate step (6) of the same procedure.

[0099]
FIG. 54 is a component histogram that is used to illustrate step (7) of the same procedure.

[0100]
FIG. 55 is a component histogram that is used to illustrate step (8) of the same procedure.

[0101]
FIG. 56 is a component histogram that is used to illustrate step (9) of the same procedure.

[0102]
FIG. 57 is a component histogram that is used to illustrate step (10) of the same procedure.

[0103]
FIG. 58 is a component histogram that is used to illustrate step (11) of the same procedure.

[0104]
FIG. 59 is a component histogram that is used to illustrate step (12) of the same procedure.

[0105]
FIG. 60 is a component histogram that is used to illustrate step (13) of the same procedure.

[0106]
FIG. 61 is a component histogram that is used to illustrate step (14) of the same procedure.

[0107]
FIG. 62 is a component histogram that is used to illustrate step (15) of the same procedure.

[0108]
FIG. 63 is a component histogram that is used to illustrate step (16) of the same procedure.

[0109]
FIG. 64 is a component histogram that is used to illustrate step (17) of the same procedure.

[0110]
FIG. 65 is a component histogram that is used to illustrate step (18) of the same procedure.

[0111]
FIG. 66 is a component histogram that is used to illustrate step (19) of the same procedure.

[0112]
FIG. 67 is a component histogram that is used to illustrate step (20) of the same procedure.

[0113]
FIG. 68 is a component histogram that is used to illustrate step (21) of the same procedure.

[0114]
FIG. 69 is a component histogram that is used to illustrate step (22) of the same procedure.

[0115]
FIG. 70 is a component histogram that is used to illustrate step (23) of the same procedure.

[0116]
FIG. 71 is a component histogram that is used to illustrate steps (1) to (3) in the optimization procedure performed by dividing cassettes using a parallelogram-shaped template.

[0117]
FIG. 72 is a component histogram that is used to illustrate steps (4) to (6) of the same procedure.

[0118]
FIG. 73 is a component histogram that is used to illustrate steps (7) to (8) of the same procedure.

[0119]
FIG. 74 is a component histogram that is used to illustrate part of step (9) of the same procedure.

[0120]
FIG. 75 is a component histogram that is used to illustrate the remaining part of step (9) and step (10) of the same procedure.

[0121]
FIG. 76 is a component histogram that is used to illustrate steps (1) to (3) in the optimization procedure performed by dividing cassettes using a rectangle-shaped template.

[0122]
FIG. 77 is a component histogram that is used to illustrate steps (3) to (5) of the same procedure.

[0123]
FIG. 78 is a component histogram that is used to illustrate part of step (5) of the same procedure.

[0124]
FIG. 79 is a component histogram that is used to illustrate the remaining part of step (5) of the same procedure.

[0125]
FIG. 80 shows mounting paths used to explain the optimization performed according to intersection disentanglement.

[0126]
FIG. 81 shows mounting paths that illustrate the algorithm used for intersection disentanglement.

[0127]
FIG. 82 shows mounting paths that illustrate an application of the algorithm used for intersection disentanglement.

[0128]
FIG. 83 shows mounting paths taken by the line gang pickup head to illustrate the concept of return optimization.

[0129]
FIG. 84A shows the “return” operation performed when there are a plurality of mounting points for the same component feeder, while FIG. 84B shows the results of simulating the return paths of the line gang pickup head when using the return optimization algorithm.

[0130]
FIG. 85 is a component histogram that is used to illustrate part of step (1) of the optimization performed in the presence of restrictions whereby there is a fixed arrangement of double cassettes.

[0131]
FIG. 86 is a component histogram that is used to illustrate step (2) of the same procedure.

[0132]
FIG. 87 is a component histogram that is used to illustrate step (3) of the same procedure.

[0133]
FIG. 88 is a component histogram that is used to illustrate step (4) of the same procedure.

[0134]
FIG. 89 is a component histogram that is used to illustrate step (5) of the same procedure.

[0135]
FIG. 90 is a component histogram that is used to illustrate step (6) of the same procedure.

[0136]
FIG. 91 is a component histogram that is used to illustrate step (7) of the same procedure.

[0137]
FIG. 92 is a component histogram that is used to illustrate step (8) of the same procedure.

[0138]
FIG. 93 is a component histogram that is used to illustrate step (9) of the same procedure.

[0139]
FIG. 94 is a component histogram that is used to illustrate step (10) of the same procedure.

[0140]
FIGS. 95A and 95B show examples of the mounting times for the front stage and the rear stage when space is available on the Z-axis, as well as the tact time balancing processing performed in this case. FIGS. 95C and 95D show examples of the mounting times for the front stage and the rear stage when no space is available on the Z-axis, as well as the tact time balancing processing (swapping) performed in this case.

[0141]
FIG. 96 is a component histogram that is used to illustrate step (1) of the optimization performed by the cut down procedure on double cassettes.

[0142]
FIG. 97 is a component histogram that is used to illustrate step (2) of the same procedure.

[0143]
FIG. 98 is a component histogram that is used to illustrate step (3) of the same procedure.

[0144]
FIG. 99 is a component histogram that is used to illustrate step (4) of the same procedure.

[0145]
FIG. 100 is a component histogram that is used to illustrate step (5) of the same procedure.

[0146]
FIG. 101 is a component histogram that is used to illustrate step (6) of the same procedure.

[0147]
FIG. 102 is a component histogram that is used to illustrate step (7) of the same procedure.

[0148]
FIG. 103 is a component histogram that is used to illustrate step (8) of the same procedure.

[0149]
FIG. 104 is a component histogram that is used to illustrate step (9) of the same procedure.

[0150]
FIG. 105 is a component histogram that is used to illustrate step (10) of the same procedure.

[0151]
FIG. 106 is a component histogram that is used to illustrate step (11) of the same procedure.

[0152]
FIGS. 107A and 107B are used to explain the nozzle interchanging algorithm. FIG. 107A is a table showing the types of component to be mounted (the number of the nozzle that can be used) and the number of components to be mounted for each type. FIG. 107B is a component histogram showing the operation performed.

[0153]
FIG. 108 shows an example display of the “main screen”.

[0154]
FIG. 109 shows an example display of the “open” screen.

[0155]
FIG. 110 shows an example display of the “optimization details” screen.

[0156]
FIG. 111 shows an example display of the “set no. of cassettes” screen.

[0157]
FIG. 112 shows an example display of the “set component division numbers” screen.

[0158]
FIG. 113 shows an example display of the “set no. of nozzles” screen.

[0159]
FIG. 114 shows an example display of the “select nozzle station” screen.

[0160]
FIG. 115 shows an example display of the “options” screen.

[0161]
FIG. 116 shows an example display of the “Z-axis information” screen.

[0162]
FIG. 117 shows an example display of the “nozzle station information” screen.

[0163]
FIG. 118 is a flowchart showing the procedure of the algorithm that determines efficient pickup patterns (a Z-axis arrangement) without dividing components.

[0164]
FIG. 119 shows an arrangement of component tapes that illustrates the procedure shown by the flowchart in FIG. 118.

[0165]
FIG. 120 is used to illustrate the optimization level of the optimization algorithm shown in FIG. 118, and is a component histogram in which the component tapes have been arranged simply in descending order (from right to left) of the number of components to be mounted.

[0166]
FIG. 121 shows nozzle stroke number patterns produced when the component histogram shown in FIG. 120 is subjected to the cut down process.

[0167]
FIG. 122 shows a component histogram produced by rearranging the component histogram in accordance with the procedure shown in FIG. 118.

[0168]
FIG. 123 shows the nozzle stroke number patterns produced when the component histogram shown in FIG. 122 is subjected to the cut down process.

[0169]
FIG. 124 is a flowchart that shows the procedure which assigns mountains to the left block and the right block.

[0170]
FIGS. 125A to 125D show the processing performed in the flowchart shown in FIG. 124.

[0171]
FIGS. 126A to 126D show another example of the processing performed in the flowchart shown in FIG. 124.

[0172]
FIG. 127 is a flowchart showing the procedure used by an algorithm that estimates the number of double-cassette feeders used.

[0173]
FIG. 128 shows the division of the component tapes belonging to a component group.

[0174]
FIGS. 129A to 129D show an example calculation of the required number of double-cassette feeders.

[0175]
FIG. 130 is a flowchart showing the procedure used by an optimization algorithm that optimizes the arrangement in the Z-axis while considering the fixed pairings of double-cassette feeders.

[0176]
FIGS. 131A and 131B show the processing performed in step S660 of FIG. 130.

[0177]
FIGS. 132A and 132B show the processing performed in step S661 of FIG. 130.

[0178]
FIGS. 133A and 133B show the processing performed in step S662 of FIG. 130.

[0179]
FIGS. 134A and 134B show the processing performed in step S664 of FIG. 130.

[0180]
FIG. 135 is a flowchart showing the procedure used by an optimization algorithm that considers the presence of a defective head.

[0181]
FIG. 136 compares the pickup patterns for the case where there is a defective head and the case when there is no defective head, and the corresponding component histogram.

[0182]
FIG. 137 shows the pickup patterns (produced by the cut down process and core process) corresponding to the component histogram shown in FIG. 136 for the case when there is no defective head.

[0183]
FIG. 138 shows the pickup patterns corresponding to the component histogram shown in FIG. 136 for the case when mounting head number 2 is a defective head.

[0184]
FIG. 139 is a-flowchart showing the entire procedure used when simultaneously optimizing a plurality of sets of NC data.

[0185]
FIG. 140 is a flowchart showing the entire procedure used when optimizing the Z arrangement for a plurality of sets of NC data.

[0186]
FIGS. 141A and 141B show a specific example that illustrates the three methods that determine the initial Z-axis arrangement.

[0187]
FIG. 142 is a flowchart showing the procedure for the algorithm that generates initial tasks according to the “appropriation” method.

[0188]
FIGS. 143A to 143C show a specific example of the operation in the former half (S720 to S722) of the processing in the flowchart shown in FIG. 142.

[0189]
FIGS. 144A to 144E show a specific example of the operation in the latter half (S723 to S726) of the processing in the flowchart shown in FIG. 142.

[0190]
FIG. 145 shows the effect of optimization according to the “appropriation” method.

[0191]
FIG. 146 is a flowchart showing the procedure used by an optimization algorithm for nozzle interchanges that uses “task division”.

[0192]
FIGS. 147A to 147D show a specific example of the operation performed by the processing in the flowchart shown in the FIG. 146.

[0193]
FIG. 148 is a flowchart showing the procedure used by an optimization algorithm that uses “task combining”.

[0194]
FIGS. 149A to 149C show a specific example of the operation performed by the processing in the flowchart shown in the FIG. 148.

[0195]
FIG. 150 shows a nozzle pattern before optimization is performed according to “task interchanging”.

[0196]
FIG. 151 is a flowchart showing the procedure used by an optimization algorithm that uses “task interchanging”.

[0197]
FIG. 152 shows examples of the nozzle patterns obtained by optimization that uses “task interchanging”.

[0198]
FIG. 153 shows the restrictions on nozzle interchanges due to the movable range of the line gang pickup head above the nozzle station.

[0199]
FIGS. 154A to 154C show the restrictions on component pickup due to the movable range of the line gang pickup head over the component supplying units.

[0200]
FIG. 155 is a flowchart showing the procedure used when confirming whether mounting is possible for a given nozzle arrangement in the nozzle station.

[0201]
FIG. 156 shows an example of two nozzle patterns for the case when the number of used nozzles is six.

[0202]
FIG. 157 is a flowchart showing the timing for interchanging the nozzles that pick up components using the nozzle patterns shown in FIG. 156.

BEST MODE FOR CARRYING OUT THE INVENTION

[0203] The following describes an embodiment of the present invention with reference to the attached drawings. The meanings of the technical terms used in this specification are given as the terms appear in the text and in the “Glossary” section at the end of this specification.

[0204] Sections

[0205] 1 Mounting System

[0206] 1.1 Construction of the Mounter

[0207] 1.2 Restrictions for the Mounter

[0208] 1.2.1 Line Gang Pickup Head

[0209] 1.2.2 Component Recognizing Camera

[0210] 1.2.3 Component Supplying Units

[0211] 1.2.4 Component Feeders

[0212] 1.2.5 Other Restrictions

[0213] 1.3 Optimization Apparatus

[0214] 1.3.1 Hardware Construction of the Optimization Apparatus

[0215] 1.3.2 Software Construction of the Optimization Apparatus

[0216] 2 Operation of the Optimization Apparatus (Overview)

[0217] 2.1 Generation Of Component Groups

[0218] 2.2 Tact Time Balancing Process

[0219] 2.3 Optimization For Small Components

[0220] 2.4 Task Group Generation Method

[0221] 2.5 Cut Down Process

[0222] 2.6 Random Selection (The “Greedy Method”)

[0223] 2.7 Intersection Disentanglement

[0224] 2.8 Return Optimization

[0225] 2.9 Optimization For General Components

[0226] 3 Operation of the Optimization Apparatus (Details)

[0227] 3.1 Cut Down Procedure

[0228] 3.1.1 Overview Of The Task Group Generation Method

[0229] 3.1.2 Problems With The Task Group Generation Method

[0230] 3.1.3 Cut Down Procedure

[0231] 3.1.4 Optimization For Small Components According To The Cut Down Procedure

[0232] 3.1.5 Individual Processes

[0233] 3.2 Intersection Disentanglement

[0234] 3.2.1 Overview Of The Greedy Method

[0235] 3.2.2 Problems With The Greedy Method

[0236] 3.2.3 Intersection Disentanglement

[0237] 3.2.4 Related Individual Processes

[0238] 3.3 Return Optimization

[0239] 3.3.1 Evaluation of the Component Mounting Operation

[0240] 3.3.2 Necessity of Optimizing the Return Process

[0241] 3.3.3 Return Optimization

[0242] 3.3.4 Related Individual Processes

[0243] 3.4 Fixed Arrangement Processing

[0244] 3.4.1 Overview

[0245] 3.4.2 Related Individual Processes

[0246] 3.5 Dealing with LL-sized Substrates

[0247] 3.5.1 Overview

[0248] 3.5.2 Interchanging Component Tapes On The Z-Axis

[0249] 3.5.3 Changes To The Pickup Method

[0250] 3.5.4 Related Individual Processes

[0251] 3.6 Dealing With XL-Sized Substrates

[0252] 3.6.1 Overview

[0253] 3.6.2 Related Individual Processes

[0254] 3.7 Estimated Tact Time Balancing Process

[0255] 3.7.1 Overview

[0256] 3.7.2 Levels On Which Balance Adjusting Is Performed

[0257] 3.7.3 Related Individual Processes

[0258] 3.8 Tact Time Balancing Process

[0259] 3.8.1 Overview

[0260] 3.8.2 Levels On Which Balance Adjusting Is Performed

[0261] 3.8.3 Related Individual Processes

[0262] 3.9 Details Of The Separate Processes Performed By The Optimization Apparatus

[0263] 3.9.1 Cut Down Procedure

[0264] 3.9.2 Division Of The Cassettes Using A Parallelogram

[0265] 3.9.3 Division Of The Cassettes Using A Rectangle

[0266] 3.9.4 Core Crush Process For A Given Number Of Cassettes

[0267] 3.9.5 Task Generation Process for Small Components

[0268] 3.9.6 Intersection Disentanglement

[0269] 3.9.7 Return Optimization

[0270] 3.9.8 Entire Flow (Starting From The Histogram)

[0271] 3.9.9 Arrangement Of Fixed Components And Mountains Within A Cassette Block

[0272] 3.9.10 Fixed Arrangement: Judging Whether A Fixed Position Is Usable

[0273] 3.9.11 Fixed Arrangement Of Double Cassettes

[0274] 3.9.12 LL Restrictions: Changes To The Pickup Method (1)

[0275] 3.9.13 LL Restrictions: Changes to the Pickup Method (2)

[0276] 3.9.14 LL Restrictions: Interchanging Component Tapes On The Z-Axis (1)

[0277] 3.9.15 LL Restrictions: Interchanging Component Tapes On The Z-Axis (2)

[0278] 3.9.16 Processing To Handle XL-Sized Substrates (XL Restrictions)

[0279] 3.9.17 Estimated Tact Time Balance Adjusting Process (In Units Of Mountains).

[0280] 3.9.18 Estimated Tact Time Balance Adjusting Process (In Units Of Component Tapes)

[0281] 3.9.19 Processing Moving A Mountain From The Front Stage 110 To The Rear Stage 120

[0282] 3.9.20 Processing Moving A Component Tape From The Front Stage 110 To The Rear Stage 120

[0283] 3.9.21 Processing Moving Mounting Points From The Front Stage 110 To The Rear Stage 120

[0284] 3.9.22 Swapping Performed When Adjusting The Tact Time Balance

[0285] 3.9.23 Cut Down Procedure Performed For Double Cassettes

[0286] 3.9.24 Nozzle Interchanging Algorithm

[0287] 3.10 Example Screen Displays

[0288] 3.10.1 Main Screen

[0289] 3.10.2 Open Screen

[0290] 3.10.3 Optimization Details Screen

[0291] 3.10.4 Set No. Of Cassettes Screen

[0292] 3.10.5 Set Component Division Numbers Screen

[0293] 3.10.6 Set No. Of Nozzles Screen

[0294] 3.10.7 Select Nozzle Station Screen

[0295] 3.10.8 Options Screen

[0296] 3.10.9 Z-Axis Information Screen

[0297] 3.10.10 Nozzle Station Information Screen

[0298] 4 Operation Of The Optimization Apparatus (Application)

[0299] 4.1 Optimization Of Small Components

[0300] 4.1.1 Optimization Of The Z-Axis Arrangement Without Dividing Components

[0301] 4.1.2 Optimization Through Assigning To The Left And Right Block

[0302] 4.1.3 Estimating The Number Of Double-Cassette Feeders

[0303] 4.1.4 Fixing The Pairs Of Component Tapes For Double-Cassette Feeders

[0304] 4.1.5 Optimization Algorithm For The Case Where There Is A Defective Head

[0305] 4.2 Simultaneous Optimization Of Several Sets Of NC Data

[0306] 4.3 Optimization For General Components (Introduction Of The Rule Base)

[0307] 4.3.1 Appropriation

[0308] 4.3.2 Task Division

[0309] 4.3.3 Task Combining

[0310] 4.3.4 Task Interchanging

[0311] 4.4 Optimization With Respect To The Nozzle Restrictions

[0312] 4.4.1 Procedure Performed When The Arrangement Of Nozzles In The Nozzle Station Is Fixed

[0313] 4.4.2 Optimization For Small Components When Less Than 10 Nozzles Are Used

[0314] 5 Glossary

[0315] Sections with the above headings are given in order below.

[0316] 1 Mounting System

[0317]
FIG. 1 shows the entire construction of a mounting system 10 according to the present invention. As shown in the drawing, the mounting system 10 is composed of a plurality (here, two) of mounters 100 and 200 and an optimization apparatus 300. The mounters 100 and 200 form a production line where electronic components are mounted onto a circuit board 20 that is transported downstream. The optimization apparatus 300 optimizes the mounting order of the required electronic components at the start of production, for example, based on information in a variety of databases, and sets and controls the mounters 100 and 200 having provided them with the NC data produced by the optimization.

[0318] The mounter 100 is equipped with two stages (a front stage 110 and a rear stage 120) that operate simultaneously and independently of one another, or in concert, or even alternately. Each of these stages 110 and 120 is a perpendicular robotic mounting stage and includes two component supplying units 115a and 115b, a line gang pickup head 112, an XY robot 113, a component recognizing camera 116, and a tray supplying unit 117. The component supplying units 115a and 115b are each made up of an array of up to 48 component feeders 114 that store component tapes. The line gang pickup head 112 has 10 pickup nozzles (hereafter simply “nozzles”) that can pick up a maximum of 10 components from the component feeders 114 and mount them onto the circuit board 20. The XY robot 113 moves the line gang pickup head 112. The component recognizing camera 116 investigates the picked-up state of the components that have been picked up by the line gang pickup head 112 in two or three dimensions. The tray supplying unit 117 supplies tray components.

[0319] In this specification, the expression “component tape” refers to a tape (a carrier tape) in which a number of the same type of components have been arranged, with such tape being supplied from a reel (a supply reel) or the like around which the tape has been wound. Component tapes are usually used to supply relatively small components called “chip components” to a mounter However, during the optimization process, a “component tape” refers to data that specifies a group of components of the same type that are assumed to have been arranged on a virtual tape). In the process called “component division”, a group of components of the same type (that would potentially be arranged on a single component tape) are divided between a plurality of component tapes.

[0320] Note that components supplied by a component tape are sometimes called “taped components”.

[0321] In more detail, the mounter 100 is a mounting device that includes the functions of both a mounting device commonly called a high-speed mounter and a mounting device called a multi-function mounter. A high-speed mounter is a device that is capable of mounting electronic components that are 10 mm2 or smaller in around 0.1 seconds, while a multi-function mounter is a device that can mount large electronic components that are 10 mm2 or larger, irregularly shaped components like switches and connectors, and IC components like QFP (Quad Flat Package) or BGA (Ball Grid Array) components.

[0322] In short, the mounter 100 is designed so as to be able to mount almost all types of electronic components from 0.6 mm by 0.3 mm chip resistors to 200 mm connectors, with a production line being formed by arranging the required number of mounters 100 in a line.

[0323] 1.1 Construction of the Mounter

[0324]
FIG. 2 is an overhead view showing the overall construction of the mounter 100 whose order of component mounting is optimized by the present invention.

[0325] A shuttle conveyor 118 is a moving table (a collection conveyor) on which a component taken from the tray supplying unit 117 is placed and which is moved to a predetermined position where the line gang pickup head 112 can pick up components from the shuttle conveyor 118. A nozzle station 119 is a table on which interchangeable nozzles corresponding to various sizes of components are positioned.

[0326] The component supplying units 115a and 115b included in each stage 110 and 120 are provided on the left and right sides of the component recognizing camera 116. The line gang pickup head 112 picks up components from the component supplying unit 115a or 115b, passes by the component recognizing camera 116, and then repeats an operation whereby the line gang pickup head 112 moves to a mounting point on the circuit board 20 and mounts one of the picked-up components.

[0327] In this specification, one iteration of the repeated series of processes where the line gang pickup head 112 picks up, transports, and mounts components and the group of components handled in such iteration are both referred to as a “task”. As one example, when the line gang pickup head 112 has ten nozzles, the maximum number of components that can be mounted by a single task is ten. It should also be noted that a “pickup operation” refers to all of the operations performed from when the head starts to pick up components to when the line gang pickup head 112 transports the components. In this specification, a pickup operation refers not only to when ten components are picked up by to the line gang pickup head 112 with a single nozzle stroke (a raising and lowering of the line gang pickup head 112), but also when ten components are picked using several nozzle strokes.

[0328]
FIG. 3 is a depiction of the positional relationship between the line gang pickup head 112 and the component feeders 114. The line gang pickup head 112 uses a method referred to as “gang pickup” and can be equipped with a maximum often pickup nozzles 112a-112b. When thus equipped, a maximum of ten components can be simultaneously picked up from the component feeders 114 in a single nozzle stroke (one raising and lowering of the line gang pickup head 112).

[0329] Note that only one component tape is loaded into a “single cassette” component feeder 114, while two component tapes with the same feed pitch (2 mm or 4 mm) are loaded into a “double cassette” component feeder 114. The position of each component feeder 114 (or component tape) in a component supplying unit 115a or 115b is indicated using a value in the Z-axis or a position on the Z-axis, with consecutive values being assigned to positions starting with the leftmost position in the component supplying unit 115a as position “1”. As a result, the determination of mounting order for taped components amounts to the determination of the ordering (i.e., positioning on the Z-axis) of components (or component tapes, or component feeders 114 in which the component tapes have been loaded).

[0330]
FIG. 4A shows one example of the specific construction of the component supplying units 115a and 115b and 215a and 215b within the stages 110 and 120, respectively. FIG. 4B is a table showing the number of component feeders 114 and their positions on the Z-axis.

[0331] As shown in FIG. 4A, the component supplying units 115a, 115b, 215a, and 215b are each capable of storing a maximum of 48 component tapes, with the positions in these component supplying units being respectively numbered Z1 to Z48, Z49 to Z96, Z97 to Z144, and Z145 to Z192. As shown in FIG. 4B, by using double cassette feeders that can store two 8 mm-wide component tapes, each component supplying unit (A block to D block) can supply a maximum of 48 types of components. The wider the component tapes (component feeders) used in a component supplying unit, the lower the number of feeders that can be loaded into a single block.

[0332] Note that in this specification, the leftmost component supplying units 115a and 215a (Block A and Block C) in each stage are referred to as the “left blocks”, while the leftmost component supplying units 115b and 215b (Block B and Block D) in each stage are referred to as the “right blocks”.

[0333]
FIGS. 5A and 5B are a drawing and table showing examples of the positions in the Z-axis of component supplying units where components can be picked up by a line gang pickup head with ten nozzles. Note that the values given as H1 to H10 in these drawings represent the positions of the ten nozzle heads.

[0334] The intervals between the nozzle heads are equivalent to the width (21.5 mm) of one double-cassette feeder, so that the Z numbers of the components that can be picked up in a single nozzle stroke are two numbers apart (i.e., either all odd or all even). Due to the restrictions on the movement of a line gang pickup head with ten nozzles in the Z-axis, there are cases where certain nozzles are incapable of picking up components positioned near the ends of the component supplying units. Such cases are indicated by the “-” marks in FIG. 5B.

[0335] The following describes the construction of a component feeder 114 in detail, with reference to FIGS. 6 to 8.

[0336]
FIGS. 6A to 6D show various chip-shaped electronic components 423a to 423d. As shown in FIG. 7, components 423d are placed into storage spaces 424a that are successively formed in a carrier tape 424 and are encapsulated by applying a cover tape 425 over the carrier tape 424. A predetermined length of this carrier tape 424 is wound around the supply reel 426, and the result is supplied to users as a component tape.

[0337] Taped components such as electronic component 423d are used having first been loaded into a component feeder 114, such as that shown in FIG. 8. In FIG. 8, the supply reel 426 is attached to reel side plates 428 so as to be freely rotatable, with the reel side plates 428 engaging a main frame 427. Carrier tape 424 that has been pulled off the supply reel 426 is guided by a feed roller 429. An automatic electronic component mounting apparatus (not illustrated) in which this electronic component supplying apparatus has been fitted operates as follows. Movement of a feed lever (not illustrated) also fitted in the apparatus causes a feed lever 430 of the electronic component supplying apparatus to move in the direction shown as Y1 in FIG. 8. This movement is transmitted via a link 431 and results in a ratchet 432 rotating by a predetermined angle. The feed roller 429 is disposed so as to move in conjuncture with the ratchet 432, and so moves by a fixed pitch, such as a feed pitch of 2 mm or 4 mm.

[0338] The cover tape 425 is peeled off by a cover tape separating unit 433 that is positioned before the feed roller 429 (towards the supply reel 426). The separated cover tape 425 is wound around a cover tape collecting reel 434 and the carrier tape 424 from which the cover tape 425 has been removed is transported to the electronic component removing unit 435. At the same time as the carrier tape 424 is fed by the feed roller 429, the electronic component removing unit 435 opens in conjunction with the movement of the ratchet 432, and a vacuum suction head (not illustrated) picks up a chip-shaped electronic component 423d using suction, thereby removing it from a storage space 424a. After this, the pressing force applied by the feed lever of the apparatus is removed and the force applied by a tension spring 436 causes the feed lever 430 to move in the direction shown as Y2 in FIG. 8. As a result, the feed lever 430 returns to its original position.

[0339] The above series of operations is repeated and the spent carrier tape 424 is discharged to the outside of the electronic component supplying apparatus. A cutter (not illustrated) operates in conjunction with the operation of the electronic component supplying apparatus and cuts the spent tape into small pieces for disposal.

[0340] It should be noted that when a component feeder 114 is a double cassette-type that can store two carrier tapes 424, it is assumed that it is only possible to supply the two carrier tapes 424 with the same feed pitch.

[0341] The characteristic operations of the mounter 100 are as follows.

[0342] (1) Nozzle Interchanging

[0343] When a nozzle that is required for the next mounting operation is not present on the line gang pickup head 112, the line gang pickup head 112 is moved to the nozzle station 119 where nozzle interchanging is performed. The types of nozzles available depend on the sizes of the components to be picked up by the line gang pickup head 112. As one example, “type S”, “type M”, and “type L” nozzles may be provided.

[0344] (2) Component Pickup

[0345] The line gang pickup head 112 moves to the component supplying units 115a and 115b and picks up electronic components using suction. When ten components cannot be simultaneously picked up, the line gang pickup head 112 may be repositioned and may make several nozzle strokes to pick up a maximum of ten electronic components.

[0346] (3) Recognition Scan

[0347] The line gang pickup head 112 moves past the component recognizing camera 116 at a predetermined speed. The component recognizing camera 116 forms images of all of the electronic components that have been picked up by the line gang pickup head 112 and detects whether the components have been picked up at the correct positions.

[0348] (4) Component Mounting

[0349] Electronic components are successively mounted on the circuit board 20.

[0350] The above operations (1) to (4) are repeated, thereby mounting all of the required electronic components onto the circuit board 20. The operations (2) to (4) form the main operation of the mounter 100 when mounting components and correspond to a “task”. This means that a maximum of ten electronic components can be mounted on a substrate in a single task.

[0351] 1.2 Restrictions for the Mounter

[0352] The object when optimizing the order of mounting for components is to maximize the number of substrates that can be processed by the mounter 100 per unit time. As can be understood from the functional and operational characteristics of the mounter 100 that are mentioned above, a favorable optimization method (optimization algorithm) is one that selects ten electronic components that can be efficiently mounted onto a substrate, simultaneously picks up all ten from a component supplying unit, and then successively mounts the electronic components using the shortest possible route. The order of component mounting determined by such an optimization algorithm will ideally result in ten times the productivity of the case where a mounter is only equipped with one nozzle.

[0353] However, due to factors such as device construction, cost, and operability, every mounter is subject to certain restrictions regarding the order in which components can be mounted. More realistically, the optimization of the order of component mounting is therefore the maximization of the number of substrates that can be processed by the mounter per unit time, subject to various restrictions.

[0354] The following describes the main restrictions to which the mounter 100 is subject. Note that these restrictions are also described in detail later in this specification where separate optimization algorithms are being discussed.

[0355] 1.2.1 Line Gang Pickup Head

[0356] The line gang pickup head 112 has ten mounting heads that can independently pick up and mount electronic components arranged in a line. A maximum of ten pickup nozzles can be attached, so that a maximum of ten components can be picked up in a single nozzle stroke by the line gang pickup head 112.

[0357] Each of the heads (a part capable of picking up one component) that compose the line gang pickup head 112 is referred to in this specification as a “mounting head” or simply as a “head”.

[0358] The ten mounting heads that form the line gang pickup head 112 are arranged in a straight line, which places a restriction on the movable range of the line gang pickup head 112, both when picking up components and when mounting components. In more detail, as shown in FIG. 5B, there are restrictions as to which mounting heads are able to access components that are located at either end of a component supplying unit (which is to say, near the left end of the left component supplying unit 115a and near the right end of the right component supplying unit 115b).

[0359] When mounting electronic components onto a substrate, there are also restrictions on the movable range of the line gang pickup head 112. Such restrictions arise, for example, when mounting components on a “LL” or “XL” substrate (described later) that are longer or wider than a normal substrate.

[0360] 1.2.2 Component Recognizing Camera

[0361] As the component recognizing camera 116, the mounter 100 is equipped with a 2D camera that forms two-dimensional images and a 3D camera that can also detect height. As the 2D camera, a 2DS camera and 2DL camera are provided for use, depending on the size of the area to be photographed. The 2DS camera is capable of photographing a small area at high speed, and is characterized by having maximum field of 60 mm by 220 mm. The 3D camera is used to detect in three dimensions whether any of the leads of an IC component are bent.

[0362] The recognition scanning speed used when photographing electronic components differs depending on the camera being used. When components that are photographed by the 2DS camera and components that are photographed by the 3D camera are present in the same task, recognition scanning needs to be performed at the scanning speed of each camera, making two scanning operations necessary.

[0363] 1.2.3 Component Supplying Units

[0364] Electronic components may be packaged in the form of a component tape, where components are held by a tape, or in the form of a tray in the form of a plate whose area is partitioned in keeping with the dimensions of components.

[0365] The supply of taped components is performed by the component supplying units 115a and 115b, while the supply of tray components is performed by the tray supplying unit 117.

[0366] The taping of electronic components is standardized, and tapes with widths of 8 mm to 72 mm are available for different-sized components. By setting components that are held by a tape (or in other words, a “component tape”) in a component feeder (a “tape feeder unit”) with a suitable width for the tape width, electronic components can be reliably and consecutively obtained from the tape.

[0367] The component supplying units in which component feeders are set are designed so that component tapes with a width of up to 12 mm can be loaded with no gaps at a pitch of 21.5 mm. When the width of the tape is 16 mm or above, tapes need to be set leaving an appropriate gap that depends on the width of the tape. In order to pick up a plurality of electronic components simultaneously (i.e., in a single nozzle stroke for the line gang pickup head 112), the mounting heads and component feeders should be aligned with the same pitch. When each component is supplied using a tape that is 12 mm wide or narrower, ten components can be simultaneously picked up by the line gang pickup head 112.

[0368] Note that the two component supplying units (the left block 115a and right block 115b) that compose each component supplying unit are each capable of holding a maximum of 48 tapes that are 12 mm wide or narrower.

[0369] 1.2.4 Component Feeders

[0370] Component feeders can be single-cassette feeders that only hold one component tape or double-cassette feeders that hold a maximum of two cassettes. The two component tapes that are placed in the same double-cassette feeder need to have the same feed pitch (2 mm or 4 mm).

[0371] 1.2.5 Other Restrictions

[0372] In addition to the above restrictions that arise due to the construction of the mounter 100, the mounter 100 is also subject to the following operation restrictions that arise due to the production facility in which the mounter 100 is being used.

[0373] (1) Fixed Arrangements

[0374] As one example, in order to reduce the amount of labor required to replace component tapes, there are cases where a particular component tape (or the component feeder that holds this component tape) is set at a fixed position (a position on the Z-axis) within a component supplying unit.

[0375] (2) Restrictions on Resources

[0376] There are cases where the number of component tapes that are provided for the same type of components, the number of feeders used to hold component tapes, the number of double-cassette feeders, and the number of nozzles (of each type) are subject to certain restrictions.

[0377] 1.3 Optimization Apparatus

[0378] When informed of the article to be produced (the substrate and the components to be mounted upon it) and the production machinery (the mounters and stages with their limited resources), the optimization apparatus 300 determines the order of component mounting that enables the finished substrate to be produced in the shortest possible time to raise the number of substrates that can be produced per unit time.

[0379] In more detail, in order to minimize the amount of time spent mounting components on each substrate, a computer decides at what positions in what mounter (stage) the component feeders loaded with component tapes should be set, in what order the line gang pickup head of each mounter (stage) should pick up the highest possible numbers of components as possible from the component feeders, and in what order and at which positions (mounting points) the picked-up components should be mounted on a substrate. The computer makes this decision by finding an optimal solution.

[0380] When doing so, the optimization apparatus needs to satisfy the aforementioned restrictions present with the mounters (stages) being used.

[0381] 1.3.1 Hardware Construction of the Optimization Apparatus

[0382] The optimization apparatus 300 is realized by having a standard computer system such as a personal computer execute an optimization program embodying the present invention. When not connected to an actual mounter 100, the optimization apparatus 300 can also function as a stand-alone simulator (an optimization tool for the order of component mounting).

[0383]
FIG. 9 is a block diagram showing the hardware construction of the optimization apparatus 300 that was shown in FIG. 1. In order to minimize the line tact time (the highest tact time out of the individual tact times of the stages forming the production line) for the mounting of components on a substrate, the optimization apparatus 300 determines which components should by mounted by each stage and the mounting order of components for each stage, based on information for all of the components that is provided by a component mounting CAD (Computer-Aided Design) apparatus or the like. By doing so, the optimization apparatus 300 produces optimal NC data. As shown in FIG. 9, the optimization apparatus 300 includes a calculation control unit 301, a display unit 302, an input unit 303, a memory unit 304, an optimization program storing unit 305, a communication interface unit 306, and a database unit 307.

[0384] It should be noted that in this specification, the expression “tact time” refers to the total time required to mount components.

[0385] The calculation control unit 301 is a CPU (Central Processing Unit), a numeric processor, or the like. In accordance with instructions from the user, the calculation control unit 301 loads the required programs from the optimization program storing unit 305 into the memory unit 304 and executes them. In accordance with the execution result, the calculation control unit 301 controls the components numbered 302 to 307.

[0386] The display unit 302 is a CRT (Cathode Ray Tube), a LCD (Liquid Crystal Display), or the like, while the input unit 303 is an input device such as a keyboard or a mouse. These components are controlled by the calculation control unit 301 and are used to allow user interaction with the optimization apparatus 300. A specific user interface is described later using examples of screen displays.

[0387] The communication interface unit 306 is a LAN (Local Area Network) adapter or the like, and is used to allow the optimization apparatus 300 to communicate with the mounters 100 and 200.

[0388] The memory unit 304 is a RAM (Random Access Memory) or the like that provides a work area for the calculation control unit 301. The optimization program storing unit 305 is a hard disk drive or the like storing a variety of optimization programs that realize the functions of the optimization apparatus 300.

[0389] The database unit 307 is a hard disk drive or the like storing input data (mounting point data 307a, a component library 307b, and mounter information 307c) that is used in the optimization process performed by the optimization apparatus 300 and mounting point data and other data generated by the optimization process.

[0390] FIGS. 10 to 12 show examples of the mounting point data 307a, the component library 307b, and the mounter information 307c, respectively.

[0391] The mounting point data 307a is a collection of information showing the mounting points of all of the components to be mounted. As shown in FIG. 10, one mounting point pi is made up of a component type ci, an X coordinate xi, a Y coordinate yi, and control data φi. In the present case, the expression “component type” refers the name of a component in the component library 307b shown in FIG. 11, the “X coordinate” and “Y coordinate” are the coordinates of the mounting point (coordinates that indicate a specific position on a substrate), and “control data” is control information (such as the type of pickup nozzle that can be used and the maximum speed at which the line gang pickup head 112 should move) relating to the mounting of the component. It should be noted that the “NC data” that is to be finally produced is an ordered list of mounting points that results in the shortest line tact time.

[0392] The component library 307b is a library in which specific information for the various component types that can be handled by the mounters 100 and 200 is gathered together As shown in FIG. 11, each entry in the component library 307b includes the component size, tact time (tact time for each component type subject to certain conditions), and other restriction information (such as the type of pickup nozzle that can be used, the recognition method to be used by the component recognizing camera 116, and the maximum speed at which the line gang pickup head 112 should move). It should be noted that in FIG. 11, the external appearance of components of various types have also been shown for reference purposes.

[0393] The mounter information 307c is information showing the constructions of each of the stages forming the production line and the restrictions to which these stages are subject. As shown in FIG. 12, the mounter information 307c is made up of information such as head information relating to the type of line gang pickup head, nozzle information relating to the types of nozzles that can be attached to the line gang pickup head, feeder information relating to the maximum number of component feeders 114, and tray information relating to the number of levels on which trays are stored in the tray supplying unit 117.

[0394] The information described above is categorized as follows. The categories used are equipment option data (for each stage), resource data (the number of feeders that can be fitted in each stage and the number of nozzles in each stage), nozzle station arrangement data (for each station equipped with a nozzle station), initial nozzle pattern data (for each stage), and Z-axis arrangement data (for each stage). It is assumed that at least 10 nozzles of each type, such as SX, SA, and S, are available as resources.

[0395] 1.3.2 Software Construction of the Optimization Apparatus

[0396] One characteristic of the optimization programs stored in the optimization program storing unit 305 is that electronic components are classified into “small components” and “general components” and that different optimization algorithms are used for each of these classifications.

[0397] Up to a thousand or so electronic components may be mounted onto a single substrate, though around 90% of these are chip components with sides that are 3.3 mm2 or smaller Hereafter, such components are referred to as “small components”. Small components include resistors and capacitors, with component sizes being limited to certain sizes. All taped components are held in tapes that are 8 mm wide, with a maximum of ten components being simultaneously picked up. As one example, all small components should fulfill the following requirements.

[0398] Component area is 3.3 mm2 or smaller.

[0399] The height of components is 4.0 mm or less.

[0400] Components can be photographed using the 2DS component recognizing camera.

[0401] The component tape holding the components is 8 mm wide.

[0402] The remaining 10% of components are irregularly shaped components such as connectors and ICs. Hereafter, large components that do not fulfill the requirements for small components are referred to as “general components”. Since some of these components are supplied via trays or require special nozzles, these components have many parameters that need to be considered during optimization.

[0403] As a result, the algorithm used for small components has the objects of generating the highest number of tasks that simultaneously pick up ten components and of executing the optimization process at high speed. On the other hand, to raise the optimization level, a highly flexible algorithm is used for general components, which works out the optimal mounting order while switching between states (possible mounting orders) with the mounting time of each task as an evaluation function.

[0404]
FIG. 13 is a functional block diagram showing the optimization program stored in the optimization program storing unit 305 shown in FIG. 9. The structure of this optimization program can be roughly classified into a component group generating part 314, a tact time balance optimization part 315, and a state optimizing part 316. It should be noted that though not illustrated, the optimization program also includes a GUI (Graphical User Interface) to allow user interaction.

[0405] The component group generating part 314 sorts all of the components to be mounted as specified by the mounting point data 307a stored in the database unit 307 into a number of component groups (for example, nine groups) depending on component thickness. In more detail, by referring to all of the component types shown in the mounting point data 307a, the component group generating part 314 generates a component table showing the number of components to be mounted for each component type, before referring to the component sizes given in the component library 307b and associating each component type with one of a plurality of component groups. After this, the component group generating part 314 informs the tact time balance optimization part 315 of the result of this classification (the component types and number of components belonging to each component group).

[0406] Based on the information on the component groups received from the component group generating part 314, the tact time balance optimization part 315 optimizes the tact time balance (or in other words, evens out the tact time for each stage) so as to minimize the tact time, while ensuring that components are mounted in order starting from component groups where component thickness is low. To do so, the tact time balance optimization part 315 has three functional modules (namely, a first LBM part 315a, a second LBM part 315b, and a third LBM part 315c) that operate in conjunction with the state optimizing part 316.

[0407] It should be noted that the reason that components are mounted with preference to components in component groups where component thickness is low is that this allows for smooth movement of the line gang pickup head 112 when mounting components on a substrate, and increases the quality of the mounting.

[0408] The first LBM part 315a performs a rough allocation of the plurality of component groups indicated by the component group generating part 314 in task groups so that the tact time of each stage is approximately equal. In other words, the first LBM part 315a optimizes the tact time balance by performing a rough adjustment. Here, the expression “task group” refers to a collection of tasks, and matches the range of the component groups for which optimization may be performed by rearranging the order of mounting of components.

[0409] The second LBM part 315b minimizes the line tact time by moving the task groups for each stage, which were allocated by the first LBM part 315a, between stages. In other words, the second LBM part 315b optimizes the tact time balance by performing a fine adjustment.

[0410] The third LBM part 315c optimizes the tact time balance in the same way as the second LBM part 315b for individual component types (component tapes) within the state (i.e., the allocation of task groups) that has been optimized by the second LBM part 315b.

[0411] The state optimizing part 316 determines, for each of the plurality of component groups generated by the component group generating part 314, which component groups should compose each task group and the optimized state (the value on the Z-axis of each component tape, the order of mounting for the components (mounting points) in each component tape) for each of the resulting task groups. The state optimizing part 316 is composed of a small component optimizing part 316a, a general component optimizing part 316b, and an optimizing engine part 316c. The small component optimizing part 316a performs optimization for small components (components belonging to five of the nine component groups, for example). The general component optimizing part 316b performs optimization for general components (components belonging to the remaining four of the nine component groups, for example). The optimizing engine part 316c performs computation that is common to the optimization performed by the small component optimizing part 316a and the general component optimizing part 316b. It should be noted that the expression “state” here refers to one order of mounting that can be potentially used for components or component types (component tapes).

[0412] It should be noted that the small component optimizing part 316a determines the task groups and optimizes a state using a simple algorithm that is suited to high-speed operation, while the general component optimizing part 316b optimizes a state using a complex, intelligent algorithm. This is because in most cases, the total number of small components to be mounted on the substrate used in a mobile phone or the like is much larger than the number of general components (a ratio of 9:1, for example). The overall result of using separate algorithms for the two types of components is that a more optimal solution can be found in a shorter time.

[0413] Based on the parameters provided by the small component optimizing part 316a and the general component optimizing part 316b, the optimizing engine part 316c executes optimization processing using a heuristic but fixed algorithm (a “hill-climbing method”) and optimization processing using an algorithm (a “multicanonical simulation”) that is probability-based but finds a globally optimal solution.

[0414]
FIG. 14 is a simplified flowchart showing the processing flow when the calculation control unit 301 executes the optimization program stored in the optimization program storing unit 305 shown in FIG. 9. This drawing shows the representative processes performed by the functional blocks shown in FIG. 13, and is therefore a flowchart for the main processing performed by the optimization apparatus 300.

[0415] The program is fundamentally executed in order from the upper steps (processes shown in rectangular boxes) to the lower steps. Note that in FIG. 14, a hierarchical display method is used where processes on upper levels are realized by processes (or the repetition of processes) shown on lower levels.

[0416] As shown in FIG. 14, the entire optimization process S310 is composed of six main steps S311 to S316.

[0417] (1) Loading of the Mounting Point Data (S311)

[0418] First all of the mounting point data 307a is loaded into the memory unit 304 from the database unit 307. Related data (the component library 307b, the mounter information 307c) is also loaded as necessary.

[0419] (2) Generation of the Component List (S312)

[0420] Information on the components to be mounted (the component library 307b) is linked to the mounting point data 307a, so that by loading all of the mounting point data 307a, it is possible to generate a component list that shows how many components are mounted for each component type.

[0421] (3) Generation of Component Groups (S313)

[0422] Next, component groups are generated from the component list. Here, the expression “component groups” refers to a classification of the components in the component list based on size, with the classifications of “small components” and “general components” being used. As one example, small components may be further classified into the following three component groups.

1G1: components that are 0.6 mm by 0.3 mmG2: components that are 1.0 mm by 0.5 mmG3: components that are 1.6 mm by 0.8 mm or larger

[0423] (4) Initial Allocation to Front And Rear Stages (S314)

[0424] A standard mounting time for each electronic component is determined, and component types (component tapes) are allocated to the front and rear stages 110 and 120 so as to even out the total standard mounting time for all of the components allocated to each stage. It should be noted that once components have been allocated to either the front or rear stages 110 or 120, component tapes are allocated to either the left or right block in units of component groups or the like.

[0425] (5) Tact Time Balancing Process (S315)

[0426] The optimization process for small components and the optimization process for general components are successively performed (S320, S321). After this, component tapes are assigned to the component supplying units 115a and 115b having considered any fixed arrangements for components (S322). Next, the total mounting times for the front and rear stages 110 and 120 are calculated, and if the balance between the stages is poor, components are moved between the front and rear stages 110 and 120 (S323) and the optimization processes for small components and general components are repeated. Also, optimization that considers the locations of mounting points (the positions on the substrate at which components are to be mounted), which is to say, optimization through intersection disentanglement (described later) (S324) and optimization through return optimization (S325) are performed.

[0427] It should be noted that the flowchart in FIG. 14 shows the procedure used when the optimization for small components (in step S320) is performed by a cut down procedure, a representative method selected from a plurality of possible methods.

[0428] (6) Output of Optimization Results (S316)

[0429] The following data is outputted once all of the processes described above have been completed.

[0430] An order of mounting for electronic components and task composition

[0431] Layout of the component supplying units 115a and 115b (arrangement of component tapes)

[0432] State of resource usage for feeders, nozzles, etc.

[0433] Estimated mounting time for each of the front and rear stages 110 and 120.

[0434] The steps described above correspond to the functional blocks shown in FIG. 13 as follows. Steps S311 to S313 are mainly performed by the component group generating part 314, while step S314 is mainly performed by the first LBM part 315a and the second LBM part 315b of the tact time balance optimization part 315. Step S315 is mainly performed by the third LBM part 315c of the tact time balance optimization part 315 and the state optimizing part 316, while step S316 is mainly performed by the tact time balance optimization part 315 and a user interface part that is not illustrated.

[0435] The processing performed in these steps is explained in detail in the “Operation of the Optimization Apparatus (Overview)”, “Operation of the Optimization Apparatus (Details)” and “Operation of the Optimization Apparatus (Application)” sections that appear later in this specification.

[0436] It should be noted that in the abbreviation “HC method” given in the drawings refers to the “hill-climbing method”, which is a heuristic but fixed algorithm that finds an optimal solution, while the abbreviation “MC method” refers to a “multicanonical simulation” that is probability-based algorithm that finds a globally optimal solution.

[0437] In more detail, the optimization of an order of component mounting is a process that finds a mounting order, out of a finite number of possible mounting orders, that satisfies certain conditions (the “restrictions” mentioned above) and results in the shortest mounting time.

[0438] The hill-climbing method (“HC method”) refers to problem solving method that finds a local solution. First, a potential solution that satisfies the required conditions is selected, this is then subject to a predetermined way of modification (in this example, changing the mounting order), and the modified form is then adopted provided the conditions are satisfied and an improvement (in the present example, a reduction in mounting time) is observed. This processing is repeated until modifications do not result in further improvements.

[0439] The multicanonical method (“MC method”) refers to problem solving method that finds a global solution. First, a potential solution that satisfies the required conditions is selected, this is then subject to a variety of unbiased modifications while continuing to observe the conditions. The probability for further improvements (decreases in entropy) is evaluated for each kind of modification and the modification with the highest probability for improvement is used. This procedure is repeated until modifications do not result in further improvements.

[0440] Note that the hill-climbing method and multi-canonical method both make a provisional modification to a previous solution in a greedy manner and adopt the modified solution if the conditions are still satisfied and there is an improvement over the previous solution. In this sense, both methods are ways of implementing the “greedy method” referred to in this specification.

[0441] The optimization apparatus 300 optimizes the order of component mounting through computation performed by a computer based on dedicated software. This means that in this specification, the “movement” of objects, such as components, tasks, task groups, component feeders, and component tapes, by the optimization apparatus refers to a rewriting of the data, such as the data showing this mounting order of components, stored in a storage apparatus such as a memory or a hard disk drive.

[0442] 2 Operation of the Optimization Apparatus (Overview)

[0443] The following describes the fundamental operation of the optimization apparatus 300 in the mounting system 10 constructed as described above.

[0444] 2.1 Generation of Component Groups

[0445] The component group generating part 314 classifies all of the components to be mounted, as specified by the mounting point data 307a stored in the database unit 307, into the nine component groups G[1] to G[9] shown in FIG. 15A based on the thicknesses of the components. This process corresponds to step S313 shown in FIG. 14.

[0446] In more detail, the component group generating part 314 refers to all of the component types shown in the mounting point data 307a and generates a component table, such as that shown in FIG. 15B, that shows how many components are to be mounted for each component type. By referring to the components sizes given in the component library 307b, the component group generating part 314 then associates each component type with one of the nine component groups G[1] to G[9]. The component group generating part 314 then informs the tact time balance optimization part 315 of the result of this classification (which is to say, which component types belong to each component group, and the number of components in each group).

[0447] 2.2 Tact Time Balancing Process

[0448]
FIG. 16 shows the processing whereby the first LBM part 315a of the tact time balance optimization part 315 allocates task groups to stages. This process corresponds to step S314a shown in FIG. 14.

[0449] The first LBM part 315a lists all of the task groups in order with component groups containing thin components at the front, before allocating task groups in order from the front of this list to stages starting from the upstream stages, in a manner that makes the tact time of each stage as close as possible to the value θ given in the equation below.

θ=(total tact time for all component groups)/total number of stages N

[0450] It should be noted that the total tact time for all component groups is found by referring to the mounting point data 307a and the component library 307b, while the total number of stages N is found by referring to the mounter information 307c.

[0451]
FIG. 17 shows the optimization (the movement of task groups) of the tact time balance by the second LBM part 315b. The upper graph 405a shows the distribution of tact time before optimization is performed, which is to say, the condition after task groups have been allocated to the stages. The middle graph 405b shows the movement of task groups performed by the optimization, while the lower graph 405c shows the distribution of tact time after optimization has been performed. This process corresponds to step S314b shown in FIG. 14.

[0452] In the distributions of tact time shown in FIG. 17, the vertical axis shows the length of the tact time, while the horizontal axis shows the stages (in the illustrated example, six) that compose the production line in order from upstream to downstream. Each task group is shown as a block that is labeled “TGn-m” and has a height that is proportional to the length of its tact time. In these labels, the variable “n” has a value between 1 and 9 showing the number of the component group belonging to that task group, while the variable “m” is used to identify the various groups produced by dividing the same task group.

[0453] It should be noted that when a plurality of task groups are allocated to the same stage, the stage mounts the components belonging to the component groups for thin components first. However, when there are a plurality of task groups for the same component group, it is assumed that this restriction on the mounting order is not enforced. As one example, stage [3] may mount the components in the order TG3-3->TG3-1->TG3-2.

[0454]
FIG. 18 is a flowchart for the optimization process for the tact time balance performed by the second LBM part 315b. This corresponds to the processing shown in FIG. 17.

[0455] The second LBM part 315b first refers to the initial state (the allocation of task groups) shown by the graph 405a that is generated by the first LBM part 315a and specifies the stage with the longest tact time “S max” and the stage with the shortest tact time “S min” (5500). In the example illustrated in FIG. 17, the second LBM part 315b specifies S[5] as S max and S[2] as S min.

[0456] After this, the second LBM part 315b stores the tact time of the stage S max as the line tact time LT (S501). In the present example, the second LBM part 315b store the tact time of S[5] as LT.

[0457] Next, the second LBM part 315b moves movable task groups between pairs of adjacent stages in order for each stage [i] between the stage [S min] and the stage [S max-1] (S502 to S507).

[0458] In other words, the second LBM part 315b provisionally moves one task group from the stage [i+1] to the stage [i] (S503), and then confirms whether the tact time of the stage [i] is below the line tact time LT (S504).

[0459] Only when it has been confirmed that the tact time of the stage [i] is below the line tact time LT, the second LBM part 315b actually moves the task group (S505). As a result, the tact times of the stages [i] and [i+1 are updated. In the illustrated example, the task group TG3-1 is moved from stage [3] to stage [2]. It should be noted that when selecting the task groups as candidates to be moved, task groups to which component groups for thin components belong are given priority.

[0460] When the movement of task groups has been repeated for all stages from [S min] to [S max-1] (S502 to S506), the second LBM part 315b confirms whether the tact time of stage [S max] has been reduced, which is to say, the second LBM part 315b judges whether one or more task groups has been moved from stage [S max] to [S max-1] (S507).

[0461] On confirming that the tact time of stage [S max] has been reduced, the second LBM part 315b judges whether optimization can still be performed, in which case the same kind of optimization (S500 to S507) is repeated. When this is not the case, the second LBM part 315b judges that further optimization is difficult and terminates the processing (S507).

[0462] It should be noted that when there are a number of task groups that may be moved, some freedom may be exercised when choosing the task group to be moved, so that it is assumed that several ways of moving task groups are attempted within the allowed computation time.

[0463] By trying different ways of moving task groups between the stage with the shortest tact time and the stage with the longest tact time, the longest tact time (the line tact time) can be reduced, thereby optimizing the tact time balance for the production line.

[0464] When the optimization described above has been completed, the tact time balance for the state (i.e. allocation of task groups) that has been optimized by the second LBM part 315b is optimized in units of component types (component tapes) using the same procedure as the second LBM part 315b.

[0465] This is to say, while the second LBM part 315b moves task groups between adjacent stages (S503, S505), the third LBM part 315c moves the component types (component tapes) that compose each task group between adjacent stages. As a result, the third LBM part 315c can make a finer adjustment of the differences in tact time between two stages than the second LBM part 315b, thereby making more precise optimization possible. This in turn makes further reductions in the line tact time LT possible.

[0466] 2.3 Optimization For Small Components

[0467]
FIG. 19 is a flowchart showing a simplification of the optimization process performed by the small component optimizing part 316a of the state optimizing part 316 for the order of mounting for small components. This optimization is fundamentally composed of two steps.

[0468] The small component optimizing part 316a first generates pickup patterns for all of the components to be mounted (S520). By doing so, the small component optimizing part 316a determines the arrangement of the component types (component tapes), which is to say, the order (Z-axis positions) of the component feeders 114.

[0469] The expression “pickup pattern” refers in this specification to a two-dimensional diagram such as that shown in FIG. 20. In this drawing, the vertical axis represents the order in which components are picked up by the line gang pickup head 112, the horizontal axis represents the arrangement (in the Z-axis) of the component feeders 114 (component tapes), and one or more groups of components that are simultaneously picked up by the line gang pickup head 112 are shown. The individual components (mounting points) that can handled by the pickup operation are shown by the small boxes (squares).

[0470] It should be noted that in FIG. 20, the pickup pattern is shown for the case where the line gang pickup head 112 has four nozzle heads to simplify the explanation. Up to four boxes arranged in a horizontal line correspond to one mounting operation (pickup, transporting, and mounting) or, in other words, one task. Each set of tasks that has been circled corresponds to a task group. As a result, a total of three separate task groups are shown in FIG. 20.

[0471] The generation of this kind of pickup pattern is performed by setting the relative positioning of the component tapes so that the line gang pickup head can simultaneously pick up as many components as possible. Putting this another way, this corresponds to dividing all of the component tapes among a plurality of separate arranged groups (task groups).

[0472] As shown in FIG. 19, the small component optimizing part 316a next determines the order of mounting for the components on each component tape in each task group (i.e., a group of component tapes whose order has been fixed) produced in step S520 so as to minimize the total tact time of each task group (S521). Even when components are taken from the same component feeder 114, the distance from the preceding mounting point in the same task differs depending on which mounting point was handled previously, so that this optimization corresponds to a minimization of the distance traveled (mounting time taken) by the line gang pickup head 112 during mounting.

[0473] 2.4 Task Group Generation Method

[0474] Task group generation is a first specific algorithm for generating the pickup patterns in FIG. 19.

[0475] With this method, the generation of task groups is repeatedly performed for a number of component types within a predetermined range (here, twice the number of pickup nozzles or less). This method is fundamentally composed of two main steps, a first step and a second step. FIG. 21 shows this first and second step. In FIG. 21, a component histogram 406a is produced by sorting component tapes into descending order for the number of components to be mounted, while a diagram 406b shows the pickup pattern generated by the first step and second step.

[0476] First Step

[0477] In this step, the former half of the process for generating one task group is performed. In other words, a component histogram is produced by arranging the component tapes in descending order of the number of components to be mounted along the Z-axis from left to right. This is achieved by the following substeps:

[0478] (i) Out of the component tapes that have yet to be ordered, a component tape with the highest number of components to be mounted (the “number 1 component tape”) is placed on the Z-axis.

[0479] (ii) The component tape with the second highest number of components to be mounted (the “number 2 component tape”) is placed on the right side of the number 1 component tape.

[0480] (iii) The component tape with the third highest number of components to be mounted (the “number 3 component tape”) is placed on the right side of the number 2 component tape.

[0481] (iv) This process is repeated for a number of iterations equal to the number of nozzles L (in the present example, four) on the line gang pickup head 112.

[0482] As a result, four component tapes 400 are taken from the component histogram 406a and are arranged at the position 400 indicated in the diagram 406b.

[0483] Second Step

[0484] This step arranges the content of the component histogram in the diagram produced by the processing in the former half so that tasks where the number of simultaneously picked up components is less than L become tasks where the number of simultaneously picked up components is L. This is achieved by the following substeps:

[0485] (i) The number of mounted components for the number L component tape is subtracted from the number of mounted components for the number 1 component tape.

[0486] (ii) A component tape (the “number L+1 component tape”) that has a number of mounted components which is no greater than the subtraction result and is closest to the subtraction result is selected and is placed on the left side of the number 1 component tape.

[0487] (iii) The number of mounted components for the number (L−1) component tape is subtracted from the number of mounted components for the number 2 component tape.

[0488] (iv) A component tape that has a number of mounted components which is no greater than the second subtraction result and is closest to the second subtraction result is selected and is placed on the left side of the number (L+1) component tape.

[0489] (v) This process is repeated for (L−1) iterations.

[0490] As a result, two component tapes 401a and 401b are taken from the component histogram 406a and are placed in the positions numbered 401 in the diagram 406b. In this way, the component tapes 400 and the component tapes 401 form a complete pickup pattern. This processing therefore determines the relative Z values for the component tapes in a task group formed of six component tapes.

[0491] The generation of task groups by the above first and second steps is repeated until there are no component tapes yet to be processed.

[0492] When in the second step, there are no remaining component tapes that fulfill the specified conditions, the following three steps (the third to fifth steps) are executed in place of the first and second steps. These third to fifth steps are described below with reference to FIG. 22. In FIG. 22, a component histogram 415a shows all of the components (the components enclosed by the solid lines) in the component histogram 406a that are yet to be arranged, while a diagram 415b shows the pickup pattern generated by the third to fifth steps.

[0493] Third Step

[0494] This step forms a component histogram by arranging components in the component histogram 406a that are yet to be arranged. This is achieved by the following substeps:

[0495] (i) Out of the component tapes yet to be arranged, the component tape with the lowest number of components to be mounted is found; and

[0496] (ii) A value equal to the lowest number minus one is subtracted from the number of components to be mounted for each component tape yet to be arranged.

[0497] The results of the above subtraction, which are numbers of components to be mounted for component tapes that are yet to be arranged, are shown surrounded by thick solid line as component histogram 415a. After this, the fourth and fifth steps are performed using the numbers of components in this component histogram 415a.

[0498] Fourth Step

[0499] The fourth step corresponds to the first step described above and is achieved by the following substeps:

[0500] (i) Out of the component tapes that have yet to be ordered, a component tape with the highest number of components to be mounted (the “number 1 component tape”) is placed on the Z-axis;

[0501] (ii) The component tape with the second highest number of components to be mounted (the “number 2 component tape”) is placed on the right side of the number 1 component tape;

[0502] (iii) The component tape with the third highest number of components to be mounted (the “number 3 component tape”) is placed on the right side of the number 2 component tape; and

[0503] (iv) This process is repeated for a number of iterations equal to the number of nozzles L (in the present example, three) on the line gang pickup head 112.

[0504] As a result, three component tapes 410 are taken from the component histogram 415a and are arranged at the position 410 indicated in the diagram 415b.

[0505] Fifth Step

[0506] The fifth step corresponds to the second step described above and is achieved by the following substeps:

[0507] (i) The number of mounted components for the number L component tape minus one is subtracted from the number of mounted components for the number 1 component tape.

[0508] (ii) A component tape (the “number L+1 component tape”) that has a number of mounted components which is no greater than the subtraction result and is closest to the subtraction result is selected and is placed on the left side of the number 1 component tape.

[0509] (iii) The number of mounted components for the number L component tape is subtracted from the number of mounted components for the number (L+1) component tape.

[0510] (iv) A component tape that has a number of mounted components which is no greater than the second subtraction result and is closest to the second subtraction result is selected and is placed on the left side of the number (L+1) component tape.

[0511] (v) This process is repeated for L iterations.

[0512] As a result, three component tapes 411 are taken from the component histogram 415a and are placed in the positions numbered 411 in the diagram 415b. In this way, the component tapes 410 and the component tapes 411 form a complete pickup pattern. This processing (1) generates task groups made up of components that can be simultaneously picked up using the component tapes that were left after the execution of the first and second steps, which is to say, component tapes where there is little difference in the numbers of components to be mounted, and (2) determines the relative positions of the component tapes on the Z-axis.

[0513] 2.5 Cut Down Process

[0514] The cut down process is a second specific algorithm that is used for the generation of pickup patterns (S520) in FIG. 19. This process corresponds to steps S320a to S320d in FIG. 14.

[0515] This process uses a component histogram where component tapes are arranged in descending order of the number of components to be mounted along the Z-axis, and utilizes the above pickup pattern generating method only where it is not possible for the line gang pickup head to simultaneously pick up the maximum (L) number of components. This method is also made up of two main steps, a first step and a second step.

[0516] First Step

[0517] In this step, tasks composed of L consecutive components are repeatedly removed (“cut down”) from the component histogram.

[0518]
FIGS. 23 and 24 show the operation performed in the first step of the present cut down process. FIG. 23 shows a component histogram 450 in which component tapes for all of the components to be mounted have been arranged in descending order of the number of components to be mounted. FIG. 24 shows how L (in the illustrated example, ten) consecutive components are removed at a time (i.e., “cut down”) from the component histogram 450 in FIG. 23. The processing shown in FIGS. 23 and 24 corresponds to steps S320a, S320b in FIG. 14.

[0519] Cutting down is performed by removing L consecutive components (shown by the sets of ten consecutive circles, triangles or crosses in FIG. 24) from the right side of the component histogram so that component tapes with few components to be mounted are removed first. This is repeated until it is no longer possible to take a remove of L consecutive components.

[0520] Second Step

[0521] This step generates a diagram from a component histogram made up of the components that remain after cutting down has been performed. This diagram is made in accordance with the task group generating method described earlier.

[0522]
FIGS. 25 and 26 show how the second step of the cut down process works. FIG. 25 shows a reconstructed component histogram 451 produced by arranging the component tapes, which are left over after the first step of the cut down process has been performed, in descending order of the number of components to be mounted. FIG. 26 shows how a diagram is generated from the reconstructed component histogram 451 in accordance with the task group generating method described earlier. The processing shown in FIGS. 25 and 26 corresponds to step S320d in FIG. 14.

[0523] It should be noted that due to the processing in the first step of the cut down process, the width (i.e., the number of component tapes) of the reconstructed component histogram 451 is definitely (L−1) or below.

[0524] In more detail, the processing in the second step is composed of the following substeps.

[0525] (i) The component histogram 451 shown in FIG. 25 is generated for the components left after the cutting down in the first step, and the total number of components to be mounted (in the illustrated example, 100) is calculated.

[0526] (ii) The calculated total number of components is divided by L (in the illustrated example, 10) and pickup patterns are generated with the object of setting the number of tasks equal to the result of the division (in the illustrated example, 10).

[0527] (iii) The above object is achieved as follows. As shown in FIG. 26, component tapes for which the number of components to be mounted exceeds the calculated number of tasks (10) are identified and the excess number of components 451a (or divided parts of this excess number) are taken and used to supplement the left side of the component histogram 451.

[0528]
FIG. 27 shows the pickup patterns 452 for component tapes whose positions on the Z-axis have been determined by the first and second steps of the cut down process described above. As shown in FIG. 27, all the components form tasks containing the maximum number (10) of components, so that mounting can be performed with the highest possible pickup efficiency.

[0529]
FIG. 28 shows a component histogram 453 corresponding to the pickup patterns 452 shown in FIG. 27. This component histogram 453 is reconstructed without changing the positions in the Z-axis.

[0530] As can be seen from the component histogram 453, the cut down process maintains the tendency for component tapes with large numbers of components to be arranged to the left. This means that cut down process determines an arrangement of components having considered the movement paths taken by the line gang pickup head 112. These movement paths are such that after picking up components from the right block 115b, the line gang pickup head 112 definitely passes in front of the 2D camera that is arranged to the left of the right block 115b. By minimizing the total distance moved by the line gang pickup head 112, the cut down process produces an arrangement of components that reduces the total tact time.

[0531] It should be noted that processing that is symmetrical in the Z-axis may be performed for the left block 115a. In other words, component tapes can be arranged in ascending order of components to be mounted and then tasks can be cut down using the procedure described above.

[0532] 2.6 Random Selection (The “Greedy Method”)

[0533] Random selection is a first example of a specific algorithm for the optimization the mounting order shown as S521 in FIG. 19. This process corresponds to step S320e in FIG. 14.

[0534] In this method, the following process is repeated. In short, two randomly selected mounting points in the same task group are interchanged if this results in a reduction in the total tact time.

[0535]
FIG. 29 is a flowchart for the procedure used when optimizing the order of mounting for components according to random selection. FIG. 30 shows how two mounting points are interchanged according to random selection.

[0536] First, the small component optimizing part 316a calculates the total tact time for the initial state (S530). Here, this state is a pattern where the mounting order for all components (mounting points) forming one task group has been decided. The total tact time for one state is determined from the information 307a to 307c stored in the database unit 307.

[0537] Next, two mounting points are selected at random from all of the mounting points (S531), and the total tact time (provisional tact time) is calculated for the case where the two selected mounting points are interchanged in the mounting order (S532). FIG. 30 shows an example where the mounting points B2 and B4 are interchanged.

[0538] The small component optimizing part 316a then judges whether the calculated provisional tact time is shorter than the total tact time for the present state (S533).

[0539] When the provisional tact time is shorter, the small component optimizing part 316a interchanges the selected mounting points (S534). In other words, the state and total tact time are updated and stored for the case where the selected mounting points have been interchanged. Then, it is judged whether the end conditions (whether the total tact time is below a target tact time set in advance by the user or whether the processing has been performed for set period of time) are satisfied at this point (S535), and if so, the processing is terminated.

[0540] On the other hand, when the interchanging of the two selected mounting points does not result in a reduction in the total tact time (S533:No) and the end conditions are not satisfied (S535:No), the above processing (S531 to S533 or S535) is repeated until the end conditions are satisfied. This means that random selection can optimize the order of component mounting, with the reduction in the tact time achieved for each task group depending on the length of processing time used.

[0541] 2.7 Intersection Disentanglement

[0542] Intersection disentanglement is a second example of a specific algorithm for the optimization the mounting order shown as S521 in FIG. 19. This process corresponds to step S324 in FIG. 14.

[0543] Instead of selecting two mounting points to be interchanged at random, this method selects two mounting points to be interchanged according to predetermined conditions, which is to say, mounting points where there is an intersection between paths produced by linking the mounting points of each task using straight lines, in order to remove the intersection.

[0544]
FIG. 31 shows three tasks 455a to 455a that are each composed of five mounting points and the optimization of the mounting order of components due to intersection disentanglement. Diagram 457 shows the mounting order (the distribution of the paths for each task) before the intersections between paths are removed, while diagram 458 shows the mounting order after the intersections between paths have been removed. Note that in these diagrams, mounting points for the same component type (component tape) are shown using the same round symbol.

[0545] First, the small component optimizing part 316a refers to the mounting point data 307a in the database unit 307 and specifies all of the intersections in the initial state. Here, lines are drawn to join two mounting points that belong to the same task and are consecutively moved to by the line gang pickup head, with the expression “intersection” referring to intersections between lines that belong to different tasks subject to the condition that the component types (component tapes) used at the mounting points at the ends of both intersecting lines are the same.

[0546] Next, the small component optimizing part 316a updates the way in which the lines are connected so as to successively eliminate all of the specified intersections. It should be noted that no change is made to the component types of the components located at each end of the lines by the elimination of the intersections, so that there is only one way of redrawing the connecting lines and this redrawing does not change in the order of component types composing each task.

[0547] By performing intersection disentanglement in this way, unnecessary movement of the line gang pickup head 112 during tasks is avoided. In other words, the order of mounting for components is determined so as to suppress unnecessary increases in tact time due to excessive movement of the line gang pickup head 112 between successive mounting points.

[0548] 2.8 Return Optimization

[0549] Return optimization is a third example of a specific algorithm for the optimization the mounting order shown as S521 in FIG. 19. This process corresponds to step S325 in FIG. 14.

[0550] This method focuses, for one task group, on the return path which the line gang pickup head 112 takes after completing the mounting of the components in one task in order to pick up the components for the next task, and aims to optimize the order of tasks that compose the same task group.

[0551]
FIG. 32 shows the procedure used to optimize the order of tasks using this return optimization method. In FIG. 32, the movement paths (mounting paths) taken by the line gang pickup head 112 when moving between the substrate and the component supplying units are shown using arrows for the case when ten tasks are arranged along the Z-axis in each of the component supplying units 115a and 115b.

[0552] The circles in FIG. 32 show representative positions for the line gang pickup head 112. The circles drawn on the substrate show the position (final mounting point) of the line gang pickup head 112 just after the mounting of the final component in a task, while the circles drawn on the Z-axis show the positions (hereafter “pickup points”) of the line gang pickup head 112 when picking up the first component in each of the twenty tasks. Note that numbers have been appended to the circles to identify the different pickup points (tasks).

[0553] First Step

[0554] This step traces the mounting paths according to the following rules.

[0555] (i) The line gang pickup head 112 should return from the final mounting point of each task to the closest pickup point, or in other words, the length of the return path should be minimized.

[0556] (ii) Mounting points are successively drawn with the first pickup point as the departure point. It should be noted that that one pickup point corresponds to one task, so that the final mounting point can be clearly specified for each pickup point. In FIG. 32 mounting paths joining the pickup points and final mounting points are drawn in the order 1, 5, 14, 2, 8, 3, 17, 12, 16, 1.

[0557] (iii) When the line gang pickup head returns to the first pickup point (pickup point number 1), the order produced thusfar is stored as a shortest looped partial path.

[0558] (iv) Next, a pickup point that is not included in a previous shortest looped partial path is found. In the example in FIG. 32, pickup point number 4 is found.

[0559] (v) The processing returns to step (ii) and the procedure is repeated thereafter until no pickup points remain. In FIG. 32, five shortest looped partial paths are found

[0560] In this way, the first step finds an order of pickup points, which is to say, an order of tasks, that minimizes the total return path of the line gang pickup head 112 for the case where mounting commences for a specified pickup point.

[0561] Second Step

[0562] Next, the second step determines, for each of the shortest looped partial paths found in the first step, from which pickup point the shortest looped partial path should start. In more detail, in order to minimize the return path taken by the line gang pickup head 112 when moving to a next shortest looped partial path after mounting components at all of the mounting points in one shortest looped partial path, the second step determines the first pickup point to be used for each shortest looped partial path and the order in which the shortest looped partial paths are to be used.

[0563] In this way, return optimization determines the execution order of all of the tasks forming one task group so as to minimize the return path taken by the line gang pickup head 112 between consecutive tasks.

[0564] It should be noted that while FIG. 32 shows the mounting paths for a task group where the twenty pickup points are all at different positions, it is also possible to perform optimization for task groups where a plurality of pickup points are coincident, as shown in FIG. 33. In such cases, a degree of freedom can be exercised when selecting the final mounting point corresponding to a number of coincident pickup points. As a result, the total tact time for the task group is calculated for different selection patterns, and final mounting point for the selection pattern that minimizes the total tact time can be selected when generating the shortest looped partial paths.

[0565] Performing random selection and intersection disentanglement as described above optimizes the mounting order within tasks and optimizes the mounting order for all tasks, without affecting the tasks themselves. Performing return optimization optimizes the order of tasks after all of the tasks have been fixed (which is to say, after the composition of each task has been determined).

[0566] 2.9 Optimization for General Components

[0567] For general components, there is a great variety in component sizes, nozzles used, component recognizing camera used, and supply method (tape, tray, etc.), so that various different components can be combined when generating tasks. Here, a method that efficiently changes the state of tasks while looking for the optimal state is used. This process corresponds to step S321 in FIG. 14.

[0568] The evaluation index used for optimization is mounting time, so that a mounting time simulator that can correctly simulate the operation time required by the mounter 100 is provided. The optimization algorithm used for general components is as follows.

[0569] (1) Setting of Loop Iterations

[0570] Since it is not realistic to evaluate every possible way of mounting components, end conditions are set in advance for the processing. In the present case, the optimization processing is made to end when no reduction in mounting time is achieved for a predetermined number of iterations of a loop.

[0571] (2) Generation of an Initial State

[0572] First, an initial state is generated for all of the general components. In the initial state, all of the mounting points of general components are sorted into task units, and provided all of the restrictions to which the mounter 100 is subject are satisfied, any state may be used.

[0573] (3) Varying the State

[0574] The state of tasks is varied to find the optimal state. The following are examples of methods that can be used to vary the state of tasks.

[0575] Interchanging mounting points that are present in different tasks

[0576] Interchanging the mounting order of two mounting points in the same task

[0577] Interchanging two component tapes

[0578] Here, in order to vary the state of tasks flexibly, it is also possible to interchange tasks with empty mounting points. In this case, the movement of a mounting point from one task to another task that is not full can also be regarded as the interchanging of mounting points between tasks. By repeating such processes, the number of tasks can be reduced.

[0579] The decision as to whether to accept the changes been made to the state is made according to whether a reduction has been achieved in the mounting time. However, if changes that result in a reduction in the mounting time are always accepted, there is the risk of being caught in a local minimum. Because of this, states where there is an increase in the mounting time are also accepted with a given probability.

[0580] The following describes the processing for the optimization of general components in detail.

[0581]
FIG. 34A is a flowchart showing the procedure used when the general component optimizing part 316b optimizes the mounting order of general components. FIG. 34B is used to show the approach used by this procedure to find the optimal solution and illustrates the tact times for the various states that can be used.

[0582] As shown in FIG. 34A, the general component optimizing part 316b first generates an initial state X for all of the components belonging to the component groups G[6] to G[9] (the general components) (S550). After this, the general component optimizing part 316b has the optimizing engine part 316c perform optimization on the initial state X according to the hill climbing method, resulting in the calculation of the optimized state Xopt (S551). Next, the general component optimizing part 316b has the optimizing engine part 316c perform optimization on the initial state X according to the multicanonical method to update the optimized state Xopt calculated in step S551 (S552). Finally, the general component optimizing part 316b has the optimizing engine part 316c perform optimization on the updated optimized state Xopt according to the hill climbing method to further update the optimized state Xopt calculated in step S552 (S553).

[0583] In this way, optimization according to the multicanonical method that searches for an optimal solution from a global viewpoint (S552) is performed at a midpoint of the execution of optimization according to the hill climbing method that definitely finds a locally optimal solution (S551, S553). As a result, cases where the search for the optimal state ends with a state that is optimal on a local level but sub-optimal on a global level (state {circle over (1)} shown in FIG. 34B, for example) can be avoided, enabling a state that is optimal on a global level (state {circle over (5)} in FIG. 34B) to be found.

[0584]
FIG. 35 is a flowchart showing the detailed procedure used when performing optimization according to the hill-climbing method shown in FIG. 34A. In detail, the optimizing engine part 316c is provided with a notification of the initial state X and the end conditions. After generating this initial state X (S560), the optimizing engine part 316c repeatedly performs the inner loop (S562 to S568) until the outer loop end conditions are satisfied (S561). Here, the expression “outer loop end conditions” refers to conditions for ensuring that the optimal solution is indeed optimal, with these conditions changing every type of parameter that can affect the state. The expression “inner loop end conditions” refers to conditions that change one type of parameter within a predetermined range.

[0585] During the inner loop, the optimizing engine part 316c first generates the state candidate Xtmp using a state variation selected by the general component optimizing part 316b out of nine types of state variation (described later) (S563, S564). When this state candidate Xtmp has feasibility (i.e., can potentially be used) (S565) and has a tact time that is shorter than the immediately preceding state (S566, S567), the optimizing engine part 316c updates the state and tact time using this state candidate Xtmp and its tact time (S568).

[0586] In this way, the inner loop definitely finds states that are optimal on a local level.

[0587]
FIG. 36 is a flowchart showing the detailed procedure used when performing optimization according to the multicanonical method shown in FIG. 34A. In FIG. 36, a “bin number” is a number showing a section (“bin”) produced by equaling dividing the horizontal axis shown in FIG. 34B (all of the possible states) by N. Histogram H[i] meanwhile is a variable storing the total number of times a state candidate Xtmp belonging to the bin with the bin number [i] been selected (S576,S577) and it has been judged that the state candidate Xtmp is feasible (S578) and reduces entropy (S579 to S581).

[0588] As can be understood by comparing the flowchart in FIG. 36 with the flowchart for the hill-climbing method that is shown in FIG. 35, the two methods are similar in repeating a series of processes where a state candidate Xtmp is generated from the initial state X and then it is judged whether this state candidate Xtmp should be accepted. The difference between the methods lies in the method used to judge whether the state candidate Xtmp should be accepted. In the hill-climbing method shown in FIG. 35, a definite judgement is made to accept the state candidate Xtmp if its tact time is lower than the tact time of the state X. However, in the multicanonical method shown in FIG. 36, the entropy exhibited by the tact time is examined and a probability-based judgement is made whether to accept the state candidate (S580 to S582).

[0589] The following describes the intermediate representations used by the general component optimizing part 316b in order to explain the nine state variations and concept of “feasibility” used in the flowcharts shown in FIGS. 35 and 36. To facilitate optimization, the general component optimizing part 316b introduces the following three expressions as intermediate representations of the arrangement of the Z-axis, and uses these representations to store the state and provide information to the optimizing engine part 316c.

[0590] (i) Gorder[i] (i=1, . . . , L)

[0591] This variable indicates the order of priority used when arranging the inputted L component groups (the task groups TG[i] (i=1, . . . , L)) along the Z-axis, and takes the priority order numbers 1 to L as values. When i!=j, Gorder[i]!=GorderU].

[0592] (ii) block[i](i=1, . . . , L)

[0593] This variable indicates whether the task groups TG[i] (i=1, . . . , L) should be arranged into the left or right Z block (the component supplying unit 115a or 115b), and takes a symbol indicating left or right.

[0594] (iii) Corder[i][j](i=1, . . . , L, j=1, . . . , M[i])

[0595] This variable indicates the order in which the component tape j (=1, . . . , M[i]) belonging to the task group TG[i] (i=1, . . . , L) should be arranged along the Z-axis, and takes the order numbers 1 to M[i]. When j!=k, Corder[i][j]!=Corder[i][k]. Note that when Corder[i][j]<Corder[i][k], the relationship “Z number of component tape j<Z number of component tape k” is valid.

[0596]
FIG. 37 shows one example of the intermediate representations used by the general component optimizing part 316b. Table 460 shows a specific example of the intermediate representations used by the general component optimizing part 316b, while tables 461 to 464 show the meanings (conversions into arrangements along the Z-axis) of the intermediate representations shown in table 460. These arrangements along the Z-axis representing the intermediate representations shown in table 460 are specified by performing the specific conversion described below.

[0597] First, the task group TG[2] where Gorder[i]=1, which is to say, the task group with the highest priority when determining the arrangement along the Z-axis, is arranged (table 461). The variable block[2] is set at “right” for TG[2], so that TG[2] is positioned at the leftmost position of the right block next to the component recognizing camera 116. Here, the total M[i=2] is equal to six for TG[2], meaning that component feeders 114 holding six component tapes j(i=1, . . . , 6) are arranged at the leftmost position of the right block next to the component recognizing camera 116 with the component feeder 114 for the component tape with the lowest Corder[i=2][j] value being positioned furthest to the left.

[0598] Next, the task group TG[4] where Gorder[i]=2 is arranged (table 462). The variable block[4] is set at “left” for TG[4], so that TG[4] is positioned at the rightmost position of the left block next to the component recognizing camera 116. Here, the total M[i=4] is equal to three for TG[4], meaning that component feeders 114 holding three component tapes j(i=1, . . . , 3) are arranged at the rightmost position next to the component recognizing camera 116, with the component feeder 114 for the component tape with the lowest Corder[i=2][j] value being positioned furthest to the right.

[0599] In the same way, TG[3] for whom Gorder[i]=3 and TG[1] for whom Gorder[i]=4 can be arranged in this order (tables 463 and 464).

[0600] The following describes the nine state variations that can be selected (step S564 in FIG. 35, step S577 in FIG. 36) by the general component optimizing part 316b. The nine state variations are as follows.

[0601] (1) Two mounting points are selected at random from the same general components group, and the task numbers and head numbers (positions of the pickup nozzles 112a and 112b on the line gang pickup head 112) of these mounting points are interchanged.

[0602] (2) Two mounting points are selected at random from the same task and the mounting orders of these mounting points are interchanged.

[0603] (3) Two task groups (two general components groups) are selected at random and the Gorder values of these groups are interchanged.

[0604] (4) One task group (one general components group) is selected at random and the block value of this group is changed (i.e., switched to either “left” or “right”).

[0605] (5) Two component tapes in the same task group are selected at random and the Corder values of these component tapes are interchanged.

[0606] (6) A number of component tapes with consecutive Corder values are selected at random from the same task group and are shifted.

[0607] (7) A number of component tapes with consecutive Corder values are selected at random from the same task group and the Corder values are changed so as to arrange these component tapes along the Z-axis in accordance with the average X coordinate values of the mounting points for the component tapes.

[0608] (8) One task is selected at random and the head numbers are changed based on the Z numbers of the mounting points of this task.

[0609] (9) The transport mode for tray components that can be shuttled is changed at random (between direct mode and shuttle mode).

[0610] In this specification, the expression “transport mode for tray components” refers to the method used when supplying tray components using an elevator provided in the tray supplying unit 117 that has a plurality of levels. The supplying of components amounts to the movement of them to a position where they can be picked up by the line gang pickup head 112. “Direct mode” is a method where the trays in which components are stored are directly presented to the line gang pickup head 112 one at a time, while “shuttle mode” is a method where a shuttle conveyor 118 makes a round trip to collect components from a plurality of trays and present a row of components to the line gang pickup head 112. Various kinds of information about these transport modes is included in the mounter information 307c, with the transport mode used affecting the time required to move the required components to the required positions.

[0611] The general component optimizing part 316b checks whether a state is feasible (in step S565 in FIG. 35 or in step S578 in FIG. 36) as follows. When a state simultaneously satisfies all six of the following conditions, the general component optimizing part 316b regards the state Xtmp as a feasible solution.

[0612] (1) For each task, the Z numbers of the mounting points supplied using direct mode need to be on the same level in the tray supplying unit 117. This means that direct mode is intended for use only when the components that are simultaneously supplied are located on the same level.

[0613] (2) There needs to be no interference between the pickup points of the components composing each task. In other words, cases are avoided where there is the risk, due to the shapes of the components, of adjacent components that are simultaneously picked up coming into contact.

[0614] (3) In each task, it must be possible to pick up the components required for all mounting points (i.e., the pairings of head numbers for mounting points and Z numbers must be appropriate). This condition takes into consideration the restriction that not every pickup nozzle provided on the line gang pickup head 112 is able to move to every position in the 96 component feeders 114.

[0615] (4) In each task, it must be possible to mount components at the mounting points (the pairings of head numbers for mounting points and coordinates must be appropriate). This condition takes into consideration the restriction that not every pickup nozzle provided on the line gang pickup head 112 is able to move to every possible position on a substrate.

[0616] (5) The pickup nozzles in the nozzle station 119 must be arranged in a manner that makes the pickup nozzle patterns for every task in every task group possible. In other words, this condition takes into consideration the restrictions regarding the positions and numbers of replacement pickup nozzles that can be arranged in the nozzle station 119.

[0617] (6) The nozzles on the line gang pickup head 112 and components arranged along the Z-axis need to have the same pitch. In other words, it is confirmed that the components (or component feeders) to be simultaneously picked up by the line gang pickup head 112 are properly arranged along the Z-axis.

[0618] In this way, instead of performing just a local optimization, the general component optimizing part 316b performs an optimization that includes a probability-based search (steps S550 to S553 in FIG. 34A), thereby avoiding undesirable cases where a local minimum is found as the optimal solution.

[0619] 3 Operation of the Optimization Apparatus (Details)

[0620] The following describes the operation of the optimization apparatus 300 in more detail. This explanation focuses on the detailed content of the various algorithms mentioned earlier and describes how they operate under various restrictions.

[0621] 3.1 Cut Down Procedure

[0622] The cutting down process (steps S320a to 320d in FIG. 14) is an algorithm that makes up for the drawbacks with the task group generation method described earlier The following describes the cut down procedure in detail while clarifying the problems with the task group generation method.

[0623] 3.1.1 Overview of the Task Group Generation Method

[0624] The fundamental principles of the algorithm used for optimizing small components as part of the task group generation method are as follows. As shown in FIG. 38, when the nozzles provided on the head is “n” the algorithm attempts to form, for all of the components to be mounted, groups of n component tapes that have the same number of components to be mounted, and to have one component simultaneously taken from each of these n component tapes so as to form tasks where n components are simultaneously picked up. With the mounters used in the present embodiment, “n” has the value “10” (or “4”).

[0625]
FIG. 38 is a component histogram that is used to explain the task group generation method. The horizontal axis of FIG. 38 shows the Z-axis (along which component feeders (i.e., component types) are arranged), while the vertical axis shows the total number of components to be mounter for each component type.

[0626] However, since in reality not all component tapes have the same number of components to be mounted, the above algorithm divides the component tapes to produce component tapes that have the same number of components to be mounted.

[0627] When there are still differences between n component tapes in the number of components to be mounted (the components A to J in FIG. 38, for example), component tapes that supplement the number of components to be mounted and remove such differences are produced and arranged next to the n component tapes. A maximum of (n−1) of such component tapes may be arranged in this way (see the left section 506 in FIG. 38).

[0628] The group of n to n+(n−1) component tapes produced in this way is set as a “task group”. This name is chosen as components taken from these component tapes form a number of tasks.

[0629] Usually, a plurality of task groups are formed. The number of task groups depends on total number of component types, but in some cases, only one task group is formed.

[0630] The arrangement of component feeders along the Z-axis is performed in units of task groups.

[0631] 3.1.2 Problems with the Task Group Generation Method

[0632] The task group generation method has the following problems.

[0633] (1) Since component feeders are arranged along the Z-axis in units of task groups, it is not possible to arrange a task group unless there are at least 10 empty positions on the Z-axis. As a result, unused positions end up being left along the Z-axis.

[0634] (2) Little freedom can be exercised when arranging task groups, and since it is difficult to move component types (component tapes and component feeders) between the front stage 110 and the rear stage 120, it is difficult to adjust the balance of the mounting times of the front stage 110 and rear stage 120.

[0635] (3) When a component tape is divided during the production of a task group, each component tape created by the division uses another component feeder. When the total number of task groups is considered, there is a tendency for such division to make a large number of component feeders necessary.

[0636] These problems arise due the number of component tapes composing each task group (between 10 and 19 when the line gang pickup head 112 has ten nozzle heads) being of the same order as the number of component tapes that can be arranged along the Z-axis (48 when single-cassette feeders are used and 96 when double-cassette feeders are used).

[0637] As a result, little freedom can be exercised when arranging task groups along the Z-axis. As one example, if the maximum number of component tapes that can be arranged along the Z-axis is around ten times the number of component tapes composing a task group, it is believed that there will be fewer restrictions on the freedom with components can be arranged.

[0638] 3.1.3 Cut Down Procedure

[0639] The cut down procedure is composed of three processes, namely the “component histogram generation process” (step S320a in FIG. 14), the “cut down process” (step S320c in FIG. 14), and the “core crush process” (step S320d in FIG. 14). These processes were conceived in view of the problems with the task group generation method. Note that in the following explanation, the number of nozzles on the line gang pickup head 112 is assumed to be “n”.

[0640] (1) Component Histogram Generation Process (Step S320a in FIG. 14)

[0641] The component histogram generation process generates a histogram (a “component histogram”) in which component tapes are arranged in descending order of the number of components to be mounted, with the presence of such a component histogram being a prerequisite for the cut down process.

[0642] In the task group generation method, component tapes are sorted into a number of groups called “task groups”. In the cut down procedure, however, the component tapes are arranged into a single group called a “component histogram”.

[0643] The component histogram is divided into units of component tapes. The resulting component tapes can be arranged in either the front stage 110 or the rear stage 120, so that components can be moved between the front stage 110 and rear stage 120 in smaller units than in the task group generation method.

[0644] (2) Cut Down Process (Step S320c in FIG. 14)

[0645] The cut down process generates a pickup pattern from the component histogram. The fundamental operation of the cut down process is the removal of one component from each of n component tapes on the side of the component histogram where the remaining number of components to be mounted is small to form pickup patterns where n components are simultaneously picked up.

[0646] As a result of the cut down process, there are some component tapes with components that are yet to be picked up. These component tapes are called “core component tapes”. In the same way, the feeders holding core component tapes are called “core feeders”.

[0647] The number of core component tapes is always (n−1), regardless of the number of component tapes that compose the initial component histogram.

[0648] The advantage of the cut down process is that the problem of dividing potentially all of the component tapes composing the generated tasks in which n components are simultaneously picked up is reduced to the problem of having to divide only the core component tapes to generate tasks in which n components are simultaneously picked up.

[0649] The parts of the component histogram that are not the core component tapes have already been used to form tasks in which n components are simultaneously picked up, so that only the core component tapes have to be divided to form tasks in which n components are simultaneously picked up. This process is called the “core crush process”.

[0650] (3) Core Crush Process (Step S320d in FIG. 14)

[0651] The core crush process is an extension of the concept of the task group generation method of producing component tapes to make up for shortfalls in the number of mounting points. In this way, tasks in which n components are simultaneously picked up are generated.

[0652] Since there are between one and (n−1) core component tapes, the number of component tapes with shortfalls in the number of mounting points is between (n−1) and one.

[0653] In the task group generation method, supplementing component tapes are required for each group. On the other hand, in the cut down procedure, there is only one group of component tapes, so that (n−1) supplementary component tapes are required at most. As a result, fewer feeders are used than with the task group generation method.

[0654] In the task group generation method, when each component tape has been divided into its maximum number of divisions, the component tape with the highest number of components to be mounted is found. The number of pickup patterns (in which n components are simultaneously picked up) generated by the task group generation method is equal to this highest number of components

[0655] On the other hand, the core crush process finds the total number of components in the core component tapes, divides this number by n, and uses this value when estimating the number of pickup patterns in which n components are simultaneously picked up.

[0656] 3.1.4 Optimization for Small Components According to the Cut Down Procedure

[0657] The following describes the optimization performed for small components by the cut down procedure with the advantages described above.

[0658]
FIG. 39 is a flowchart showing the optimization process (corresponding to step S320 in FIG. 14) achieved for small components by the cut down procedure. Objectives of the optimization performed for small components include the minimization of the number of nozzle strokes by the line gang pickup head 112 when picking up components and the minimization of the distance moved by the line gang pickup head 112 when mounting components. In other words, this process determines pickup patterns formed of the maximum of ten simultaneously picked up components (S331) and assigns the mounting data in a manner that minimizes the distance moved by the line gang pickup head 112 (S335)

[0659] (1) Determination of the Pickup Patterns (S331 in FIG. 39)

[0660] To determine the pickup patterns, the order of the component tapes and the order in which components are picked up by the line gang pickup head 112 need to be determined. In other words, it is necessary to determine the order in which the component tapes should be set in the component supplying units 115a and 115b and the order in which the line gang pickup head 112 should pick up components from the component tapes set in this way.

[0661] (i) Generation of a Component Histogram (S332 in FIG. 39)

[0662] The electronic components are sorted into component types and a component histogram is generated. The horizontal axis represents the order (Z-axis arrangement) of the component tapes, so that the component histogram is a table showing in which of the component supplying units 115a and 115b the components have been set. Small components are enclosed in 8 mm tapes, so that ten components can be simultaneously picked up. By looking along the Z-axis of the component histogram, it is easy to judge which components can be simultaneously picked up. FIG. 40A shows a component histogram 500 in which there are 21 component tapes, the lowest number of components to be mounted for any of the tapes is 1, and the highest number of components to be mounted is 15.

[0663] (ii) Cut Down Process (S333 in FIG. 39)

[0664] In the component histogram 500 shown in FIG. 40A, sets of ten consecutive components are found starting from the right side where component tapes with few components to be mounted have been arranged. This process cuts down a set of 10 components from the component histogram 500 starting with the component tapes with few components to be mounted, and so is referred to as the “cut down process”. As shown in FIG. 40B, this cut down process generates four tasks 500a to 500d in which 10 components are simultaneously picked up.

[0665] (iii) Core Crush Process (S334 in FIG. 39)

[0666] When the four tasks 500a to 500d in which 10 components are simultaneously picked up (shown in FIG. 40B) are removed from the component histogram 500, a component histogram 501 with a narrow bottom is produced, as shown in FIG. 41. This remaining component histogram 501 is referred to as the “core”. Since the width of the core 501 in the Z-axis is less than 10, it is not possible to generate a task in which 10 components are simultaneously picked up with the core 501 in this state. For this reason, the “core crush process” is performed to crush the core 501 and generate tasks in which 10 components are simultaneously picked up.

[0667] First, the number of components composing the core 501 is counted and the target is set. A total of 36 components are present in the component histogram 501 shown in FIG. 41, so that a decision is taken to produce three tasks in which 10 components are simultaneously picked up and one task in which 6 components are simultaneously picked up.

[0668] In order to be able to cut down tasks in which 10 components are simultaneously picked up from the core shown in FIG. 41, the lowest level in the core 501 needs three more components, the second lowest level needs five more components, and the third lowest level needs six more components. Once a total of 36 components have been cut down from the core 501, the pattern 501b in FIG. 41 is completed. By assigning components to the pattern 501b, the tasks set as the target can be generated. The number of components included in the pattern 501b is equal to the number of components present in the pattern 501a that is situated on the fifth level upwards of the original component histogram. This means that by dividing the components in the pattern 501a in units of component tapes, pattern 501b can be filled in the vertical direction.

[0669] As shown in FIG. 41, 11 components are left for component number 1 in the pattern 501a. These components are divided into 4+4+2+1 vertical sections that are inserted in that order into the pattern 501b. The remaining components for component numbers 2 and 3 are not divided and are inserted into the pattern 501b to complete the core crush process.

[0670] When both the cut down process and the core crush process are performed, the component histogram is transformed to the component histogram 504 shown in FIG. 42. The component histogram 504 includes both tasks 503 that were generated by the cut down process and tasks 502 that were generated by the core crush process. This component histogram 504 corresponds to an ideal pickup pattern, with all the components being efficiently picked up by seven tasks in which 10 components are simultaneously picked up and one task in which task 6 components are simultaneously picked up.

[0671] (2) Allocation of Mounting Point Data (S335 in FIG. 39)

[0672] The allocation of mounting point data starts from the task with the lowest number of components to be mounted. In the component histogram 504 shown in FIG. 42, the allocation of mounting points starts with the task including component number 21 of which only one component is to be mounted. In task 1, only one component is to be mounted for each of the seven components, component number 15 to component number 21, so that the data present in the mounting point data can be assigned without amendment. Two components are to be mounted for component number 14, giving rise to the problem of which of the two pieces of mounting point data should be selected. In this case, the piece of mounting point data that minimizes the movement of the line gang pickup head 112 after the mounting of the already decided component 15 is selected.

[0673] However, since component number 15 is picked up using the mounting head H4 and component number 14 is picked up using the mounting head H3, a mounting point needs to be selected with consideration to the offset between the mounting heads H4 and H3. This is also the case when selecting the mounting point for component number 13. As one example, if the mounting point data for component 14a is selected out of the component numbers 14a and 14b, the mounting point for component 13 is selected having calculated the distance from the mounting point for component number 14a. The same process is repeated once more to select one of the mounting points of component number 12, thereby determining all of the mounting points for one task.

[0674] 3.1.5 Individual Processes

[0675] The cut down procedure is a process for generating tasks (proper pickup patterns) from component types in the component groups that have been classified as small components.

[0676] The details for this process are given in the following sections of this specification.

[0677] Cut Down Procedure

[0678] Task Generation Process for Small Components

[0679] 3.2 Intersection Disentanglement

[0680] Intersection disentanglement is an algorithm that makes up for the drawbacks with the greedy method described earlier This process corresponds to step S324 in FIG. 14.

[0681] The following describes the intersection disentanglement method in detail while clarifying the problems with the greedy method.

[0682] 3.2.1 Overview of the Greedy Method

[0683] When allocating mounting points to tasks, mounting points are selected from the component types so as to minimize the distance between the mounting points at which components are mounted by the nozzles. When calculating the distance, the nozzle pitch (i.e., distance between nozzles) is considered.

[0684] The mounting point selection method used is the greedy method. This process corresponds to step S320e in FIG. 14.

[0685] In the greedy method, even if the distance between mounting points for a given task has been minimized, no attention is paid to the distances between mounting points of other tasks, so that when all tasks are considered, the present choice of mounting points may not be optimal.

[0686] 3.2.2 Problems with the Greedy Method

[0687] When mounting points are assigned to pickup patterns using the greedy method, there is the problem that in some cases, mounting paths such as those that shown in the upper part of FIG. 43 (a drawing in which the mounting points forming each task have been arranged in accordance with their positions on a substrate and linked by lines in order of mounting) are selected.

[0688]
FIG. 43 shows a case where there are three tasks each with five mounting points. In FIG. 43, the circles represent the mounting points, while the arrows show the mounting path (order of mounting). The legends appended to the mounting points show the component types. As one example, the legends A1, A2, and A3 show the three mounting points for the component type A. Mounting points linked by arrows drawn using the same style compose one task.

[0689] First, in the “before intersection disentanglement” state at the top of FIG. 43, the mounting point for the component type B1 is selected as the closest mounting point to the mounting point for the component type A1, and the mounting point for the component type C2, not the mounting point for the component type C1, is selected as the closest mounting point to the mounting point for the component type B1. This is because in the greedy method, the closest mounting point is selected as the next mounting point at which mounting is to be performed.

[0690] When the greedy method is repeatedly used to select mounting points, the line linking the mounting point for the component type B3 with the mounting point for the component type C1 ends up crossing the paths that link other mounting points, as shown in the “before intersection disentanglement” state at the top of FIG. 43.

[0691] 3.2.3 Intersection Disentanglement

[0692] If a human were to decide the mounting paths, it is likely that he or she would choose link the mounting points in a manner where the mounting paths do not intersect, like in the “after intersection disentanglement state” shown at the bottom of FIG. 43.

[0693] Because of this, after mounting points have been selected using the greedy method, processing that find intersections between mounting paths and eliminates such intersections should be performed. Such processing is called “intersection disentanglement”.

[0694] If intersection disentanglement is performed, the “after intersection disentanglement state” shown at the bottom of FIG. 43 is produced. When compared to the state before intersection disentanglement, a reduction in the total length of the mounting paths can be expected.

[0695] In more detail, by interchanging the selection of two of the mounting points for the component types B1 to B3 in the example in FIG. 43, the mounting paths are reconstructed, and by repeating this process, tasks with shorter mounting paths can be produced.

[0696] It should be noted that in reality, it is also necessary to consider the intervals between nozzles. The above example was conceived merely to illustrate the concept of intersection disentanglement, and so does not take this into account. Intersection disentanglement is described in detail as part of the explanation of the individual processes given below.

[0697] 3.2.4 Related Individual Processes

[0698] Intersection disentanglement finds intersections between mounting paths that are present after mounting points have been selected using the greedy method and eliminates such intersections. Compared to the state before intersection disentanglement of the mounting paths, a reduction in the total length of the mounting paths can be expected.

[0699] The details of this process are given in the following section. Intersection Disentanglement

[0700] 3.3 Return Optimization

[0701] The following describes the “return optimization method” in detail, while clarifying its conceptual processes. This process corresponds to step S325 in FIG. 14.

[0702] 3.3.1 Evaluation of the Component Mounting Operation

[0703] As shown in FIG. 44, the operation for mounting components can be divided on a macro level into the following three processes.

[0704] (1) Component Pickup->Component Recognizing Camera

[0705] (2) Recognition->Component Mounting

[0706] (3) Component Mounting->Next Component Pickup . . . (Return)

[0707] 3.3.2 Necessity of Optimizing the Return Process

[0708] Process (1) given above is optimized by arranging component tapes with many components to be mounted at positions on the Z-axis that are close to the component recognizing camera.

[0709] In process (2), the distance does not change significantly, so that optimization is not performed. This is because the positions of the component recognizing camera and the substrate are fixed, the movement of the line gang pickup head above the substrate during mounting is relatively small compared to the length of the Z-axis, and all of the mounting points are thought to be present near the center of the substrate.

[0710] However, optimization is performed for the return process (3) even though the distance moved is around the same as the distance moved for process (2). By optimizing this process, reductions in mounting time are expected.

[0711] 3.3.3 Return Optimization

[0712] The following describes an optimization algorithm for use in the “return” process (process (3)) mentioned above.

[0713] The basic concept behind this optimization algorithm is to find a task, out of the tasks that are yet to be mounted, whose position on the Z-axis minimizes the return distance of the line gang pickup head from the coordinates of the final mounting point in a present task, and to set this task as the next task to be mounted. As one example, in FIG. 44, task B is closer to the final mounting point than task A, so that task B is selected as the next task to be mounted.

[0714] 3.3.4 Related Individual Processes

[0715] The operation for mounting components can be divided on a macro level into the following three processes.

[0716] (1) Component Pickup->Component Recognizing Camera

[0717] (2) Recognition->Component Mounting

[0718] (3) Component Mounting->Next Component Pickup . . . (Return)

[0719] The return optimization method optimizes the distance moved by the line gang pickup head in process (3), and so is expected to result in a reduction in the mounting time.

[0720] The details of this process are given in the following section.

[0721] Return Optimization Method

[0722] 3.4 Fixed Arrangement Processing

[0723] 3.4.1 Overview

[0724] In some cases, the user indicates Z numbers for arranging a plurality of component types. Such numbers indicates the order of component types along the Z-axis, and so are called “fixed arrangements”.

[0725] On the other hand, the arrangement of component tapes along the Z-axis is subject to optimization by the optimization algorithm, so that it is necessary to use an optimization algorithm that considers the fixed arrangements indicated by the user.

[0726] It should be noted that a great variation in the fixed arrangements indicated by users is likely.

[0727] Even if it is possible to predict a number of fixed arrangements when devising an algorithm and to produce an optimization algorithm that can manage such fixed arrangements, such optimization algorithm may not be able to manage other fixed arrangements. This is because there is the tendency for algorithms to become specialized for the predicted fixed arrangements, so that there is the risk of such algorithms having no effect when confronted with other fixed arrangements.

[0728] Even if the algorithms are reconstructed so as to be able to handle other fixed arrangements, this involves adding algorithms for exception processing, which lowers the readability of a program and makes maintenance problematic.

[0729] The best method of dealing with this problem is described below, with reference to FIG. 45. FIG. 45 is a component histogram showing the optimization that is performed when the presence of a fixed arrangement provides a restriction on the optimization that can be performed.

[0730] (1) A virtual Z-axis is produced, and the arrangement of component types along the virtual Z-axis is performed without considering the fixed arrangement.

[0731] (2) The component tapes are moved from the virtual Z-axis to a real Z-axis. When doing so, the fixed arrangement is respected, so that component tapes whose positions are determined by the fixed arrangement are placed first.

[0732] (3) Next, the component tapes whose positions are not determined by the fixed arrangement are moved from the virtual Z-axis to the real Z-axis. When doing so, the component tapes whose positions are not determined by the fixed arrangement are arranged in order in the positions not occupied by the component tapes arranged according to the fixed arrangement.

[0733] Finally, the cut down process is performed on the component tapes arranged along the Z-axis to produce pickup patterns.

[0734] By operating in this way, a single algorithm can be used to manage whatever fixed arrangement is specified by the user.

[0735] This algorithm that can handle fixed arrangements copes with the fixed arrangement specified by the user by altering an ideal arrangement of component tapes that has been generated by an algorithm that operates in the absence of a fixed arrangement.

[0736] As a result, the mounting times can be compared for the case when an ideal arrangement of component tapes is used and the case where a fixed arrangement of component tapes is present.

[0737] This presents the user with information that allows the user to compare the advantage of being able to easily change the device setup when a fixed arrangement is used with the shorter mounting time that is achieved when no fixed arrangement is used. As a result, the user can reevaluate the tradeoff that occurs when using a fixed arrangement.

[0738] 3.4.2 Related Individual Processes

[0739] By setting a fixed arrangement, the user specifies the Z numbers for arranging a plurality of component tapes. The arrangement of component tapes along the Z-axis is subject to optimization by an optimization algorithm, so that the optimization algorithm needs to consider the fixed arrangement specified by the user.

[0740] The algorithm used when there is a fixed arrangement copes with the fixed arrangement by altering the ideal arrangement of component tapes which is generated by the algorithm used when there is no fixed arrangement.

[0741] This process is explained in detail in the following sections.

[0742] Entire Flow (starting from the histogram)

[0743] Fixed Arrangement in the Feeder Block and Arrangement of “Peaks”

[0744] Fixed Arrangement: Judgement whether Fixed Position is Available

[0745] Fixed Arrangement of Double-Cassette Feeders

[0746] Fixed Arrangement of Double-Cassette Feeders (Supplementary Explanation)

[0747] 3.5 Dealing with LL-sized Substrates

[0748] 3.5.1 Overview

[0749] LL-sized substrates are substrates whose size in the transportation direction is larger than ordinary substrates that have no limitation on the mounting region. As shown in FIG. 46, LL-sized substrates have a mounting region (the “LL-restricted region”) where components can be mounted only by special heads (nozzles).

[0750] These special heads are only capable of picking up components from component tapes (feeders) that are located within a certain range of Z numbers.

[0751] These restrictions for LL-sized substrates are managed by using the following two methods, as shown in FIG. 47.

[0752] (1) Interchanging the positions of component tapes along the Z-axis

[0753] (2) Changing the pickup method

[0754] Process (1) arranges the component tapes that include components to be mounted at mounting points in the LL-restricted region within the range on Z numbers where components can be picked up by the heads that are capable of mounting components in the LL-restricted region. When component tapes have been arranged at all of the Z numbers on the Z-axis, this is achieved by interchanging component tapes.

[0755] Process (2) virtually divides the component histogram including mounting points that are located in the LL-restricted region into the following two component histograms.

[0756] A component histogram that is composed of mounting points that are located in the LL-restricted region

[0757] A component histogram that is composed of mounting points that are not located in the LL-restricted region

[0758] After this, during mounting the component histograms are separately cut down for the heads that can be used for mounting. The results of the cut down process are then combined and set as a single task.

[0759] 3.5.2 Interchanging Component Tapes on the Z-Axis

[0760] (1) Heads 1 to 6 cannot mount components in the LL-restricted region

[0761] (2) Heads 7 to 10 can mount components in the LL-restricted region

[0762] (3) Due to the restrictions on mounter construction, each head is only capable of picking up components from a limited range of Z positions.

[0763] (4) If component tapes with mounting points present in the LL-restricted region are located at any of the positions Z=1 to 11, these component tapes are exchanged with component tapes that are located at positions Z=12 or higher and do not have any mounting points in the LL-restricted region.

[0764] 3.5.3 Changes to the Pickup Method

[0765] (1) The mounting points at each Z position are sorted into “mounting points in the LL-restricted region” and “mounting points that are not in the LL-restricted region”.

[0766] (2) The heads are divided into two groups, heads 1 to 6 and heads 7 to 10, and these groups are treated as if they compose a two separate line gang pickup heads.

[0767] (3) The cut down process is performed using six heads for the mounting points of the component tapes with no mounting points in the LL-restricted region to generate tasks composed of six mounting points.

[0768] (4) The cut down process is performed using four heads for the mounting points of the component tapes with mounting points in the LL-restricted region to generate tasks composed of four mounting points.

[0769] (5) The 6-mounting-point-tasks and 4-mounting-point-tasks are combined to produce 10-mounting-point tasks 3.5.4 Related Individual Processes

[0770] In order to handle LL-size substrates, it is necessary to change the pickup method and interchange component tapes along the Z-axis. To do so, two algorithms are provided.

[0771] The details of this process are described in the following sections.

[0772] LL Restrictions: Changes to the Pickup Method (1)

[0773] In order to handle LL-size substrates, component tapes are divided into component tapes with mounting points in the LL-restricted region and component tapes with no mounting points in the LL-restricted region. Components with mounting points in the LL-restricted region are picked up using heads 7 to 10, while components with no mounting points in the LL-restricted region are picked up using heads 1 to 6.

[0774] Components are picked up in order starting with component tapes arranged at the side of the mountain. When dealing with the left block, the processing proceeds from an area on the Z-axis with higher Z numbers than the Z numbers from which heads 1 to 6 pick up components, which is to say, in a direction moving towards the component recognizing camera. This is also the case for the right block.

[0775] LL Restrictions: Changes to the Pickup Method (2)

[0776] Component tapes that do not have mounting points located in the LL-restricted region are handled as follows. Components are successively picked up using heads 1 to 6 in order starting from the component tapes at the side of the mountain. After this, the same processing is performed for component tapes that have mounting points located in the LL-restricted region, so that with components are successively picked up using heads 1 to 6 in order starting from the component tapes at the side of the mountain

[0777] Unlike the processing in “LL Restrictions: Changes to the Pickup Method (2)”, components are not necessarily picked up in a direction that moves towards the component recognizing camera.

[0778] LL Restrictions: Interchanging of Component Tapes in the Z-Axis (1)

[0779] A search is performed to find component tapes, out of the component tapes arranged at Z numbers 1 to 11, that have mounting points with X coordinates that are higher than 400 mm, and these component tapes are interchanged with component tapes that do not have mounting points with X coordinates that are higher than 400 mm.

[0780] LL Restrictions: Interchanging of Component Tapes in the Z-Axis (2)

[0781] This processing deals with the X coordinates of mounting points with more precision that the “LL Restrictions: Interchanging of Component Tapes in the Z-Axis (1)” process described above.

[0782] 3.6 Dealing with XL-Sized Substrates

[0783] 3.6.1 Overview

[0784] XL-sized substrates are substrates whose size in the direction perpendicular to the transportation direction is larger than ordinary substrates that have no limitation on the mounting region. As shown in FIG. 46, XL-sized substrates have a mounting region (the “XL-restricted region”) where components can be mounted only by a certain stage out of the front stage 110 and the rear stage 120. FIG. 46 shows the restricted regions (regions that cannot be reached by certain heads, making mounting by such heads impossible) on substrates of these special sizes (XL and LL).

[0785] XL-sized substrates are composed of the following three mounting regions.

[0786] a region where only the front stage 110 can mount components

[0787] a region where only the rear stage 120 can mount components

[0788] a region where the front stage 110 and the rear stage 120 can mount components

[0789] In the same way as an LL-sized substrate, there is also a region where components can be only be mounted by certain heads (nozzles).

[0790] The restrictions shown in FIG. 46 for XL-sized substrates are managed by using the following methods.

[0791] (1) Assigning component tapes to the front stage 110 or rear stage 120 based on the coordinates of mounting points.

[0792] (2) Dividing component tapes based on the coordinates of mounting points.

[0793] (3) Making an initial assignment using the region where both the front stage 110 and the rear stage 120 can mount components.

[0794] (4) Avoiding the LL restrictions

[0795] This processing is described in detail later as part of the related individual processes.

[0796] 3.6.2 Related Individual Processes

[0797] XL-sized substrates are handled by determining which of the front stage 110 and the rear stage 120 is capable of mounting a component at each mounting point and then assigning each mounting point to the front stage 110 or the rear stage 120 accordingly.

[0798] The restrictions for XL-sized substrates include the restrictions for LL-sized substrates, so that the processing performed for XL-sized substrates includes the processing performed for LL-sized substrates.

[0799] The details for this processing are given in the following section of this specification.

[0800] XL Restrictions

[0801] 3.7 Estimated Tact Time Balancing Process

[0802] 3.7.1 Overview

[0803] The estimated tact time balancing process is a process that adjusts, in the initial allocation, the balance between the front stage 110 and the rear stage 120 with the tact time level as an index.

[0804] 3.7.2 Levels on Which Balance Adjusting is Performed

[0805] The balance between the front stage 110 and rear stage 120 is adjusted by moving components between the stages. This moving of components is performed on the following two levels.

[0806] (1) In units of “mountains”

[0807] (2) In units of component tapes

[0808] In this specification a “mountain” refers to a group of component tapes that is generated as a result of optimization. This expression refers to group of component tapes that are arranged in a predetermined order, or to a component histogram that corresponds to such group of component tapes.

[0809] The estimated tact time balancing process and the tact time balancing process differ as to the level for the movement of components between the stages.

[0810] Estimated Tact Time Balancing Process: mountains, component tapes

[0811] Tact Time Balancing Process: mountains, component tapes, mounting points

[0812] In the calculation of the estimated tact time level used by the estimated tact time balancing process, the accuracy of values for the estimated tact time level of tasks composed of general components is poor. As a result, the estimated tact time balancing process is judged as being ineffective at moving components between stages in small units, so that the movement of components in units of mounting points is not performed.

[0813] The details for this processing are given in the related individual processes section below.

[0814] 3.7.3 Related Individual Processes

[0815] The “estimated tact time balancing process” is a process that adjusts the balance between the front stage 110 and the rear stage 120. This process needs to be performed when allocating component tapes to the front stage 110 and the rear stage 120.

[0816] First, component tapes are arranged starting with the front stage 110, with component tapes that cannot be arranged in the front stage 110 being arranged in the rear stage 120.

[0817] The resulting state is treated as the initial state, and the estimated tact time balance for the front stage 110 and rear stage 120 is calculated. After this, component tapes that are arranged in the front stage 110 are moved in order to the rear stage 120 until the estimated tact time balance is within tolerance (“OK”).

[0818] It should be noted that the estimated tact time for each stage is calculated as described in the “Operation of the Optimization Apparatus (Overview)” section of this specification.

[0819] The details for this processing are given in the following related individual processes sections.

[0820] Adjustment of the Estimated Tact Time Balance (in Mountain Units)

[0821] Adjustment of the Estimated Tact Time Balance (in Component Tape Units)

[0822] 3.8 Tact Time Balancing Process

[0823] 3.8.1 Overview

[0824] The tact time balancing process is a process that adjusts, after tasks have been generated, the balance between the front stage 110 and the rear stage 120 with mounting time as an index. This process corresponds to step S323 in FIG. 14. The tact time balancing process and the estimated tact time balancing process are similar operations and the difference between them lies in the index used for the balancing.

[0825] 3.8.2 Levels on Which Balance Adjusting is Performed

[0826] The balance between the front stage 110 and rear stage 120 is adjusted by moving components between the stages. This moving of components is performed on the following three levels.

[0827] (1) In units of “mountains”

[0828] (2) In units of component tapes

[0829] (3) In units of mounting points

[0830] The tact time balancing process differs from the estimated tact time balancing process in that is able to move components between the stages in units of mounting points.

[0831] 3.8.3 Related Individual Processes

[0832] The “tact time balancing process” is a process that adjusts the balance between the front stage 110 and the rear stage 120. After tasks have been generated for the front stage 110 and the rear stage 120, a tact time simulator calculates the mounting time for each stage, and the tact time balance between the front stage 110 and the rear stage 120 is adjusted by moving components from the stage with the longer mounting time to the stage with the shorter mounting time. While a different index is used for measuring the balance, this process resembles the estimated tact time balancing process described earlier.

[0833] The details for this processing are given in the following related individual processes sections.

[0834] Movement of a Mountain from the Front stage 110 to the Rear stage 120

[0835] Movement of a Component tape from the Front stage 110 to the Rear stage 120

[0836] Movement of a Mounting Point from the Front stage 110 to the Rear stage 120

[0837] Swapping in The Tact Time Balancing Process

[0838] 3.9 Details of the Separate Processes Performed by the Optimization Apparatus

[0839] 3.9.1 Cut Down Procedure

[0840] Tasks are generated using the following method.

[0841] (1) A component histogram 510 is generated (FIG. 48).

[0842] (2) The cut down process is performed on the component histogram 510 to leave a core part (FIG. 49).

[0843] In FIG. 49, the mounting points surrounded by the rectangular boxes are pickup patterns in which 10 components are simultaneously picked up.

[0844] (3) The component histogram 510 is separated into cut down part 511a (see FIG. 50A) and the core part 511b (see FIG. 50B).

[0845] (4) The core part 511b is allocated to a template 512 (see FIG. 51).

[0846] In FIG. 51, the black squares (mounting points) surrounded by rectangular frames are the mounting points that are not covered by the template. These mounting points are used to supplement the left side 513 (the positions indicated using asterisks) of the template 512.

[0847] (5) The mounting points 514 for supplementing the left side of the template 512 are determined (see FIG. 52).

[0848] (6) The left side 513 of the template 512 is supplemented (see FIG. 53)

[0849] In FIG. 53, the white squares show the mounting points used for this supplementing, the black squares that are surrounded by frames show the mounting points that are not used for supplementing, and the asterisks surrounded by frames show the mounting points that cannot be supplemented.

[0850] (7) A mountain 515 is produced from the core part and the part supplemented by the template (see FIG. 54).

[0851] (8) Another mountain 516 (see FIG. 55) is produced from the tasks 511a produced by the cut down process in process (2).

[0852] (9) The mountain 516 produced from the cut down part and the mountain 515 produced from the core part are combined to produce the mountain 517 (see FIG. 56).

[0853] (10) The cut down process is performed on the entire mountain 517 to produce the pickup patterns 518 (FIG. 57).

[0854] In FIG. 57, the 24th task (task number 24) is surrounded by a frame showing that during pickup the line gang pickup head has to make three nozzle strokes.

[0855] (11) When there are no restrictions, the component tapes can be arranged as shown along the Z-axis (see FIG. 58).

[0856] Note that when restrictions need to be considered, the following processing (from process (12) onwards) is performed.

[0857] (12) The cut down process is performed to generate tasks (the sets of components shown surrounded by frames)(see FIG. 59).

[0858] Here, processing for the core part is performed. However, at this stage, the maximum number of divisions, the feeder resources and the number of Z numbers that can be used are not considered.

[0859] In this example, the components are divided among the cassette numbers 1 to 6.

[0860] Cassette number 1: Component A

[0861] Cassette number 2: Component B

[0862] Cassette number 3: Component C

[0863] Cassette number 4: Component D

[0864] Cassette number 5: Component E

[0865] Cassette number 6: Component F

[0866] Here, the following notation is used. When component A is divided into five, the resulting components are called A1, A2, A3, A4, A5.

[0867] This is also the case for components B, C, D, E, and F. The other components have been shown in FIG. 59 using black squares.

[0868] (13) The number of cassettes is corrected in view of the maximum number of divisions (see FIG. 60).

[0869] Here, the number of cassettes is corrected for the example case where the maximum number of cassettes into which component A may be divided is four.

[0870] Since component A has been divided into five, one of A2 to A5 is combined with one of A1 to A5. When doing so, by selecting the component, out of components A2 to A5, with the lowest number of components, the effect on the number of tasks caused by this combining can be minimized.

[0871] In the illustrated example, component A5 has the lowest number (three) of components to be mounted, so that component A5 is selected and is distributed among A1 to A4. As a result, the position that was occupied by A5 becomes empty, so that the components located to the left of A5, i.e., F2, E2, and D2, are all moved one position to the right.

[0872] (14) The arrangement of cassettes following this correction is as shown by the pickup patterns in FIG. 61.

[0873] In FIG. 61, task numbers 21 to 23 are surrounded by frames showing that during pickup the line gang pickup head has to make two nozzle strokes.

[0874] (15) Next, as shown in diagram 518c, the number of used cassettes is corrected (see FIG. 62).

[0875] Here, it is assumed that the number of used cassettes is one more than the number of cassette resources.

[0876] The component, out of components A2 to A4, B2, C2, D2, E2, and F2, that has the lowest number of components to be mounted is selected and combined with other components. In the illustrated example, F2 has the lowest number (one) of components to be mounted and so is combined with F1.

[0877] (16) The arrangement of cassettes after this correction is shown by the pickup patterns 518d shown in FIG. 63.

[0878] As can be seen from FIG. 63, the number of cassettes has been reduced by one.

[0879] (17) Next, as shown in diagram 518e, the occupation of positions on the Z-axis is corrected, which is to say, the usable range of the Z-axis is investigated (see FIG. 64).

[0880] Here, it is assumed that the number of used positions in the Z-axis is one greater than the space available on the Z-axis.

[0881] In this case, a component, out of components A2 to A4, B2, C2, D2, and E2, that has the lowest number of components to be mounted is selected and combined with another component. In the illustrated example, E2 has the lowest number (two) of components to be mounted and so is combined with El.

[0882] (18) The arrangement of cassettes after this correction is shown by the pickup patterns 518f shown in FIG. 65.

[0883] As a result of the correction, the number of nozzle strokes to be made during pickup by the line gang pickup head is unchanged at four for task number 24 but has increased to three for task number 23.

[0884] (19) The components are arranged on the Z-axis.

[0885] Here, suppose that component B1 is fixed at the Z number “15” as shown by diagram 518g (see FIG. 66).

[0886] (20) First, the fixed cassette 519 is arranged on the Z-axis (see FIG. 67).

[0887] (21) The non-fixed cassettes are arranged on the Z-axis. This results in the production of the pickup patterns 520 (see FIG. 68).

[0888] At this point, the non-fixed cassettes are arranged along the Z-axis in the order of cassettes determined in process (19) while avoiding the fixed cassettes.

[0889] (22) The components are regrouped in the shape of “mountain” 521 (see FIG. 69).

[0890] (23) One again, tasks are generated using the cut down procedure to produce the pickup patterns 522 (see FIG. 70).

[0891] However, this time the core crush process is not performed. In this example, the line gang pickup head has to make three nozzle strokes to pick up the components in task number 24, two nozzle strokes to pick up the components in each of task numbers 22 and 23, and two nozzle strokes to pick up the components in each of task numbers 17 to 19.

[0892] 3.9.2 Division of the Cassettes Using a Parallelogram

[0893] The following describes the division of the cassettes in the core part using a template in the shape of a parallelogram.

[0894] (1) In this example, it is assumed that the total number of components in the core part 525 is 30 (shown on the upper level in FIG. 71). As a result, the decision is made to produce three tasks in which ten components are simultaneously picked up.

[0895] (2) First, since there are 9 cassettes, a corresponding parallelogram (template) 526 (shown on the right side of the middle level in FIG. 71) is produced. It should be noted that when there are nine rows of ten components in the parallelogram, the letters A to I appended to the right side of the parallelogram 526 show the component types when components are allocated.

[0896] (3) Focusing on the first level (the lowest level) 525a in the core part 525, the component “I” is located at the rightmost position, so that this component is arranged on the level (in the illustrated example, the lowest level) of the parallelogram 526 that has the same letter “I” (see the lower level in FIG. 71).

[0897] (4) Focusing on the second level 525b in the core part 525, the component “F” is located at the rightmost position, so that this component is arranged on the level (in the illustrated example, the fourth level) of the parallelogram 526 that has the same letter “F” (see the upper level in FIG. 72).

[0898] (5) Focusing on the third level 525c in the core part 525, the component “C” is located at the rightmost position, so that this component is arranged on the level (in the illustrated example, the seventh level) of the parallelogram 526 that has the same letter “C” (see the middle level in FIG. 72).

[0899] (6) Since there are no more levels where the letters at the rightmost position match, the remaining components 525c are arranged into the unused positions (“X”) in the levels (first, fourth, and seventh) in which components have been arranged.

[0900] (7) At this point, the component types are assigned in descending order of the number of components to be mounted (525e, 525f) (see the upper and middle levels of FIG. 73).

[0901] (8) If the remaining number of components to be mounted is equal, then components are assigned in order of the assigned letters, so that components 525g are assigned first (see the lower level in FIG. 73).

[0902] (9) The remaining components 525h to 525k are arranged into the template 526 in accordance with the above rules (see FIG. 74 and the upper level in FIG. 75).

[0903] (10) When all of the components have been arranged into the template 526, the first, fourth, and seventh levels will be full of components (see the middle level in FIG. 75), and by removing the gaps between the first, fourth, and seventh levels the division of the cassettes is completed (see the lower level in FIG. 75).

[0904] 3.9.3 Division of the Cassettes Using a Rectangle

[0905] The following describes the division of the cassettes in the core part using a template in the shape of a rectangle.

[0906] (1) In this example, a template (in the present example, a template that is 10 components wide and 3 components high) 528 is placed over a core part 525 with a total of 30 components (see the upper level in FIG. 76).

[0907] (2) The region to be supplemented (indicated using white squares) 528a is placed to the left of the region covered by the template (see the middle level in FIG. 76).

[0908] (3) Components are transferred to the supplementary region 528a of the template (see the lower level of FIG. 76 and the upper level of FIG. 77), starting with the components 527a and 527b with the most remaining components to be mounted.

[0909] (4) If two component types have the same number of remaining components, then components are assigned in order of the letters, so that components 527c are assigned first (see the middle level in FIG. 77).

[0910] (5) The remaining components 527d to 525g are arranged into the template 528a in accordance with the above rules (see FIGS. 78 and 79) and when all components have been arranged, the division of the cassettes is complete.

[0911] 3.9.4 Core Crush Process for a Given Number of Cassettes

[0912] After performing the fundamental core crush processing and forming the ideal “mountain”, the number of supplementary cassettes is suppressed to within the number allowed by the available cassette resources.

[0913] When performing the core crush processing, the following processing can be used to produce a number of supplementary cassettes that is equal to the available number of cassettes. First, numbers of components are assigned to supplementary cassettes, and the remaining components to be mounted for the component tapes that are left in the core part are evenly distributed among the same types of components.

[0914] For double cassettes, a core is left at odd-numbered Z positions, so that supplementary cassettes may be produced in the same way as in the core crush process for single cassettes. In this case, the supplementary cassettes are used in only the odd-numbered side of the double cassettes (the odd-numbered Z positions). The processing for suppressing the number of cassettes can be performed in the same way as with single cassettes.

[0915] In more detail,

[0916] (1) Core crush processing is performed on the core part to produce an ideal “mountain”.

[0917] (2) The number N of supplementary cassettes is found.

[0918] (3) The number N of supplementary cassettes is compared with the given number of cassettes M.

[0919] (4) If N≦M then the process ends.

[0920] Here the return value is assumed to be “N”.

[0921] In the core crush processing, there are cases where it is not necessary to utilize the entire number of cassettes available, so that N is set as the return value.

[0922] Since the maximum number of supplementary cassettes is 9, this processing has no effect when there are 10 or more cassettes available

[0923] Cassette resources are managed using the return value N.

[0924] (5) If N>M, then the number of cassettes is suppressed by one.

[0925] (5.1.) The cassette C with the lowest number of components to be mounted is found in the mountain.

[0926] (5.2) A cassette D with the same component type as cassette C is found in the mountain. Here, in some cases, a plurality of suitable cassettes D are present. Note that cassette C is not included in the number of cassettes D.

[0927] (5.3) The number of components to be mounted for cassette C are evenly distributed among the cassettes D. When this number cannot be distributed evenly, the components to be mounted are distributed in a manner that increases the number of components to be mounted near the center of the mountain.

[0928] As one example, when five components are to be mounted for cassette C and there are three cassettes D, the components are divided into 2 components, 2 components, and 1 component, and distributed as 2 components, 2 components, and 1 component to cassettes in order starting from the closest cassette to the center of the mountain.

[0929] (6) One is subtracted from the number of supplementary cassettes N.

[0930] (7) The processing returns to (3)

[0931] 3.9.5 Task Generation Process for Small Components

[0932] This process determines which nozzle numbers should correspond to which Z numbers and generates a pickup pattern for each task.

[0933] The correspondence between nozzles and mounting points is decided according to the greedy method.

[0934] The apparatus scans the “mountain” starting from its “sides” and generates pickup patterns. When doing so, the heads and the scanning direction for the Z-axis are opposite for the left block situated on the left side of the mountain where the Z numbers are low and the right block situated on the right side of the mountain where the Z numbers are high, though fundamentally the same operation is performed.

[0935] In the case of double cassettes, components to be mounted for component tapes located in the odd-numbered Z positions are assigned to pickup patterns after all of the components to be mounted for component tapes located in the even-numbered Z positions have been assigned to pickup patterns. When the last task to be produced from the component tapes located in the even-numbered Z positions is composed of fewer that 10 components, the remaining spaces in the pickup pattern can be used to pick up components from component tapes located in odd-numbered Z positions.

[0936] Points to be Considered During Programming

[0937] In the processing described below, it is judged whether components should be picked up from a component tape arranged on the real Z-axis by judging whether this component tape belongs to the mountain that is being processed. To achieve this, a component tape is provided with information, such as a “mountain number” or the like showing which mountain it belongs to, as an attribute. Setting this attribute in advance facilitates the processing. In some cases, two or more mountains are produced from the same component group, so that it is preferable not to use the component group number to identify a mountain.

[0938] Case for the Left Block (A Mountain For Single Cassettes)

[0939] (8) The task number t is set at “1”.

[0940] (9) The total number of mounting points for the component tapes composing this mountain is found and is set as the total number of mounting points.

[0941] (9.1) When the total number of mounting points is zero, the following processing is performed.

[0942] (9.1.1) Proceed to process (15)

[0943] A mountain with no mounting points does not exist, so the processing returns an error.

[0944] (10) The nozzle with the lowest nozzle number, out of the nozzles that are in the task with task number t and have not been associated with a Z number, is found and its nozzle number is set as Nvac.

[0945] Here, the nozzles are assumed to be numbered 1 to 10. When none of the nozzles has been associated with a Z number, Nvac is set at “1”.

[0946] (10.1) When all of the nozzles have been associated with a Z number, the following processing is performed.

[0947] (10.1.1) Proceed to process (13)

[0948] The processing proceeds to the generation of the pickup pattern for the next task. The number of picked up components for the present task is 10.

[0949] (11) Out of the Z numbers of the component tapes that compose the mountain, the lowest Z number at which the nozzle number Nvac can pick up a component is found and set as Zvac.

[0950] For the front stage 110, these Z numbers are the odd numbers in the range 1 to 48.

[0951] For the rear stage 120, these Z numbers are the odd numbers in the range 97 to 144.

[0952] (11.1) The following processing is performed when no suitable Z number is found.

[0953] (11.1.1) Proceed to process (13)

[0954] The processing proceeds to the generation of the pickup pattern for the next task, with the number of picked up components for the present task being less than 10.

[0955] As one example, when a component tape is present only at the position Z=1, only nozzle 1 is capable of picking up a component. Since there are no component tapes from which nozzles 2 to 10 can pick up a component, the value Zvac cannot be set.

[0956] (12) When the total number of mounting points is a valid value and Nvac is 10 or below, the following processing is performed.

[0957] (12.1) The following processing is performed for the case where no Z number has been associated with the nozzle with the nozzle number Nvac and a component tape at the position Zvac belongs to the mountain.

[0958] (12.1.1) The nozzle with the nozzle number Nvac is associated with the position Zvac.

[0959] (12.1.2) The number of mounting points for the component tape at the position Zvac is reduced by one.

[0960] (12.1.3) The total number of mounting points is reduced by one.

[0961] As one example, when a first pickup operation is performed with one nozzle not picking up a component, there is no guarantee than in a second pickup operation, the adjacent nozzles will be able to pick up a component, which is why a judgement is performed as to whether no Z number has been associated with the nozzle with the nozzle number Nvac.

[0962] Also, since there is the possibility of a component tape (such as component tape subject to a fixed arrangement) that is unrelated to a present mountain appearing in the mountain, that this condition is checked (in the latter half of the processing).

[0963] (12.2) One is added to the value of Nvac.

[0964] (12.3) Two is added to the value of Zvac.

[0965] (12.4) The processing returns to process (12).

[0966] (13) One is added to the task number

[0967] (14) The processing returns to process (10)

[0968] (15) The pickup pattern generating procedure ends.

[0969] Case for the Right Block (A Mountain for Single Cassettes)

[0970] (16) The task number t is set at “1”.

[0971] (17) The total number of mounting points for the component tapes composing this mountain is found and is set as the total number of mounting points.

[0972] (17.1) When the total number of mounting points is zero, the following processing is performed.

[0973] (17.1.1) Proceed to process (23)

[0974] A mountain with no mounting points does not exist, so the processing returns an error.

[0975] (18) The nozzle with the highest nozzle number, out of the nozzles that are in the task with task number t and have not been associated with a Z number, is found and its nozzle number is set as Nvac.

[0976] Here, the nozzles are assumed to be numbered 1 to 10. When none of the nozzles has been associated with a Z number, Nvac is set at “10”.

[0977] (18.1) When all of the nozzles have been associated with a Z number, the following processing is performed.

[0978] (18.1.1) Proceed to process (21)

[0979] The processing proceeds to the generation of the pickup pattern for the next task. The number of picked up components for the present task is 10.

[0980] (19) Out of the Z numbers of the component tapes that compose the mountain, the highest Z number at which the nozzle number Nvac can pick up a component is found and set as Zvac.

[0981] For the front stage 110, these Z numbers are the odd numbers in the range 49 to 96.

[0982] For the rear stage 120, these Z numbers are the odd numbers in the range 145 to 192.

[0983] (19.1) The following processing is performed when no suitable Z number is found.

[0984] (19.1.1) Proceed to process (21)

[0985] The processing proceeds to the generation of the pickup pattern for the next task, with the number of picked up components for the present task being less than 10.

[0986] As one example, when a component tape is present only at the position Z=1, only nozzle 1 is capable of picking up a component. Since there are no component tapes from which nozzles 2 to 10 can pick up a component, the value Zvac cannot be set.

[0987] (20) When the total number of mounting points is a valid value and Nvac is 1 or above, the following processing is performed.

[0988] (20.1) The following processing is performed for the case where no Z number has been associated with the nozzle with the nozzle number Nvac and a component tape at the position Zvac belongs to the mountain.

[0989] (20.1.1) The nozzle with the nozzle number Nvac is associated with the position Zvac.

[0990] (20.1.2) The number of mounting points for the component tape at the position Zvac is reduced by one.

[0991] (20.1.3) The total number of mounting points is reduced by one.

[0992] As one example, when a first pickup operation is performed with one nozzle not picking up a component, there is no guarantee than in a second pickup operation, the adjacent nozzles will be able to pick up a component, which is why a judgement is performed as to whether no Z number has been associated with the nozzle with the nozzle number Nvac.

[0993] Also, since there is the possibility of a component tape (such as component tape subject to a fixed arrangement) that is unrelated to a present mountain appearing in the mountain, that this condition is checked (in the latter half of the processing).

[0994] (20.2) One is added to the value of Nvac.

[0995] (20.3) Two is added to the value of Zvac.

[0996] (20.4) The processing returns to process (20).

[0997] (21) One is added to the task number

[0998] (22) The processing returns to process (18)

[0999] (23) The pickup pattern generating procedure ends.

[1000] Case for the Left Block (A Mountain for Double Cassettes)

[1001] (24) Components are picked up from the even-numbered Z positions in double cassettes in the same way as in the case for the left block (a mountain for single cassettes) described above.

[1002] The process differs in that the pickup process is performed for even-numbered Z positions, not odd-numbered Z positions.

[1003] (25) When the last task to be produced from the component tapes located in the even-numbered Z positions is composed of fewer that 10 components, the task number of this task is set as the initial value to be used when picking up components from the odd-numbered Z positions in the double cassettes.

[1004] In this last task, components are picked up using the nozzles in order starting with nozzle 1, so that the unused nozzles have high nozzle numbers. If the pickup pattern of this task is used as the initial state for picking components from the odd-numbered Z positions, it will not be possible to pick up components from component tapes arranged at or around position Z=1, for example. Because of this, the mounting points that are already associated with nozzles are moved to nozzles with high nozzle numbers so as to free the nozzles with low nozzle numbers.

[1005] (26) Components are picked up from the odd-numbered Z positions in double cassettes in the same way as in the case for the right block (a mountain for single cassettes) described above.

[1006] The process differs in that the pickup process is performed for even-numbered Z positions, not odd-numbered Z positions.

[1007] That is, this process differs in that when, as a result of this process picking up components from the even-numbered Z positions in double cassettes, the last task is composed of less than ten components, this task is used as an initial state of the first task produced by picking up components from the odd-numbered Z positions in double cassettes.

[1008] Case for the Right Block (A Mountain for Double Cassettes)

[1009] (27) Components are picked up from the even-numbered Z positions in double cassettes in the same way as in the case for the right block (a mountain for single cassettes) described above.

[1010] The process differs in that the pickup process is performed for even-numbered Z positions, not odd-numbered Z positions.

[1011] (28) When the last task to be produced from the component tapes located in the even-numbered Z positions is composed of fewer that 10 components, the task number of this task is set as the initial value to be used when picking up components from the odd-numbered Z positions in the double cassettes.

[1012] In this last task, components are picked up using the nozzles in order starting with nozzle 10, so that the unused nozzles have low nozzle numbers. If the pickup pattern of this task is used as the initial state for picking components from the odd-numbered Z positions, it will not be possible to pick up components from component tapes arranged at or around position Z=96, for example. Because of this, the mounting points that are already associated with nozzles are moved to nozzles with low nozzle numbers so as to free the nozzles with high nozzle numbers.

[1013] (29) Components are picked up from the odd-numbered Z positions in double cassettes in the same way as in the case for the right block (a mountain for single cassettes) described above.

[1014] The process differs in that the pickup process is performed for even-numbered Z positions, not odd-numbered Z positions.

[1015] That is, this process differs in that when, as a result of this process picking up components from the even-numbered Z positions in double cassettes, the last task is composed of less than ten components, this task is used as an initial state of the first task produced by picking up components from the odd-numbered Z positions in double cassettes.

[1016] 3.9.6 Intersection Disentanglement

[1017] “Intersection disentanglement” is an optimization algorithm for the assignment of mounting points that is performed after tasks have provisionally determined by assigning mounting points to pickup patterns using the greedy method and hill-climbing method.

[1018]
FIG. 80A shows example mounting paths 503a (that have been determined by the greedy method) before intersection disentanglement is performed, while FIG. 80B shows mounting paths 503b after intersection disentanglement has been performed. As shown in these drawings, the algorithm stops the mounting paths taken by the line gang pickup head unnecessarily crossing over one another.

[1019] It should be noted that when the mounting points of the tasks being processed are subject to the head restrictions for an LL or XL substrate, the intersection disentanglement algorithm can be used only if all the mounting points in the part tasks to be interchanged satisfy the expression where head1=head2. In other cases, there is an extremely high probability that use of the intersection disentanglement algorithm results in the head being unable to reach certain mounting points.

[1020]
FIG. 81A shows some example mounting paths that are used to explain the intersection disentanglement algorithm. FIG. 81B shows an example where there is one intersection for the mounting points joining four mounting points. A specific example of an algorithm that can be used is described below.

[1021] (0) The distance moved by the line gang pickup head for the mounting points in each task is calculated, and the total for all tasks is found.

[1022] (1) The value “1” is substituted into the Z coordinate and cutpoints for which mounting points are to be interchanged.

[1023] (2) The value “1” is substituted into task1 for which mounting points are to be interchanged (task1=1).

[1024] (3) The value “task1+1” is substituted into task2 for which mounting points are to be interchanged task2=taskl+1.

[1025] (4) The head numbers (head1, head2) corresponding to the cutpoint are found for each task.

[1026] (5) Are the two head numbers appropriate?

[1027] (5.1) When the head numbers are inappropriate (i.e., there is no mounting point corresponding to the indicated Z number), the processing advances to process (13)

[1028] (5.2) When the head numbers are appropriate, the processing advances to process (6)

[1029] (6) The distance moved by the line gang pickup head for the mounting points in each task is calculated, and the total (olength) is found.

[1030] (7) The partial tasks to the left of the cutpoint are interchanged.

[1031] (8) The distance moved by the line gang pickup head for the mounting points in each task is calculated, and the total (nlengthL) is found.

[1032] (9) The partial tasks to the right of the cutpoint are interchanged.

[1033] (10) The distance moved by the line gang pickup head for the mounting points in each task is calculated, and the total (nlengthR) is found.

[1034] (11) The three totals olength, nlengthL, and nlengthR are compared to find the lowest total.

[1035] (12) The tasks that result in this lowest total are set as new tasks.

[1036] (13) Variable task2 is incremented. (task2=task2+1)

[1037] (14) Variable task2 is compared with the total number of tasks.

[1038] (14.1) When task2 does not exceed the number of tasks, the processing returns to process (4).

[1039] (14.2) When this is not the case, the processing advances to process (15).

[1040] (15) Variable tasks is incremented. (task1=task2+1)

[1041] (16) Variable tasks is compared with the total number of tasks.

[1042] (16.1) When tasks does not exceed the number of tasks, the processing returns to process (3).

[1043] (16.2) When this is not the case, the processing advances to process (17).

[1044] (17) The variable cutpoint is incremented (cutpoint=cutpoint+1)

[1045] (18) Variable cutpoint is compared with the total number of Z coordinates.

[1046] (18.1) When cutpoint does not exceed the number of Z coordinates, the processing returns to process (2).

[1047] (18.2) When this is not the case, the processing advances to process (19).

[1048] (19) The distance moved by the line gang pickup head for the mounting points in each task is calculated, and the total for all tasks is found.

[1049] (20) It is investigated whether the total distance moved by the line gang pickup head has been reduced.

[1050] (20.1) When the total has been reduced, the processing returns to process (0).

[1051] (20.2) When this is not the case, the processing ends.

[1052]
FIGS. 82A and 82B show one example of when mounting paths are subjected to intersection disentanglement using this kind of algorithm. FIG. 82A shows the mounting paths before intersection disentanglement (mounting paths produced by the greedy method), while FIG. 82B shows the mounting paths after intersection disentanglement. As can be seen from FIGS. 82A and 82B, the number of places where the mounting paths cross and the total length of the mounting paths are greatly reduced after the intersection disentanglement.

[1053] 3.9.7 Return Optimization

[1054] Return optimization is an algorithm for optimizing the mounting paths for tasks after mounting points have been assigned to all of the tasks.

[1055] In detail, this algorithm is composed of the following processes.

[1056] [A] Algorithm for Determining an Initial Mounting Order for Tasks

[1057] (0) The X coordinate of the final mounting point of each task is found.

[1058] (1) A task number list (up[ ]), in which tasks are arranged in descending order of highest X coordinate for the final mounting point, is produced.

[1059] (2) The highest Z coordinate for the component tapes of each task is found (the highest Z coordinate from which head number 10 picks up a component).

[1060] (3) A task number list (point[ ].task), in which tasks are arranged in descending order of highest Z coordinate, is produced.

[1061] (4) For each task, a pair of a present task (here referred to as the “former task”) and a task (here referred to as the “latter task”) that is mounted following the former task is formed.

[1062] (4.1) The variable a is set at “1”.

[1063] (4.2) The ath task in task number list (up[ ]), in which tasks are arranged in descending order of highest X coordinate for the final mounting point, is assigned to the former task in the pair including the ath task.

[1064] (4.3) The ath task in the task number list (point[ ].task), in which tasks are arranged in descending order of highest Z coordinate, is assigned to the latter task in the pair including the ath task.

[1065] (4.4) The variable a is incremented by “1”.

[1066] (4.5) The variable a is compared with the number of tasks.

[1067] (4.5.1) When the variable a does not exceed the number of tasks, the processing returns to process (4.1).

[1068] (4.5.2) When the variable a exceeds the number of tasks, the processing advances to (5).

[1069] (5) The mounting order number 1 is assigned to the task whose final mounting point has the highest X coordinate.

[1070] (6) The variable a is set at “1”.

[1071] (7) A pair of tasks that has the task with the mounting order number a as the former task is found.

[1072] (8) The latter task in the above pair is found.

[1073] (9) It is investigated whether a mounting order number has already been assigned to the latter task.

[1074] (9.1) When a mounting order number has not been assigned to the latter task, the mounting order number (a+1) is assigned to the latter task.

[1075] (9.2) When a mounting order number has been assigned to the latter task, an investigation is performed to see whether there are any tasks that have not been assigned a mounting order number.

[1076] (9.2.1) When tasks that have not been assigned a mounting order number still remain, the mounting order number (a+1) is assigned to the task, out of the remaining tasks, whose final mounting point has the highest X coordinate.

[1077] (9.2.2) When all tasks have been assigned a mounting order number, the initialization is complete, and the processing advances to process (10).

[1078] (9.3) The variable a is incremented by “1”.

[1079] (9.4) The processing returns to process (7) to find the next task to be processed.

[1080] [B] Search for the Optimal Mounting Order for Tasks by Interchanging Tasks.

[1081] (10) The distance moved by the line gang pickup head for the mounting points in each task is calculated, and the total P1 for all tasks is found.

[1082] (11) Two tasks are provisionally interchanged in the mounting order and the mounting order is updated if this results in the line gang pickup head moving by a shorter distance.

[1083] (11.1) The value 1 is substituted into the variable tasks that is used for interchanging tasks in the mounting order (taskl=1).

[1084] (11.2) The value (taskl+1) is substituted into the variable task2 that is also used for interchanging tasks in the mounting order (task2=task1+1).

[1085] (11.3) The distance moved by the line gang pickup head for the mounting points in each task is calculated, and the total (olength) is found.

[1086] (11.4) A new mounting order for tasks is produced by interchanging task1 and task2.

[1087] (11.5) The distance moved by the line gang pickup head for the mounting points in each task is calculated, and the total (nlength) is found.

[1088] (11.6) The two totals olength and nlength are compared to find the lower total.

[1089] (11.7) The mounting order that results in this lower total is set as the new mounting order.

[1090] (11.8) Variable task2 is incremented (task2=task2+1).

[1091] (11.9) Variable task2 is compared with the number of tasks.

[1092] (11.9.1) When task2 does not exceed the number of tasks, the processing returns to process (11.3).

[1093] (11.9.2) When this is not the case, the processing advances to process (11.10).

[1094] (11.10) Variable task1 is incremented (task1=task1+1).

[1095] (11.11) Variable task1 is compared with the number of tasks.

[1096] (11.11.1) When task1 does not exceed the number of tasks, the processing returns to process (11.2).

[1097] (11.11.2) When this is not the case, the processing advances to process (12).

[1098] (12) The distance moved by the line gang pickup head for the mounting points in each task is calculated for the mounting order in which tasks have been interchanged, and the total P2 for all tasks is found.

[1099] (13) It is investigated whether the total distance moved by the line gang pickup head has been reduced (i.e., whether P2<P1).

[1100] (23.1) When the total has been reduced, the value P2 is substituted into P1, and the processing returns to process (11).

[1101] (23.2) When this is not the case, the processing ends.

[1102] As can be understood from the above, this algorithm can be roughly divided into the following two parts

[1103] Part 1

[1104] (i) As shown in FIG. 83, the pickup point (task) that is closest to the final mounting point of each task is found (shown by the arrows drawn with the solid lines). FIG. 83 illustrates the “return” operation that was shown in FIG. 44, and shows the final mounting positions (the circles shown in boxes) on the substrate and the positions (the circles 1 to 19 that have been arranged in a horizontal line) along the Z-axis of the component cassettes from which components should be taken next.

[1105] (ii) Mounting paths (the dotted lines in FIG. 83) are successively drawn starting from the number 1 pickup point.

[1106] (iii) When the path taken by the head returns to the number 1 pickup point, the path taken thusfar is set as shortest looped partial path 1.

[1107] (iv) A pickup position that is yet to be included in a shortest loop partial path generated so far is found. In the example shown in FIG. 83, the pickup position 4 is found.

[1108] (v) The processing returns to (ii).

[1109] As a result of this processing, five shortest loop partial paths are found for the example shown in FIG. 83.

[1110] Part 2

[1111] An investigation is performed to find out which pickup point should be handled first to optimize the mounting order of a plurality of shortest loop partial paths. Note that here, mounting may performed in order starting from the right, since there is no need to return to the first position.

[1112]
FIG. 84A shows the “return” operation performed when there are a plurality of mounting points for the same component tape, while FIG. 84B shows the results of simulating the return paths of the line gang pickup head when using the return optimization algorithm. As can be seen from FIG. 84B, the movement paths 532a resulting from the application of the return optimization algorithm (shown in the left part of the drawing) include fewer unnecessary crossovers than the movement paths 532b before the application of the return optimization algorithm.

[1113] 3.9.8 Entire Flow (Starting from the Histogram)

[1114] (1) Component groups are formed from the mounting point data.

[1115] (2) “Mountains” are formed from the component groups for small components.

[1116] (2.1) Component tapes are classified into the following three groups according to the cassettes used

[1117] 1. Component tapes for use in single cassettes.

[1118] 2. Component tapes for use in double cassettes (with a feed pitch of 2 mm).

[1119] 3. Component tapes for use in double cassettes (with a feed pitch of 4 mm).

[1120] (2.2) A mountain is formed on a virtual Z-axis for the component tapes for use in single cassettes.

[1121] (2.2.1) A component histogram is generated on the virtual Z-axis.

[1122] Component tapes are arranged in descending order of the number of components to be mounted.

[1123] The component tape with the highest number of components to be mounted is arranged at the position Z=1.

[1124] (2.2.2) The number of component tapes forming the component histogram is set as N.

[1125] (2.2.3) The virtual Z-axis is converted into a real Z-axis.

[1126] The component tapes from the position Z=1 to the position Z=N on the virtual Z-axis are arranged at the odd-numbered Z positions on the real Z-axis in the range Z=1 to Z=2N.

[1127] (2.3) A mountain is formed on a virtual Z-axis for the component tapes for use in double cassettes with a feed pitch of 2 mm.

[1128] (2.3.1) A component histogram is generated on the virtual Z-axis.

[1129] Component tapes are arranged in descending order of the number of components to be mounted.

[1130] The component tape with the highest number of components to be mounted is arranged at the position Z=1.

[1131] (2.3.2) The number of component tapes forming the component histogram is set as N.

[1132] (2.3.3) A value given by dividing N by 2 (and rounding up any decimal part) is set as M.

[1133] (2.3.4) M double cassettes are prepared.

[1134] (2.3.5) A second virtual Z-axis is prepared.

[1135] (2.3.6) M double cassettes are arranged along the second virtual Z-axis at the positions Z=1 to Z=N without gaps in between them.

[1136] (2.3.7) The component tapes between the positions Z=1 to Z=M on the virtual Z-axis are arranged in the odd-numbered Z positions (Z−1, 3, 5, . . . , N−1) on the second virtual Z-axis.

[1137] In this way, component tapes are arranged into the odd-numbered positions in the double cassettes.

[1138] (2.3.8) The component tapes arranged on the virtual Z-axis in the positions Z=(M+1) to N are arranged in the even-numbered Z positions (Z−1, 3, 5, . . . , N−1) on the second virtual Z-axis.

[1139] In this way, component tapes are arranged into the even-numbered positions in the double cassettes.

[1140] When N is an odd number, the even-numbered Z position in the double cassettes arranged at the position Z=(N−1,N) on the second virtual Z-axis is empty, but is left as it is.

[1141] (2.3.9) The second virtual Z-axis is set as the virtual Z-axis.

[1142] (2.4) A mountain is formed on a virtual Z-axis for the component tapes for use in double cassettes with a feed pitch of 4 mm.

[1143] Apart from the difference in feed pitch, the same processing as “(2.3) A mountain is formed on a virtual Z-axis for the component tapes that use double cassettes with a feed pitch of 2 mm” is performed.

[1144] (2.5) The component histograms for the double cassettes with feed pitches of 2 mm and 4 mm are combined.

[1145] (2.5.1) The mountain of double cassettes with a feed pitch of 2 mm is arranged on the same virtual Z-axis as the mountain of double cassettes with a feed pitch of 4 mm.

[1146] The mountain of double cassettes with a feed pitch of 2 mm is arranged at the position Z=1, with the mountain of double cassettes with a feed pitch of 4 mm following it.

[1147] The following process changes the arrangement of cassettes, so that the cassettes may be arranged in the opposite order at this stage.

[1148] (2.5.2) The double cassettes on the virtual Z-axis are rearranged in descending order of the number of components to be mounted for the component tapes located in the odd-numbered Z positions in the double cassettes.

[1149] The double cassette with the component tape that has the highest number of components to be mounted is arranged at the position Z=1.

[1150] The pair of component tapes in each double cassette is not changed.

[1151] A mountain is produced in which double cassettes whose feed pitch is 2 mm and double cassettes whose feed pitch is 4 mm are mixed up.

[1152] When looking at the number of components to be mounted for the component tapes with odd Z numbers, the resulting histogram exhibits a steady drop in the number of components to be mounted.

[1153] When looking at the number of components to be mounted for the component tapes with even Z numbers, there are cases where the histogram does not exhibit a steady drop in the number of components to be mounted.

[1154] (3) All of the mountains are “forcibly” arranged on the real Z-axis. The mountains are arranged with no gaps starting with the front stage 110, and it is investigated whether all the mountains will fit onto the real Z-axis.

[1155] One mountain is arranged at a time in order of the component groups.

[1156] Mountains that extend over into the rear stage 120 are divided, with the latter part being assigned to the rear stage 120.

[1157] For small components, each component group is divided into “a mountain using single cassettes” and “a mountain using double cassettes”. Note that some component groups may only have one of such mountains.

[1158] When a component group of small components has been divided into “a mountain using single cassettes” and “a mountain using double cassettes”, the resulting mountains are treated as being independent.

[1159] General components are arranged into mountains in units of component groups.

[1160] Here, it is assumed that the general components are divided in accordance with user indications.

[1161] Rules for Arrangement

[1162] Since both single cassettes and double cassettes are used for small components, the cassettes are arranged in the following order. In view of the conditions regarding adjacent cassettes, the cassettes are arranged in a way that makes it unlikely for single cassettes to be adjacent to double cassettes.

[1163] 1. Double Cassettes are Arranged in the Front Stage 110

[1164] (i) A search is performed for empty Z positions starting from the Z numbers (47,48) in block A and moving towards the Z positions with lower Z numbers. Cassettes are arranged into the empty positions found in this way.

[1165] (ii) If there are no more empty Z positions in block A, a search is performed for empty Z positions starting from the Z numbers (95,96) in block B and moving towards the Z positions with lower Z numbers. Cassettes are arranged into the empty positions found in this way.

[1166] 2. Single Cassettes are Arranged in the Front Stage 110

[1167] (i) A search is performed for empty Z positions starting from the Z number 49 in block B and moving towards the Z positions with higher Z numbers. Cassettes are arranged into the empty positions found in this way.

[1168] (ii) If there are no more empty Z positions in block B, a search is performed for empty Z positions starting from the Z number 1 in block A and moving towards the Z positions with higher Z numbers. Cassettes are arranged into the empty positions found in this way.

[1169] 3. Double Cassettes are Arranged in the Rear Stage 120

[1170] (i) A search is performed for empty Z positions starting from the Z numbers (143,144) in block C and moving towards the Z positions with lower Z numbers. Cassettes are arranged into the empty positions found in this way.

[1171] (ii) If there are no more empty Z positions in block C, a search is performed for empty Z positions starting from the Z numbers (191,192) in block D and moving towards the Z positions with lower Z numbers. Cassettes are arranged into the empty positions found in this way.

[1172] 4. Single Cassettes are Arranged in the Rear Stage 120

[1173] (i) A search is performed for empty Z positions starting from the Z number 145 in block D and moving towards the Z positions with higher Z numbers. Cassettes are arranged into the empty positions found in this way.

[1174] (ii) If there are no more empty Z positions in block D, a search is performed for empty Z positions starting from the Z number 97 in block A and moving towards the Z positions with higher Z numbers. Cassettes are arranged into the empty positions found in this way.

[1175] When there are component tapes whose arrangement has been fixed, these component tapes are arranged at the Z numbers given by the fixed arrangement before the other (i.e., non-fixed) component tapes are arranged.

[1176] The processing performed when there is a fixed arrangement of double cassettes is described later in the “Fixed Arrangement Of Double Cassettes” section.

[1177] (3.1) The variable n is used to indicate a component group number, and is set at n=0.

[1178] (3.2) When the value of n is higher than the highest component group number, the processing advances to process (3.7).

[1179] (3.3) When there is a mountain of single cassettes belonging to the component group n, the following processing is performed.

[1180] (3.3.1) Component tapes are arranged in the front stage 110.

[1181] (3.3.2) When there are component tapes that cannot be arranged in the front stage 110, the mountain is divided in units of component tapes, and the component tapes that cannot be arranged in the front stage 110 are arranged in the rear stage 120.

[1182] (3.3.3) When there are component tapes that cannot be arranged in the rear stage 120, the processing returns an error.

[1183] The rules for arrangement described above are used when arranged a mountain of small components.

[1184] (3.4) When there is a mountain of double cassettes belonging to the component group n, the following processing is performed.

[1185] (3.4.1) Component cassettes are arranged in the front stage 110.

[1186] (3.4.2) When there are component tapes that cannot be arranged in the front stage 110, the mountain is divided in units of component tapes, and the component tapes that cannot be arranged in the front stage 110 are arranged in the rear stage 120.

[1187] (3.4.3) When there are component tapes that cannot be arranged in the rear stage 120, the processing returns an error.

[1188] The rules for arrangement described above are used when arranged a mountain of small components.

[1189] (3.5) The variable n is incremented by 1.

[1190] (3.6) The processing returns to process (3.2).

[1191] (3.7) The state of the mountains for the front stage 110 and the rear stage 120 is stored.

[1192] In this processing all of the mountains are arranged by packing them as compactly as possible.

[1193] (4) Mountains are arranged by packing them with no spaces, starting with the front stage 110.

[1194] An initial state for the arrangement of mountains is produced when adjusting the balance between the front stage 110 and the rear stage 120 based on estimated tact time.

[1195] The initial state for the arrangement of the mountains is produced by arranging the mountains, in ascending order of the size of component groups, with no gaps into the stages in the order “front stage 110->rear stage 120”.

[1196] When there are component tapes whose arrangement have been fixed, these component tapes are arranged at the Z numbers given by the fixed arrangement before the other (i.e., non-fixed) component tapes are arranged.

[1197] When the component tapes subject to a fixed arrangement and the mountain to which these tapes belong are arranged in the same block, these are treated as a single mountain, which is then subjected to the cut down procedure.

[1198] When the component tapes subject to a fixed arrangement and the mountain to which these tapes belong are arranged in different blocks, these are treated as separate mountains, which are separately subjected to the cut down procedure.

[1199] (4.1) The variable n is used to indicate a component group number, and is set at n=0.

[1200] (4.2) When the value of n is higher than the highest component group number, the processing advances to process (4.8).

[1201] (4.3) When there is a mountain of single cassettes belonging to the component group n, the following processing is performed.

[1202] (4.3.1) Component tapes are arranged in the front stage 110.

[1203] (4.3.2) When there are component tapes that cannot be arranged in the front stage 110, the mountain is divided in units of component tapes, and the component tapes that cannot be arranged in the front stage 110 are arranged in the rear stage 120.

[1204] (4.3.3) When there are component tapes that cannot be arranged in the rear stage 120, the processing returns an error.

[1205] The mountain is arranged into the block, out of the left and right blocks, that has the most empty Z positions.

[1206] When the left and right blocks have the same number of empty Z positions, the mountain is arranged in the right block.

[1207] When there are empty positions in the left block, but the mountain will not fit in the left block, the mountain is divided in two in units of component tapes and these are arranged in the left and right blocks.

[1208] (4.4) When there is a mountain of double cassettes belonging to the component group n, the following processing is performed.

[1209] (4.4.1) Component cassettes are arranged in the front stage 110.

[1210] (4.4.2) When there are component tapes that cannot be arranged in the front stage 110, the mountain is divided in units of component tapes, and the component tapes that cannot be arranged in the front stage 110 are arranged in the rear stage 120.

[1211] (4.4.3) When there are component tapes that cannot be arranged in the rear stage 120, the processing returns an error.

[1212] The mountain is arranged into the block, out of the left and right blocks, that has the most empty Z positions.

[1213] When the left and right blocks have the same number of empty Z positions, the mountain is arranged in the right block.

[1214] When there are empty positions in the left block, but the mountain will not fit in the left block, the mountain is divided in two in units of component tapes and these are arranged in the left and right blocks.

[1215] (4.5) A rearranging is performed, based on the estimated tact times of the mountains that have been assigned to the front stage 110 and the rear stage 120.

[1216] For each block, mountains are rearranged in order of estimated tact time so that mountains with a high tact time are located close to the component recognizing camera.

[1217] (4.6) The variable n is incremented by 1.

[1218] (4.7) The processing returns to process (4.2).

[1219] (4.7) The state of the mountains for the front stage 110 and the rear stage 120 is stored.

[1220] (5) The balance between the front and rear stages is adjusted based on estimated tact time.

[1221] (5.1) The “Estimated Tact Time Balance Adjusting Process (In Units Of Mountains)” is performed

[1222] This is described in detail in the “Estimated Tact Time Balance Adjusting Process (In Units Of Mountains)” section.

[1223] In the “Estimated Tact Time Balance Adjusting Process (In Units Of Mountains)”, the adjusting of the estimated tact time balance is finally performed in units of mounting points.

[1224] (6) The cut down procedure is performed for the small components.

[1225] (6.1) The cut down procedure is performed for each mountain, leaving core parts.

[1226] (6.1.1) For mountains of component tapes in single cassettes, the cut down process is performed in descending order of odd-numbered Z positions.

[1227] The cut down process ends when it is no longer to pick up ten components simultaneously.

[1228] (6.1.2) For mountains of component tapes in double cassettes, the cut down process is performed in descending order of even-numbered Z positions and then in descending order of odd-numbered Z positions.

[1229] If there is at least one component left at an even-numbered Z position, the cut down process is performed starting from this position.

[1230] As one example, if only one component can be picked up from an even-numbered Z position, the remaining nine components are picked up from odd-numbered Z positions.

[1231] The cut down process ends when it is no longer to pick up ten components simultaneously from odd-numbered Z positions.

[1232] A core part is left in the odd-numbered Z positions.

[1233] (6.2) A flag is set for each mountain.

[1234] The initial setting of each flag is “true”.

[1235] (6.3) The state of the mountains for the front stage 110 and the rear stage 120 is stored.

[1236] (6.4) The state of the cassette resources is stored.

[1237] (6.5) Out of the mountains for which the flag is “true”, the highest mountain M in the core part is found.

[1238] (6.5.1) When the mountain M is found, the processing advances to process (7).

[1239] This means that the core crush process has been performed on all of the mountains.

[1240] (6.6) It is investigated whether a cassette of the same type as the cassette type K used by the mountain M is left among the cassette resources.

[1241] (6.7) When a cassette of the same type is left, the following processing is performed.

[1242] (6.7.1) One cassette of the cassette type K is added to the number of cassettes used by the mountain M, and the core crush process is performed.

[1243] This is described in the “Core Crush Processing For The Available Number Of Cassettes” section.

[1244] (6.7.2) If there is no change in the height of the core part, the processing returns to process (6.6).

[1245] (6.7.3) If there is the height of the core part has been reduced, the processing advances to process (6.9).

[1246] (6.8) When no cassette of the same type is left, the following processing is performed.

[1247] (6.8.1) The state of the mountains for the front stage 110 and the rear stage 120 is restored to the immediately preceding state.

[1248] (6.8.2) The state of the cassette resources is restored to the immediately preceding state.

[1249] (6.8.3) The flag of the mountain M is set at “false”.

[1250] (6.8.4) The processing returns to process (6.3).

[1251] The following processing is performed to find the next highest mountain in the core part.

[1252] (6.9) All of the mountains are arranged along the real Z-axis.

[1253] (6.10) When all of the mountains can be arranged, the processing returns to process (6.1).

[1254] (6.11) When this is not possible, the following processing is performed.

[1255] (6.11.1) The state of the mountains for the front stage 110 and the rear stage 120 is restored to the immediately preceding state.

[1256] (6.11.2) The state of the cassette resources is restored to the immediately preceding state.

[1257] (6.11.3) The flag of the mountain M is set at “false”.

[1258] (6.11.4) The processing returns to process (6.3).

[1259] (7) Tasks are generated for the small components.

[1260] (7.1) The “Task Generation Process For Small Components” is performed.

[1261] This is described in detail in the “Task Generation Process For Small Components” section that appears later in this specification.

[1262] (8) Optimization is performed for the general components

[1263] (9) The balance between the front stage 110 and the rear stage 120 is adjusted based on mounting time.

[1264] (9.1) The “process moving a mountain from the front stage 110 to the rear stage 120” is performed.

[1265] This is described in detail in the “Process Moving A Mountain From The Front Stage 110 To The Rear Stage 120” section that appears later in this specification. 3.9.9 Arrangement of Fixed Components and Mountains within a Cassette Block

[1266] The mountains on a virtual Z-axis are composed of component tapes whose arrangement is fixed and component tapes whose arrangement is not fixed.

[1267] Here, component tapes whose arrangement is fixed are called “fixed component tapes” and component tapes whose arrangement is not fixed are called “non-fixed component tapes” Cassette blocks are also simply referred to at times as “blocks”.

[1268] The left cassette block is referred to as the “left block” and the right cassette block is referred to as the “right block” The Z numbers at which fixed component tapes are arranged are called “fixed positions”.

[1269] When division is performed for a certain component tape (a component type) to produce a plurality of component tapes, the resulting component tapes are placed into a “cassette” and this cassette is arranged on the Z-axis.

[1270] When division is not performed for a certain component tape, the number of divisions is thought of as being “1”, so that in effect, one component tape has been “produced” by dividing this component tape.

[1271] (10) The number of fixed positions in the right block is counted and set as NR.

[1272] Here, only the fixed positions that are related to fixed component tapes belonging to the present mountain are counted.

[1273] In some cases several fixed component tapes belonging to the present mountain are present.

[1274] Also, in some cases, a single component tape has several fixed positions.

[1275] (11) The number of fixed positions in the left block is counted and set as NL.

[1276] As with the right block, the number of fixed positions is counted.

[1277] (12) When NR>NL, the following processing is performed.

[1278] This corresponds to the case where the number of fixed positions is higher in the right block.

[1279] (12.1) The present mountain is arranged in the right block.

[1280] The process for arranging the mountain in this block is described below.

[1281] This process is described in detail in the “fixed arrangement: judging whether a fixed position is usable” section later in this specification.

[1282] (12.2) When the mountain cannot be arranged in the right block, it is arranged in the left block.

[1283] In some cases, other mountains have already been arranged in the right block, so that there is insufficient space on the Z-axis to arrange the present mountain.

[1284] As a result, fixed component tapes end up in the right block and a mountain ends up in the left block, though pickup operations that cross the boundary between the left and right blocks are not performed. The fixed component tapes in the right block and the mountain in the left block are treated as separate mountains.

[1285] (12.2.1) When the mountain cannot be arranged in the left block, the mountain is divided into two in units of component tapes and the resulting divisions are arranged in the left and right blocks.

[1286] Since a mountain is divided in two, a mountain that belongs to the same block as the fixed component tapes and a mountain that belongs to a different block as the fixed component tapes can be produced.

[1287] When a mountain belongs to the same block as the fixed component tapes, the mountain and fixed component tapes are treated as a single mountain (histogram) on the virtual Z-axis when the cut down procedure is performed.

[1288] (13) The following processing is performed when NR=NL

[1289] This is the case where the number of fixed positions is equal for the left and right blocks.

[1290] (13.1) The present mountain is arranged in the block, out of the left and right blocks, with the higher number of empty Z positions.

[1291] (13.2) When the number of empty Z positions is equal for the left and right blocks, the mountain is arranged in the right block.

[1292] (13.3) When the mountain cannot be arranged in the right block, the mountain is arranged in the left block.

[1293] In some cases, other mountains have already been arranged in the right block, so that there is insufficient space on the Z-axis to arrange the present mountain.

[1294] As a result, fixed component tapes end up in the right block and a mountain ends up in the left block, though pickup operations that cross the boundary between the left and right blocks are not performed. The fixed component tapes in the right block and the mountain in the left block are treated as separate mountains.

[1295] (13.3.1) When the mountain cannot be arranged in the left block, the mountain is divided into two in units of component tapes and the resulting divisions are arranged in the left and right blocks.

[1296] Since a mountain is divided in two, a mountain that belongs to the same block as the fixed component tapes and a mountain that belongs to a different block as the fixed component tapes can be produced.

[1297] When a mountain belongs to the same block as the fixed component tapes, the mountain and fixed component tapes are treated as a single mountain (histogram) on the virtual Z-axis when the cut down procedure is performed.

[1298] (14) The following processing is performed when NR<NL

[1299] This is the case where there are more fixed positions in the left block than in the right block.

[1300] (14.1) The present mountain is arranged in the left block.

[1301] (14.2) When the mountain cannot be arranged in the left block, it is arranged in the right block.

[1302] In some cases, other mountains have already been arranged in the left block, so that there is insufficient space on the Z-axis to arrange the present mountain.

[1303] As a result, fixed component tapes end up in the left block and a mountain ends up in the right block, though pickup operations that cross the boundary between the left and right blocks are not performed. The fixed component tapes in the left block and the mountain in the right block are treated as separate mountains.

[1304] (14.2.1) When the mountain cannot be arranged in the right block, the mountain is divided into two in units of component tapes and the resulting divisions are arranged in the left and right blocks.

[1305] Since a mountain is divided in two, a mountain that belongs to the same block as the fixed component tapes and a mountain that belongs to a different block as the fixed component tapes can be produced.

[1306] When a mountain belongs to the same block as the fixed component tapes, the mountain and fixed component tapes are treated as a single mountain (histogram) on the virtual Z-axis when the cut down procedure is performed.

[1307] 3.9.10 Fixed Arrangement: Judging Whether a Fixed Position is Usable

[1308] The largest number of divisions into which a component tape used as a fixed component tape may be divided is referred to as ND.

[1309] The number of component tapes produced from such a component tape during the cut down procedure (core crush process) referred to as NT. Here, the condition NT<ND is definitely valid.

[1310] The number of fixed positions in the block related to this component tapes is referred to as NZ.

[1311] In more detail, the following processes are performed.

[1312] (1) The following processes are performed for the component tapes forming a mountain in order starting at one side of the mountain.

[1313] (1.1) One component tape is selected.

[1314] (1.2) When NT≦(ND−NZ) for this component tape, the following processes are performed.

[1315] (1.2.1) The NT component tapes forming the mountain are arranged on the Z-axis without using any of the fixed positions for this component tape.

[1316] Here, component tapes are arranged in accordance with the shape of the mountain.

[1317] As a result, in some cases component tapes are arranged at the fixed positions, though this is not a problem.

[1318] (1.2.2) Component tapes are arranged at the fixed positions.

[1319] Component tapes are arranged in accordance with the user indications. Components are not picked up from these fixed positions when mounting is performed for substrates subjected to optimization, but are picked up when mounting is performed for other substrates.

[1320] (1.3) When NT>(ND−NZ) for the selected component tape, the following processing is performed.

[1321] (1.3.1) Out of the component tapes composing the mountain including the selected component tape, NT−(ND−NZ) component tapes are arranged at fixed positions starting from the component tape with the lowest number of components to be mounted.

[1322] Here, fixed positions that are close to the mountain on the real Z-axis are selected as the fixed positions for the component tapes.

[1323] (1.3.2) The remaining component tapes are arranged on the Z-axis without using any of the fixed positions for the selected component tape.

[1324] As a result, in some cases component tapes are arranged at the fixed positions, though this is not a problem.

[1325] (1.4) The processing returns to (1.1).

[1326] 3.9.11 Fixed Arrangement of Double Cassettes

[1327] Optimization is performed as follows with regard to the restrictions caused by a fixed arrangement of double cassettes.

[1328] (1) Component tapes that are held in double cassettes with a feed pitch of 2 mm are arranged to form a mountain on a virtual Z-axis (see FIG. 85). As shown in FIG. 85, a component histogram 535 in which the component tapes are arranged in order of the number of components to be mounted is divided at its midpoint, folded (here, meaning that the second half is slid back to coincide with the first half), and the two overlapping halves are combined with component tapes from the former and latter halves in alternating positions, resulting in the component histogram 536 (where pairs of component tapes have been produced by the folding).

[1329] (2) In the same way, component tapes that are held in double cassettes with a feed pitch of 4 mm are arranged to form a mountain on a virtual Z-axis (see FIG. 86). As shown in FIG. 86, a component histogram 537 in which the component tapes are arranged in order of the number of components to be mounted is divided at its midpoint, folded, and the two overlapping halves are combined with component tapes from the former and latter halves in alternating positions, resulting in the component histogram 538 (where pairs of component tapes have been produced by the folding).

[1330] (3) The component histograms 536 and 538 for the component cassettes with the respective feed pitches of 2 mm and 4 mm are combined to produce a component histogram 539 (see FIG. 87). In other words, the double cassettes are arranged in descending order of the number of components to mounted for the tapes arranged in the odd-numbered Z positions, without breaking up the pairs of component tapes in each double cassette.

[1331] (4) The component histogram 339 is split into a component histogram 539a (see FIG. 88A) containing the odd-numbered Z positions and a component histogram 539b (see FIG. 88B) containing the even-numbered Z positions.

[1332] (5) When there are no restrictions due to a fixed arrangement, these component histograms 539a and 539b may be arranged on a real Z-axis as they are (see FIGS. 89A and 89B).

[1333] (6) When there are restrictions due to a fixed arrangement, the following processing is performed. In the illustrated example, the fixed arrangement is for the components A to C with the odd-numbered Z positions shown in FIG. 90A and the components D and E with the even-numbered Z positions shown in FIG. 90B.

[1334] (7) The double cassettes that hold the components subject to the fixed arrangement are taken from the odd-numbered Z positions and even-numbered Z positions and are arranged on the right of the respective histograms (see FIGS. 91A and 91B).

[1335] (8) For odd-numbered component tapes only, the component tapes 540 that are not subject to the fixed arrangement are returned to the real Z-axis (see FIG. 92A). The even-number component tapes are left as they are (see FIG. 92B).

[1336] (9) Component tapes in the mountains are moved to the left to fill the gaps in the mountains, thereby producing component histograms 541a and 542b (see FIGS. 93A and 93B).

[1337] When doing so, the gaps in the mountain in the odd-numbered Z positions may be filled in units of double cassettes (see FIG. 93A), though since the gaps in the mountain in the even-numbered Z positions are filled by combining this mountain with the mountain 541 in the odd-numbered Z positions, there are cases where gaps remain (see FIG. 93B).

[1338] (10) The component tapes in even-numbered Z positions are reordered based on feed pitch, which produces component histogram 541c (see FIG. 94B). The component tapes in odd-numbered Z positions are left as they are (see FIG. 94A).

[1339] In more detail, the component tapes that have even-numbered Z positions and a feed pitch of 2 mm are combined with the component tapes that are present on the real Z-axis and the component tapes that are not subject to the fixed arrangement but were taken from the Z-axis together with the component tapes that are subject to the fixed arrangement. These tapes are then rearranged in descending order of the number of components to be mounted, and are placed into the even-numbered Z positions in double cassettes with a feed pitch of 2 mm.

[1340] The same processing is performed for the component tapes that have even-numbered Z positions and a feed pitch of 4 mm.

[1341] As a result, the double cassettes (43,44), (45,46), and (47,48) are no longer needed.

[1342] 3.9.12 LL Restrictions: Changes to the Pickup Method (1)

[1343] (2) A number of flags equal to the number of Z positions is provided and each flag is associated with a different Z number.

[1344] (3) The following processing is performed for the mounting points in the left block.

[1345] (3.1) The following processing is performed for the component tapes arranged at each Z position.

[1346] When no component tape is arranged at a Z position, the flag for that Z position is set at “false”.

[1347] When the component tape arranged at a Z position does not have a mounting point located in the LL-restricted region, the flag for that Z position is set at “false”.

[1348] When the component tape arranged at a Z position has a mounting point located in the LL-restricted region, the flag for that Z position is set at “true”.

[1349] (3.2) The number of mounting points that are not located in the LL-restricted region and is set at Nf (where “f” stands for “free”).

[1350] (3.3) The number of mounting points that are located in the LL-restricted region and is set at Nr (where “r” stands for “restricted”).

[1351] (3.4) When at least one of Nf and Nr is not zero, the following processing is repeated.

[1352] (3.4.1) When neither Nf nor Nr is zero.

[1353] (i) The cut down process is performed on the mounting points that are not located in the LL-restricted region to produce sets of 6 picked-up components, with the cut down Z numbers being assigned in order to the heads 1 to 6.

[1354] The number of components picked up is set as Pf.

[1355] The picking up operation is performed several times to occupy the heads 1 to 6.

[1356] The highest Z number, out of the Z numbers for the positions from which components are picked up, is set as Z max.

[1357] (ii) Pf is subtracted from Nf.

[1358] (iii) The cut down process is performed on the mounting points that have higher Z numbers than Z max and are located in the LL-restricted region to produce sets of 4 picked-up components. The cut down Z numbers are assigned in order to the heads 7 to 10.

[1359] The number of components picked up is set as Pr.

[1360] The picking up operation is performed several times to occupy the heads 7 to 10.

[1361] (iv) Pr is subtracted from Nr.

[1362] (3.4.2) When Nr is zero and Nf is not zero

[1363] (i) The cut down process is performed for all of the mounting points to produce sets of 10 picked-up components, with the cut down Z numbers being assigned in order to the heads 1 to 10.

[1364] The number of components picked up is set as Pf.

[1365] The picking up operation is performed several times to occupy the heads 1 to 10.

[1366] (ii) The number of components picked up Pf is subtracted from Nf.

[1367] (3.4.3) When Nf is zero and Nr is not zero

[1368] (ii) The cut down process is performed for all of the mounting points to produce sets of 4 picked-up components, with the cut down Z numbers being assigned in order to the heads 7 to 10.

[1369] The number of components picked up is set as Pr.

[1370] The picking up operation is performed several times to occupy the heads 7 to 10.

[1371] Heads 1 to 6 are not used to pick up components.

[1372] (ii) The number of components picked up Pr is subtracted from Nr.

[1373] (3.4.4) When both Nf and Nr are zero

[1374] The processing ends for the left block.

[1375] (4) The following processing is performed for the mounting points in the right block.

[1376] (4.1) The following processing is performed for the component tapes arranged at each Z position.

[1377] When no component tape is arranged at a Z position, the flag for that Z position is set at “false”.

[1378] When the component tape arranged at a Z position does not have a mounting point located in the LL-restricted region, the flag for that Z position is set at “false”.

[1379] When the component tape arranged at a Z position has a mounting point located in the LL-restricted region, the flag for that Z position is set at “true”.

[1380] (4.2) The number of mounting points that are not located in the LL-restricted region and is set at Nf (where “f” stands for “free”).

[1381] (4.3) The number of mounting points that are located in the LL-restricted region and is set at Nr (where “r” stands for “restricted”).

[1382] (4.4) When at least one of Nf and Nr is not zero, the following processing is repeated.

[1383] (4.4.1) When neither Nf nor Nr is zero.

[1384] (i) The cut down process is performed for the mounting points located in the LL-restricted region to produce sets of 4 picked-up components, with the cut down Z numbers being assigned in order to the heads 7 to 10.

[1385] The number of components picked up is set as Pr.

[1386] The picking up operation is performed several times to occupy the heads 7 to 10.

[1387] The lowest Z number, out of the Z numbers for the positions from which components are picked up, is set as Z min.

[1388] (ii) Pr is subtracted from Nr.

[1389] (iii) The cut down process is performed on the mounting points that have lower Z numbers than Z min and are not located in the LL-restricted region to produce sets of 6 picked-up components. The cut down Z numbers are assigned in order to the heads 1 to 6.

[1390] The number of components picked up is set as Pf.

[1391] The picking up operation is performed several times to occupy the heads 1 to 6.

[1392] (iv) Pf is subtracted from Nf.

[1393] (4.4.2) When Nr is zero and Nf is not zero

[1394] (i) The cut down process is performed for all of the mounting points to produce sets of 10 picked-up components, with the cut down Z numbers being assigned in order to the heads 1 to 10.

[1395] The number of components picked up is set as Pf.

[1396] The picking up operation is performed several times to occupy the heads 1 to 10.

[1397] (ii) The number of components picked up Pf is subtracted from Nf.

[1398] (4.4.3) When Nf is zero and Nr is not zero

[1399] (ii) The cut down process is performed for all of the mounting points to produce sets of 4 picked-up components, with the cut down Z numbers being assigned in order to the heads 7 to 10.

[1400] The number of components picked up is set as Pr.

[1401] The picking up operation is performed several times to occupy the heads 7 to 10.

[1402] Heads 1 to 6 are not used to pick up components.

[1403] (ii) The number of components picked up Pr is subtracted from Nr.

[1404] (4.4.4) When both Nf and Nr are zero

[1405] The processing ends for the right block.

[1406] (5) Processing ends.

[1407] 3.9.13 LL Restrictions: Changes to the Pickup Method (2)

[1408] (1) A number of flags equal to the number of Z positions is provided and each flag is associated with a different Z number

[1409] (2) The following processing is performed for the mounting points in the left block.

[1410] (2.1) The following processing is performed for the component tapes arranged at each Z position.

[1411] When no component tape is arranged at a Z position, the flag for that Z position is set at “false”.

[1412] When the component tape arranged at a Z position does not have a mounting point located in the LL-restricted region, the flag for that Z position is set at “false”.

[1413] When the component tape arranged at a Z position has a mounting point located in the LL-restricted region, the flag for that Z position is set at “true”.

[1414] (2.2) The number of mounting points that are not located in the LL-restricted region and is set at Nf (where “f” stands for “free”).

[1415] (2.3) The number of mounting points that are located in the LL-restricted region and is set at Nr (where “r” stands for “restricted”).

[1416] (2.4) When at least one of Nf and Nr is not zero, the following processing is repeated.

[1417] (2.4.1) When neither Nf nor Nr is zero.

[1418] (i) The cut down process is performed on the mounting points that are not located in the LL-restricted region to produce sets of 6 picked-up components, with the cut down Z numbers being assigned in order to the heads 1 to 6.

[1419] The number of components picked up is set as Pf.

[1420] The picking up operation is performed several times to occupy the heads 1 to 6.

[1421] The lowest Z number, out of the Z numbers for the positions from which components are picked up, is set as Zf.

[1422] (ii) Pf is subtracted from Nf.

[1423] (iii) The cut down process is performed on the mounting points that are located in the LL-restricted region to produce sets of 4 picked-up components. The cut down Z numbers are assigned in order to the heads 7 to 10.

[1424] The number of components picked up is set as Pr.

[1425] The picking up operation is performed several times to occupy the heads 7 to 10.

[1426] The lowest Z number, out of the Z numbers for the positions from which components are picked up, is set as Zr.

[1427] (iv) Pr is subtracted from Nr.

[1428] (v) If Zf≦Zr, the NC data is arranged in the order heads 1 to 6, then heads 7 to 10.

[1429] Components are picked up in the order heads 1 to 6, then heads 7 to 10.

[1430] Here, the pickup order matches the mounting order, with the mounting order being the order of the NC data.

[1431] (vi) If Zf>Zr, the NC data is arranged in the order heads 7 to 10, then heads 1 to 6.

[1432] Components are picked up in the order heads 7 to 10, then heads 1 to 6.

[1433] Here, the pickup order matches the mounting order, with the mounting order being the order of the NC data.

[1434] (2.4.2) When Nr is zero and Nf is not zero

[1435] (i) The cut down process is performed for all of the mounting points to produce sets of 10 picked-up components, with the cut down Z numbers being assigned in order to the heads 1 to 10.

[1436] The number of components picked up is set as Pf.

[1437] The picking up operation is performed several times to occupy the heads 1 to 10.

[1438] (ii) The number of components picked up Pf is subtracted from Nf.

[1439] (4.4.3) When Nf is zero and Nr is not zero

[1440] (i) The cut down process is performed for all of the mounting points to produce sets of 4 picked-up components, with the cut down Z numbers being assigned in order to the heads 7 to 10.

[1441] The number of components picked up is set as Pr.

[1442] The picking up operation is performed several times to occupy the heads 7 to 10.

[1443] In some cases, this produces a large number of tasks composed of 4 components.

[1444] (ii) The number of components picked up Pr is subtracted from Nr

[1445] (4.4.4) When both Nf and Nr are zero

[1446] The processing ends for the left block.

[1447] (3) The following processing is performed for the mounting points in the right block.

[1448] (3.1) The following processing is performed for the component tapes arranged at each Z position.

[1449] When no component tape is arranged at a Z position, the flag for that Z position is set at “false”.

[1450] When the component tape arranged at a Z position does not have a mounting point located in the LL-restricted region, the flag for that Z position is set at “false”.

[1451] When the component tape arranged at a Z position has a mounting point located in the LL-restricted region, the flag for that Z position is set at “true”.

[1452] (3.2) The number of mounting points that are not located in the LL-restricted region and is set at Nf (where “f” stands for “free”).

[1453] (3.3) The number of mounting points that are located in the LL-restricted region and is set at Nr (where “r” stands for “restricted”).

[1454] (3.4) When at least one of Nf and Nr is not zero, the following processing is repeated.

[1455] (3.4.1) When neither Nf nor Nr is zero.

[1456] (i) The cut down process is performed for the mounting points located in the LL-restricted region to produce sets of 4 picked-up components, with the cut down Z numbers being assigned in order to the heads 7 to 10.

[1457] The number of components picked up is set as Pr.

[1458] The picking up operation is performed several times to occupy the heads 7 to 10.

[1459] The lowest Z number, out of the Z numbers for the positions from which components are picked up, is set as Zr.

[1460] (ii) Pr is subtracted from Nr.

[1461] (iii) The cut down process is performed on the mounting points that are not located in the LL-restricted region to produce sets of 6 picked-up components. The cut down Z numbers are assigned in order to the heads 1 to 6.

[1462] The number of components picked up is set as Pf.

[1463] The picking up operation is performed several times to occupy the heads 1 to 6.

[1464] The lowest Z number, out of the Z numbers for the positions from which components are picked up, is set as Zf.

[1465] (iv) Pf is subtracted from Nf.

[1466] (v) If Zf<Zr, the NC data is arranged in the order heads 7 to 10, then heads 1 to 6.

[1467] Components are picked up in the order heads 7 to 10, then heads 1 to 6.

[1468] Here, the pickup order matches the mounting order, with the mounting order being the order of the NC data.

[1469] (vi) If Zf>Zr, the NC data is arranged in the order heads 1 to 6, then heads 7 to 10.

[1470] Components are picked up in the order heads 1 to 6, then heads 7 to 10.

[1471] Here, the pickup order matches the mounting order, with the mounting order being the order of the NC data.

[1472] (3.4.2) When Nr is zero and Nf is not zero

[1473] (i) The cut down process is performed for all of the mounting points to produce sets of 10 picked-up components, with the cut down Z numbers being assigned in order to the heads 1 to 10.

[1474] The number of components picked up is set as Pf.

[1475] The picking up operation is performed several times to occupy the heads 1 to 10.

[1476] (ii) The number of components picked up Pf is subtracted from Nf.

[1477] (3.4.3) When Nf is zero and Nr is not zero

[1478] (i) The cut down process is performed for all of the mounting points to produce sets of 4 picked-up components, with the cut down Z numbers being assigned in order to the heads 7 to 10.

[1479] The number of components picked up is set as Pr.

[1480] The picking up operation is performed several times to occupy the heads 7 to 10.

[1481] In some cases, this produces a large number of tasks composed of 4 components.

[1482] (ii) The number of components picked up Pr is subtracted from Nr

[1483] (3.4.4) When both Nf and Nr are zero The processing ends for the right block.

[1484] (4) Processing ends.

[1485] 3.9.14 LL Restrictions: Interchanging Component Tapes on the Z-Axis (1)

[1486] (1) It is assumed that prior to this stage, the cut down procedure has been performed to determine all of the mountains.

[1487] (2) For block A, the following process is performed for the positions Z=1 to 11.

[1488] (2.1) The component tape located at the position Z is set as component tape K, and the highest X coordinate of the mounting points for the component tape K is set as X max.

[1489] When no component tape is located at the position Z, X max=0 is set for the position Z.

[1490] (2.2) The following processing is performed when X max≦400.0 [mm] (i.e., when component tape K does not have a mounting point that is located in the LL-restricted region).

[1491] (2.2.1) No rearranging is performed. This is because the highest X coordinate for mounting points where mounting by nozzle 1 is possible is 400.0 [mm].

[1492] (2.3) The following processing is performed when X max>400.0 [mm] (i.e., when component tape K has a mounting point that is located in the LL-restricted region).

[1493] (2.3.1) Out of the component tapes that (a) form the mountain M containing the component tape K and (b) have a Z number that is 12 or above, a component tape that does not have a mounting point in the LL-restricted region and has a similar number of components to be mounted to the component tape K is found, and is interchanged with the component tape K.

[1494] When these component tapes are held in double cassettes, the feed pitch needs to be the same.

[1495] (2.3.2) When no such component tape is found, a component tape that has the lowest number of points to be mounted is found out of the component tapes that (a) are in block A, (b) form part of a different mountain to mountain M, (c) have a Z number that is 12 or above, and (d) don't have a mounting point in the LL-restricted region. This component tape is interchanged with the component tape K.

[1496] In some cases, the component tape K is interchanged with a component tape in a different component group.

[1497] When these component tapes are held in double cassettes, the feed pitch needs to be the same.

[1498] (2.3.3) When no such component tape is found, a component tape that has the lowest number of points to be mounted is found out of the component tapes that (a) form a mountain in block B and (b) don't have a mounting point in the LL-restricted region. This component tape is then interchanged with the component tape K.

[1499] In some cases, the component tape K is interchanged with a component tape in a different component group.

[1500] Also, in some cases, components are picked up from block A and block B in the same task.

[1501] When these component tapes are held in double cassettes, the feed pitch needs to be the same.

[1502] (2.3.4) When no such component tape is found, mounting is judged to be impossible for component tape K.

[1503] (3) The processing ends.

[1504] 3.9.15 LL Restrictions: Interchanging Component Tapes on the Z-Axis (2)

[1505] (1) It is assumed that prior to this stage, the cut down procedure has been performed to determine all of the mountains.

[1506] (2) Tasks are generated.

[1507] (3) The correspondence between the head numbers and Z positions in each task is investigated, and the lowest head number that is used for picking up a component is found for each Z position.

[1508] (4) The following processing is performed for the positions Z=1 to Z=11 in block A.

[1509] (4.1) The component tape located at the position Z is set as component tape K, and the highest X coordinate of the mounting points for the component tape K is set as X max.

[1510] When no component tape is located at the position Z, X max=0 is set for the position Z.

[1511] (4.2) The highest X coordinate at which a head (that has the lowest head number which is used to pick up a component from the position Z) can mount a component is set as Xh.

[1512] (4.3) The following processing is performed when X max≦Xh (i.e., when component tape K does not have a mounting point that is located in the LL-restricted region).

[1513] (4.3.1) No rearranging is performed.

[1514] (4.4) The following processing is performed when X max>Xh (i.e., when component tape K has a mounting point that is located in the LL-restricted region).

[1515] (4.4.1) Out of the component tapes that (a) form the mountain M containing the component tape K and (b) have a Z number that is 12 or above, a component tape that does not have a mounting point in the LL-restricted region and has a similar number of components to be mounted to the component tape K is found, and is interchanged with the component tape K.

[1516] When these component tapes are held in double cassettes, the feed pitch needs to be the same.

[1517] (4.4.2) When no such component tape is found, a component tape that has the lowest number of points to be mounted is found out of the component tapes that (a) are in block A, (b) form part of a different mountain to mountain M, (c) have a Z number that is 12 or above, and (d) don't have a mounting point in the LL-restricted region. This component tape is then interchanged with the component tape K.

[1518] In some cases, the component tape K is interchanged with a component tape in a different component group.

[1519] When these component tapes are held in double cassettes, the feed pitch needs to be the same.

[1520] (4.4.3) When no such component tape is found, a component tape that has the lowest number of points to be mounted is found out of the component tapes that (a) form a mountain in block B and (b) don't have a mounting point in the LL-restricted region. This component tape is then interchanged with the component tape K.

[1521] In some cases, the component tape K is interchanged with a component tape in a different component group.

[1522] Also, in some cases, components are picked up from block A and block B in the same task.

[1523] When these component tapes are held in double cassettes, the feed pitch needs to be the same.

[1524] (4.4.4) When no such component tape is found, mounting is judged to be impossible for component tape K.

[1525] (5) The processing ends.

[1526] 3.9.16 Processing to Handle XL-Sized Substrates (XL Restrictions)

[1527] The following describes the method used to avoid the restrictions that arise for an XL-sized substrate.

[1528] (1) Mounting points are assigned to the front stage 110 and rear stage 120 based on the coordinates of the mounting points.

[1529] (2) Component tapes are divided based on the coordinates of the mounting points.

[1530] (3) An initial assignment is made for the region for which mounting is possible for both the front stage 110 and the rear stage 120.

[1531] (4) The LL-restrictions are avoided.

[1532] In more detail, the following processes are performed.

[1533] (1) Mounting points are assigned to the front stage 110 and rear stage 120 based on the coordinates of the mounting points.

[1534] The assignment to the front stage 110 and rear stage 120 based on the coordinates of mounting points is assumed to be as shown by the table in FIG. 46.

[1535] (2) Component tapes are divided based on the coordinates of the mounting points.

[1536] (2.1) The following three patterns are used, based on the coordinates of the mounting points of the component tapes.

[1537] (i) Component tapes are assigned to the front stage 110

[1538] (ii) Component tapes are assigned to the rear stage 120

[1539] (iii) Component tapes are divided and the resulting divisions are assigned to the front stage 110 and rear stage 120.

[1540] (2.2) When pattern (iii) is used, it is necessary to divide a component tape. Rather that distribute the number of components to be mounted between the front stage 110 and rear stage 120, the mounting points themselves are distributed between the front stage 110 and rear stage 120.

[1541] (3) An initial assignment is made for the region for which mounting is possible for both the front stage 110 and the rear stage 120.

[1542] (3.1) The component tapes corresponding to the components in areas (1) and (2) shown in FIG. 46 are assigned to the front stage 110

[1543] (3.1.1) The estimated tact time for each of the component tapes corresponding to the areas (1) and (2) is calculated and the total is set as the estimated tact time of the front stage 110.

[1544] (3.2) The component tapes corresponding to the components in areas (6) and (7) shown in FIG. 46 are assigned to the rear stage 120.

[1545] (3.2.1) The estimated tact time for each of the component tapes corresponding to the areas (6) and (7) is calculated and the total is set as the estimated tact time of the rear stage 120.

[1546] (3.3) The component tapes corresponding to the components in areas (4), (5), and (6) are assigned in order of the component groups, and in descending order of the number of components to be mounted, to the front stage 110 so long as there is space still available.

[1547] (3.3.1) The estimated tact time for the component tapes arranged in this way is calculated and the total is added to the estimated tact time of the front stage 110.

[1548] (3.4) The component tapes, out of the component tapes corresponding to the components in areas (4), (5), and (6) that were not arranged in the front stage 110, are arranged in the rear stage 120.

[1549] (3.4.1) The estimated tact time for the component tapes arranged in this way is calculated and the total is added to the estimated tact time of the rear stage 120.

[1550] When these component tapes cannot be arranged in the rear stage 120, the processing returns an error.

[1551] (3.5) The following processing is performed when the estimated tact time of the front stage 110<the estimated tact time of the rear stage 120.

[1552] (3.5.1) There is no chance of any further improvements being made to the balance, so the processing ends.

[1553] (3.6) The following processing is repeated when the estimated tact time of the front stage 110>the estimated tact time of the rear stage 120.

[1554] (3.6.1) A component tape, out of the tapes corresponding to the components in areas (4), (5), and (6) that were arranged in the front stage 110, that has the lowest number of components to be mounted is moved over to the rear stage 120.

[1555] If component tapes can no longer be moved over into the rear stage 120 (i.e., there are no more free Z positions in the rear stage 120), there is no chance of any further improvements being made to the balance, so the processing ends.

[1556] (3.6.2) The estimated tact time of the front stage 110 and the estimated tact time of the rear stage 120 are recalculated.

[1557] (4) The LL-restrictions are avoided.

[1558] (4.1) Areas (2) and (5) in the front stage 110 correspond to the LL-restricted region, so that suitable processing for the LL-restrictions is performed.

[1559] (4.2) Areas (3) and (6) in the rear stage 120 correspond to the LL-restricted region, so that suitable processing for the LL-restrictions is performed.

[1560] 3.9.17 Estimated Tact Time Balance Adjusting Process (In Units of Mountains).

[1561] The characteristics of this processing are as follows.

[1562] (i) When in the initial state, the estimated tact time for the front stage 110 is longer than that for the rear stage 120, component tapes are moved from the front stage 110 to the rear stage 120 in units of mountains to adjust the estimated tact time balance.

[1563] (ii) For a mountain present at the balance point, the estimated tact time balance is adjusted in units of component tapes. This is described in detail in the “Estimated Tact Time Balance Adjusting Process (In Units Of Component Tapes)” section later in this specification.

[1564] The specific processes used are as follows.

[1565] (1) Each mountain is provided with a flag. The initial state of each flag is set at “true”.

[1566] (2) When all of the flags of the mountains arranged in the front stage 110 are “false”, the following processing is performed.

[1567] (2.1) Advance to process (15).

[1568] This corresponds to the case where all of the mountains that were arranged in the front stage 110 have been moved to the rear stage 120. This case cannot occur in reality.

[1569] (3) The present arrangement of mountains in the front stage 0.110 and the rear stage 120 is stored.

[1570] (4) The following processing is performed to select the mountain M to be moved.

[1571] (4.1) The highest component group number, out of the component tapes forming the mountains arranged in the front stage 110, is found and set as PGMax.

[1572] (4.2) When the flags for all of the mountains formed from single cassettes or double cassettes including component tapes for the component group number PGMax are set as “false”, the following processing is formed.

[1573] (4.2.1) The processing for moving mountains from the front stage 110 to the rear stage 120 ends.

[1574] Since the mountains to be moved have already been moved, the processing for moving mountains from the front stage 110 to the rear stage 120 ends.

[1575] This does not depend on whether the tact time has been balanced.

[1576] (4.3) The following processing is performed when a mountain is formed of single cassettes including the component tape with the component number PGMax and a mountain is formed of double cassettes including the component tape with the component number PGMax are both present.

[1577] (4.3.1) The mountain is formed of single cassettes is set as mountain M.

[1578] (4.4) The following processing is performed when only one of a mountain is formed of single cassettes including the component tape with the component number PGMax and a mountain is formed of double cassettes including the component tape with the component number PGMax is present.

[1579] (4.4.1) The mountain is set as mountain M.

[1580] (5) The mountain M is taken from the mountains arranged in the front stage 110 and the remaining mountains are rearranged.

[1581] (6) The mountain M is added to the mountains arranged in the rear stage 120 and these mountains are rearranged.

[1582] (7) When the restrictions for the nozzles cannot be satisfied for the front stage 110 or rear stage 120, the following processing is performed.

[1583] (7.1) The arrangement of the mountains in the front stage 110 and the rear stage 120 is restored to the stored state.

[1584] (7.2) The flag of mountain M is set at “false”.

[1585] Hereafter mountain M is not treated as a mountain that can be moved.

[1586] (7.3) The processing advances to process (14).

[1587] (8) When a mountain cannot fit on the Z-axis in the front stage 110 or the rear stage 120, the following processing is performed.

[1588] (8.1) The arrangement of the mountains in the front stage 110 and the rear stage 120 is restored to the stored state.

[1589] (8.2) The processing advances to process (15).

[1590] Since the only mountain that can be moved is mountain M, the mountain M is divided in units of component tapes, and the resulting divisions are assigned to the front stage 110 and the rear stage 120 in an attempt to improve the tact time balance.

[1591] Mountain M is not necessarily positioned at the balance point, so that even if the tact time balance can be improved, there are cases when the tact times of the stages cannot be perfectly balanced.

[1592] (9) The estimated tact time for the front stage 110 is calculated.

[1593] (9.1) The estimated tact time is calculated for small components.

[1594] (9.2) The estimated tact time is calculated for general components.

[1595] (9.3) The estimated tact times of small components and general components are added to produce the estimated tact time of the front stage 110.

[1596] (10) The estimated tact time for the rear stage 120 is calculated.

[1597] (10.1) The estimated tact time is calculated for small components.

[1598] (10.2) The estimated tact time is calculated for general components.

[1599] (10.3) The estimated tact times of small components and general components are added to produce the estimated tact time of the rear stage 120.

[1600] (11) When the estimated tact time of the front stage 110 matches that of the rear stage 120, the following processing is performed.

[1601] (11.1) The processing advances to process (15).

[1602] The corresponds to when the balancing of the estimated tact time between the front stage 110 and the rear stage 120 has been completed.

[1603] (12) When the estimated tact time of the front stage 110 is shorter than that of the rear stage 120, the following processing is performed.

[1604] (12.1) The arrangement of the mountains in the front stage 110 and the rear stage 120 is restored to the stored state.

[1605] (12.2) The “Estimated Tact Time Balance Adjusting Process (In Units Of Component Tapes)” is performed for the mountain M.

[1606] For a mountain present at the balance point, the estimated tact time balance is adjusted in units of component tapes. This is described in detail in the “Estimated Tact Time Balance Adjusting Process (In Units Of Component Tapes) (A)” section later in this specification.

[1607] (12.3) The processing advances to process (15).

[1608] The mountain M is ends up situated at the point where the line is balanced.

[1609] The mountain M is restored to the state where it is arranged in the front stage 110.

[1610] Hereafter, the mountain M is divided in units of component tapes and the resulting divisions are assigned to the front stage 110 and the rear stage 120 in an attempt to improve the estimated tact time balance.

[1611] (13) When the estimated tact time of the front stage 110 is longer than the estimated tact time of the rear stage 120, the following processing is performed.

[1612] (13.1) The flag of mountain M is set at “false”.

[1613] Hereafter mountain M is treated as a mountain that has been moved.

[1614] (13.2) The processing advances to process (14).

[1615] Movement is once again performed in units of mountains.

[1616] (14) The processing returns to process (2).

[1617] (15) The “Estimated Tact Time Balance Adjusting Process (In Units Of Mountains)” ends. 3.9.18 Estimated Tact Time Balance Adjusting Process (In Units of Component Tapes)

[1618] The characteristics of this processing are as follows.

[1619] (i) When in the initial state, the estimated tact time for the front stage 110 is longer than that for the rear stage 120, component tapes are moved from the front stage 110 to the rear stage 120 in units of component tapes to adjust the estimated tact time balance.

[1620] (ii) Since the accuracy of the estimated tact time is not so high, the estimated tact time of the stages is not balanced in units of mounting points.

[1621] The specific processes used are as follows.

[1622] (1) Each component tape forming the mountain M is provided with a flag. The initial state of each flag is set at “true”.

[1623] (2) A list of component types is produced for the mountain M.

[1624] (3) When the flag for each component tape in the component list is set at “false”, the following processing is performed.

[1625] (3.1) The processing advances to process (13).

[1626] The “Estimated Tact Time Balance Adjusting Process (In Units Of Component Tapes)” ends.

[1627] (4) The present arrangement of mountains in the front stage 110 and the rear stage 120 is stored.

[1628] (5) Out of the component tapes that are in the component list and have a flag set at “true”, the component tape with the lowest number of components to be mounted is found and selected as the component tape K.

[1629] (6) Component tape K is assigned to the rear stage 120.

[1630] (7) Component tapes that are left in the component list, have a flag set at “true” and have not been assigned to either the front stage 110 or the rear stage 120 are assigned to the front stage 110.

[1631] As a result, a mountain that is not mountain M is assigned to the front stage 110 or the rear stage 120.

[1632] (8) The estimated tact time is calculated for the front stage 110.

[1633] (8.1) The estimated tact time is calculated for small components.

[1634] (8.2) The estimated tact time is calculated for general components.

[1635] (8.3) The estimated tact times of small components and general components are added to produce the estimated tact time of the front stage 110.

[1636] (9) The estimated tact time for the rear stage 120 is calculated.

[1637] (9.1) The estimated tact time is calculated for small components.

[1638] (9.2) The estimated tact time is calculated for general components.

[1639] (9.3) The estimated tact times of small components and general components are added to produce the estimated tact time of the rear stage 120.

[1640] (10) When the estimated tact time of the front stage 110 matches that of the rear stage 120, the following processing is performed.

[1641] (10.1) The processing advances to process (13).

[1642] The corresponds to when the balancing of the estimated tact time between the front stage 110 and the rear stage 120 has been completed.

[1643] (11) When the estimated tact time of the front stage 110 is shorter than that of the rear stage 120, the following processing is performed.

[1644] (11.1) The flag for the component tape K is set at “false”.

[1645] This shows that the component tape K has been moved.

[1646] (11.2) The processing advances to process (13).

[1647] By moving the component tape K from the front stage 110 to rear stage 120, the estimated tact time of the rear stage 120 is raised above the front stage 110. After adjusting the estimated tact time in units of component tapes, the estimated tact time balance adjustment process ends.

[1648] (12) When the estimated tact time of the front stage 110 is longer than the estimated tact time of the rear stage 120, the following processing is performed.

[1649] (12.1) The flag of the component tape K is set at “false”.

[1650] Hereafter component tape K is treated as a component tape that has been moved.

[1651] (12.2) The processing returns to process (3).

[1652] Movement is once again performed in units of component tapes.

[1653] (13) The “Estimated Tact Time Balance Adjusting Process (In Units Of Component Tapes)” ends.

[1654] 3.9.19 Processing Moving a Mountain from the Front Stage 110 to the Rear Stage 120

[1655] (1) Each mountain is provided with a flag. The initial state of each flag is set at “true”.

[1656] (2) When all of the flags of the mountains arranged in the front stage 110 are “false”, the following processing is performed.

[1657] (2.1) Advance to process (16).

[1658] This corresponds to the case where all of the mountains that were arranged in the front stage 110 have been moved to the rear stage 120. This case cannot occur in reality.

[1659] (3) The present arrangement of mountains in the front stage 110 and the rear stage 120 is stored.

[1660] (4) The following processing is performed to select the mountain M to be moved.

[1661] (4.1) The highest component group number, out of the component tapes forming the mountains arranged in the front stage 110, is found and set as PGMax.

[1662] (4.2) When the flags for all of the mountains formed from single cassettes or double cassettes including component tapes for the component group number PGMax are set as “false”, the following processing is formed.

[1663] (4.2.1) The processing for moving mountains from the front stage 110 to the rear stage 120 ends.

[1664] Since the mountains to be moved have already been moved, the processing for moving mountains from the front stage 110 to the rear stage 120 ends.

[1665] This does not depend on whether the tact time has been balanced.

[1666] (4.3) The following processing is performed when a mountain is formed of single cassettes including the component tape with the component number PGMax and a mountain is formed of double cassettes including the component tape with the component number PGMax are both present.

[1667] (4.3.1) The mountain is formed of single cassettes is set as mountain M.

[1668] (4.4) The following processing is performed when only one of a mountain is formed of single cassettes including the component tape with the component number PGMax and a mountain is formed of double cassettes including the component tape with the component number PGMax is present.

[1669] (4.4.1) The mountain is set as mountain M.

[1670] (5) The mountain M is taken from the mountains arranged in the front stage 110 and the remaining mountains are rearranged.

[1671] (6) The mountain M is added to the mountains arranged in the rear stage 120 and these mountains are rearranged.

[1672] (7) When the restrictions for the nozzles cannot be satisfied for the front stage 110 or rear stage 120, the following processing is performed.

[1673] (7.1) The arrangement of the mountains in the front stage 110 and the rear stage 120 is restored to the stored state.

[1674] (7.2) The flag of mountain M is set at “false”.

[1675] Hereafter mountain M is not treated as a mountain that can be moved.

[1676] (7.3) The processing advances to process (15).

[1677] (8) When a mountain cannot fit on the Z-axis in the front stage 110 or the rear stage 120, the following processing is performed.

[1678] (8.1) The arrangement of the mountains in the front stage 110 and the rear stage 120 is restored to the stored state.

[1679] (8.2) The processing advances to process (16).

[1680] Since the only mountain that can be moved is mountain M, the mountain M is divided in units of component tapes, and the resulting divisions are assigned to the front stage 110 and the rear stage 120 in an attempt to improve the tact time balance.

[1681] Mountain M is not necessarily positioned at the balance point, so that even if the tact time balance can be improved, there are cases when the tact times of the stages cannot be perfectly balanced.

[1682] (9) Tasks are generated for the front stage 110.

[1683] (9.1) Tasks are generated for small components.

[1684] (9.2) Tasks are generated for general components.

[1685] (10) Tasks are generated for the rear stage 120.

[1686] (10.1) Tasks are generated for small components.

[1687] (10.2) Tasks are generated for general components.

[1688] (11) The mounting time is calculated for the front stage 110 and for the rear stage 120.

[1689] In some cases, mountains are arranged in both the front stage 110 and the rear stage 120.

[1690] (12) When the mounting time of the front stage 110 matches that of the rear stage 120, the following processing is performed.

[1691] (12.1) The processing advances to process (16).

[1692] The corresponds to when the mounting times of the front stage 110 and the rear stage 120 are perfectly balanced.

[1693] (13) When the mounting time of the front stage 110 is shorter than that of the rear stage 120, the following processing is performed.

[1694] (13.1) The arrangement of the mountains in the front stage 110 and the rear stage 120 is restored to the stored state.

[1695] (13.2) The “Processing Moving A Component Tape From The Front Stage 110 To The Rear Stage 120” is performed for the mountain M.

[1696] (13.3) The processing advances to process (16).

[1697] The mountain M is ends up situated at the point where the line is balanced.

[1698] The mountain M is restored to the state where it is arranged in the front stage 110.

[1699] After this, the mountain M is divided in units of component tapes, and the resulting divisions are assigned to the front stage 110 and the rear stage 120 in an attempt to improve the tact time balance.

[1700] (14) When the mounting time of the front stage 110 is longer than that of the rear stage 120, the following processing is performed.

[1701] (14.1) The flag of mountain M is set at “false”.

[1702] (14.2) The processing advances to process (15).

[1703] There are cases where is necessary to move another mountain from the front stage 110 to the rear stage 120.

[1704] (15) The processing returns to process (2).

[1705] (16) The “Processing Moving A Mountain From The Front Stage 110 To The Rear Stage 120” ends. 3.9.20 Processing Moving a Component Tape from the Front Stage 110 to the Rear Stage 120

[1706] The characteristics of this processing are as follows.

[1707] (i) When in the initial state, the mounting time for the front stage 110 is longer than that for the rear stage 120, mounting points are moved from the front stage 110 to the rear stage 120 in units of component tapes to adjust the balance in the mounting times.

[1708] (ii) In some cases, many tapes are moved to the rear stage 120.

[1709] In some cases, component tapes are divided and are arranged in both the front stage 110 and the rear stage 120.

[1710] (iii) The resulting balance in mounting times is favorable.

[1711] The specific processes used are as follows.

[1712] (1) Each component tape forming the mountain M is provided with a flag. The initial state of each flag is set at “true”.

[1713] (2) A list of component types is produced for the mountain M.

[1714] (3) When the flag for each component tape in the component list is set at “false”, the following processing is performed.

[1715] (3.1) The processing advances to process (14).

[1716] The “Processing Moving A Component Tape From The Front Stage 110 To The Rear Stage 120” ends.

[1717] (4) The present arrangement of mountains in the front stage 110 and the rear stage 120 is stored.

[1718] (5) Out of the component tapes that are in the component list and have a flag set at “true”, the component tape with the lowest number of components to be mounted is found and selected as the component tape K.

[1719] (6) Component tape K is assigned to the rear stage 120.

[1720] (7) Component tapes that are left in the component list, have a flag set at “true” and have not been assigned to either the front stage 110 or the rear stage 120 are assigned to the front stage 110.

[1721] Mountains aside from mountain M are assigned to either the front stage 110 or the rear stage 120.

[1722] (8) Tasks are generated for the front stage 110.

[1723] (8.1) Tasks are generated for small components.

[1724] Component tapes are divided by performing the core crush processing.

[1725] (8.2) Tasks are generated for general components.

[1726] Component tapes are divided in accordance with user instructions.

[1727] (9) Tasks are generated for the rear stage 120.

[1728] (9.1) Tasks are generated for small components.

[1729] Component tapes are divided by performing the core crush process.

[1730] (9.2) Tasks are generated for general components.

[1731] Component tapes are divided in accordance with user instructions.

[1732] (10) The mounting time is calculated for the front stage 110 and for the rear stage 120.

[1733] (11) When the mounting time of the front stage 110 matches that of the rear stage 120, the following processing is performed.

[1734] (11.1) The processing advances to process (14).

[1735] This corresponds to when the mounting times of the front stage 110 and the rear stage 120 are perfectly balanced.

[1736] (12) When the mounting time of the front stage 110 is shorter than that of the rear stage 120, the following processing is performed.

[1737] (12.1) The flag of component tape K is set at “false”.

[1738] This indicates that the component tape K has been moved.

[1739] (12.2) The “Processing Moving Mounting Points From The Front Stage 110 To The Rear Stage 120” is performed for the component tape K.

[1740] When the component tape K is moved from the front stage 110 to the rear stage 120, the mounting time of the rear stage 120 becomes longer than that of the front stage 110, so that the component tape K is divided and the mounting points for the component tape K are assigned to the front stage 110 and the rear stage 120 to improve the balance in tact time between the stages.

[1741] (12.3) The processing advances to process (14).

[1742] (13) When the mounting time of the front stage 110 is longer than that of the rear stage 120, the following processing is performed.

[1743] (13.1) The flag of component tape K is set at “false”.

[1744] This indicates that the component tape K has been moved.

[1745] (13.2) The processing returns to process (3).

[1746] Mounting points are moved once again in units of component tapes.

[1747] (14) The “Processing Moving A Component Tape From The Front Stage 110 To The Rear Stage 120” ends.

[1748] 3.9.21 Processing Moving Mounting Points from the Front Stage 110 to the Rear Stage 120

[1749] The component tape K is divided in units of mounting points, and the resulting divisions are assigned to the front stage 110 and the rear stage 120.

[1750] (1) The mounting points are arranged in ascending order of their Y coordinates.

[1751] (1.1) Mounting points with the same Y coordinate are arranged in ascending order of their X coordinates.

[1752] The result is called the “mounting point list”.

[1753] When the component tape K is divided into two in units of mounting points and the resulting divisions have been assigned to the front stage 110 and the rear stage 120, there is the possibility of only one component tape K being assigned to the front stage 110 or the rear stage 120. In this case, it is probably better to assign a set of mounting points that are close to one another, which is why the mounting points are arranged in order of their coordinates.

[1754] If the greedy method is applied to the same component tapes in the front stage 110 and the rear stage 120, this kind of rearranging is unnecessary. However, if the greedy method is applied separately to the front stage 110 and the rear stage 120, such rearranging is effective.

[1755] (2) The variable n showing the number of mounting points assigned to the front stage 110 is set at 1.

[1756] (3) When n is larger than the number of mounting points for the component tape K, the following processing is performed.

[1757] (3.1) The processing advances to process (12).

[1758] As a result, the “Processing Moving Mounting Points From The Front Stage 110 To The Rear Stage 120” ends

[1759] (4) The first to nt mounting points in the mounting point list are assigned to the front stage 110.

[1760] (5) The (n+1th) to last mounting points in the mounting point list are assigned to the rear stage 120.

[1761] (6) Tasks are generated for the front stage 110.

[1762] (6.1) Tasks are generated for small components.

[1763] Component tapes are divided by performing the core crush process.

[1764] (6.2) Tasks are generated for general components.

[1765] Component tapes are divided in accordance with user instructions.

[1766] (7) Tasks are generated for the rear stage 120.

[1767] (7.1) Tasks are generated for small components.

[1768] Component tapes are divided by performing the core crush process.

[1769] (7.2) Tasks are generated for general components.

[1770] Component tapes are divided in accordance with user instructions.

[1771] (8) The mounting time is calculated for the front stage 110 and for the rear stage 120.

[1772] (9) When the mounting time of the front stage 110 matches that of the rear stage 120, the following processing is performed.

[1773] (9.1) The processing advances to process (12).

[1774] As a result, the “Processing Moving Mounting Points From The Front Stage 110 To The Rear Stage 120” ends.

[1775] This corresponds to when the mounting times of the front stage 110 and the rear stage 120 are perfectly balanced.

[1776] (10) When the mounting time of the front stage 110 is shorter than that of the rear stage 120, the following processing is performed.

[1777] (10.1) The processing advances to process (12).

[1778] As a result, the “Processing Moving Mounting Points From The Front Stage 110 To The Rear Stage 120” ends.

[1779] This corresponds to when the mounting times of the front stage 110 and the rear stage 120 are well balanced, though not exactly equal.

[1780] (11) When the mounting time of the front stage 110 is longer than that of the rear stage 120, the following processing is performed.

[1781] (11.1) The variable n is incremented by 1.

[1782] (11.2) The processing returns to process (3).

[1783] Mounting points are moved from the front stage 110 to the rear stage 120 once again.

[1784] (12) The “Processing Moving Mounting Points From The Front Stage 110 To The Rear Stage 120” ends.

[1785] 3.9.22 Swapping Performed When Adjusting the Tact Time Balance

[1786] The following describes the tact time balancing processing (swap processing) performed when there is no free space on the Z-axis into which component tapes can be moved. In this description, the processing is compared to the case when free space is available on the Z-axis.

[1787]
FIGS. 95A and 95B show examples of the mounting times for the front stage 110 and the rear stage 120 when space is available on the Z-axis, as well as the tact time balancing processing performed in this case. FIGS. 95C and 95D show examples of the mounting times for the front stage 110 and the rear stage 120 when no space is available on the Z-axis, as well as the tact time balancing processing (swapping) performed in this case.

[1788] As shown in FIGS. 95A and 95B, when free space is available on the Z-axis, the processes 3.9.19 to 3.9.21 described above are performed to move mounting points to eradicate the difference in mounting times between the stages. In the illustrated example, a number of components 545 with a total mounting time of 7.5 seconds are moved from the front stage 110 to the rear stage 120, thereby balancing the mounting times of the stages.

[1789] On the other hand, when, as shown in FIGS. 95C and 95D, there is no free space is available on the Z-axis, the component tape 547 that is assigned to the front stage 110 and has a large number of components to be mounted and the component tape 546 that is assigned to the rear stage 120 and has a small number of components to be mounted are swapped in units of component cassettes. As a result, the mounting time corresponding to the difference in the number of components to be mounted is moved from the front stage 110 to the rear stage 120, evening out the mounting times of the stages.

[1790] 3.9.23 Cut Down Procedure Performed for Double Cassettes

[1791] The following describes the cut down process performed for double cassettes.

[1792] (1) The component tapes that are held in double cassettes with a feed pitch of 2 mm are arranged to form a mountain on a virtual Z-axis (see FIG. 96). To do so, a component histogram 550 in which component tapes are arranged in descending order of the number of components to be mounted is divided at its midpoint (also referred to as the “folding point”) and is folded upon itself. The two overlapping halves are then combined with component tapes from the former and latter halves in alternating positions, resulting in the component histogram 551 (where pairs of component tapes have been produced by the folding).

[1793] (2) In the same way, component tapes that are held in double cassettes with a feed pitch of 4 mm are arranged to form a mountain on a virtual Z-axis (see FIG. 97). To do so, a component histogram 537 in which the component tapes are arranged in descending order of the number of components to be mounted is divided at its midpoint, folded upon itself, and the two overlapping halves are combined with component tapes from the former and latter halves in alternating positions, resulting in the component histogram 553 (where pairs of component tapes have been produced by the folding).

[1794] (3) The component histograms 551 and 553 for the component cassettes with the respective feed pitches of 2 mm and 4 mm are combined to produce a component histogram 554 (see FIG. 98). In other words, the double cassettes are arranged in descending order of the number of components to mounted for the tapes arranged in the odd-numbered Z positions, without breaking up the pairs of component tapes in each double cassette.

[1795] (4) The component histogram 554 is split into a component histogram 554a (see FIG. 99A) containing the odd-numbered Z positions and a component histogram 554b (see FIG. 99B) containing the even-numbered Z positions.

[1796] (5) The cut down process is performed for the component histograms 554a and 554b, starting from the component tapes with few components to be mounted, to produce pickup patterns in which 10 components are simultaneously picked up (see FIGS. 100A and 100B). As a result, the core parts 555a and 555b remain in the respective component histograms 554a and 554b.

[1797] (6) Supplementary patterns 556a and 556b are respectively produced for the odd-numbered core part 555a and the even-numbered core part 555b (see FIGS. 101A, 101B). In the illustrated example, there are 92 mounting points in the odd-numbered core part 555a and 12 mounting points in the even-numbered core part 555b, making a total of 104 mounting points. As a result, 10 tasks of 10 components are produced, leaving a single task of 4 components.

[1798] Since the highest number of components to be mounted for the component tapes in the even-numbered core part 555b is 3, three tasks for 10 components are produced on the even-numbered side, and the remaining tasks are produced on the odd-numbered side.

[1799] (7) The supplementary component tapes 557a and 557b for the odd-numbered and even-numbered sides are arranged in order (see FIGS. 102A and 102B). In these drawings, the supplementary component tapes are indicated using asterisks on the odd-numbered side and hash marks on the even-numbered side.

[1800] Note that as shown in FIGS. 102A and 102B, there are cases where the number of supplementary component tapes is not equal on the odd-numbered and even-numbered sides.

[1801] (8) The even-numbered supplementary component tapes 557b are placed over the odd-numbered supplementary component tapes 557a to produce a single group of supplementary component tapes 558 (see FIGS. 103A and 103B).

[1802] (9) Mounting points are assigned to the combined supplementary component tapes 558 (see FIGS. 104A and 104B).

[1803] At this point, the supplementary component tapes produced by combining the supplementary component tapes on the odd-numbered and even-numbered sides are formed of single component tapes. Therefore, when the combined component tapes are split into the tapes on the odd-numbered and even-numbered sides, the feed pitch is always the same for the resulting tapes, meaning that these tapes can be placed as pairs into double cassettes.

[1804] (10) The combined supplementary component tapes are divided into odd-numbered component tapes 558a and an even-numbered component tapes 558b (see FIG. 105A and FIG. 105B).

[1805] (11) The pickup patterns 559a and 559b are respectively produced for the odd-numbered and even-numbered component histograms (see FIGS. 106A and 106B).

[1806] As a result, when arranging pairs of component tapes into double cassettes, the restriction that only component tapes with the same feed pitch can be placed in the same double cassette is fulfilled and the lowest possible number of pickup patterns can be used (i.e., the frequency with which components can be picked up simultaneously is high).

[1807] 3.9.24 Nozzle Interchanging Algorithm

[1808] As shown in FIG. 11, only certain types of nozzles can be used to pick up certain types of components. As a result, when picking up components, the line gang pickup head 112 needs to be equipped in advance with the right nozzles for picking up components from the present component tapes. This is performed by interchanging the nozzles on the line gang pickup head 112 at the nozzle station 119.

[1809] During optimization, therefore, it is necessary to arrange the component tapes so as to minimize the frequency with which nozzles are interchanged. An algorithm (the “nozzle interchanging algorithm”) for doing this is described below.

[1810]
FIGS. 107A and 107B are used to explain the nozzle interchanging algorithm. FIG. 107A is a table showing the types of component to be mounted (the number of the nozzle that can be used) and the number of components to be mounted for each type. FIG. 107B is a component histogram showing the operation performed. In FIG. 107B, the numbers appended to the components in the component histogram are nozzle numbers, the arrows show how pickup patterns are produced by divided the components up, and the circled numbers show the pickup patterns. In this example, the tasks are produced using the cut down procedure. This is described in detail below.

[1811] (1) First, large components for which the generation of 10-component pickup patterns is not possible due to the “conditions for adjacent components” are excluded from the components being processed. Here, the “conditions for adjacent components” relate to the spatial clearance that needs to be maintained when the heads pick up, transport and mount components. This clearance is an amount of space that ensures that adjacent components do not come into contact during mounting.

[1812] (2) The mounting points are arranged in units of nozzles and in ascending order of the number of mounting points. In the illustrated example, the types of component to be mounted (the number of the nozzle that can be used) and the number of components to be mounted for each component type are shown in FIG. 107A, while the first five columns in FIG. 107B show the result of this ordering.

[1813] (3) A number of frames are produced in task units, based on the total number of components to be mounted. In the illustrated example, 67 components are to be mounted, so that 70 frames (equivalent to seven 10-component tasks) are produced.

[1814] (4) In order to produce tasks that use all ten nozzles, the mountain is cut down starting from the nozzle type with the most components to be mounted.

[1815] In more detail, the following rules are used.

[1816] The upper part of the mountain is divided in a suitable way for the production of 10-component tasks, starting with the component type with the most components to be mounted (in the illustrated example, component number 5). When doing so, it is necessary to respect similar restrictions to the restrictions on the maximum number of divisions for a component tape. These restrictions are based on the number of available nozzles, and ensure that the number of available nozzles is not exceeded during this dividing process.

[1817] (5) The resulting divisions are used to fill the frames. By doing so, the number of tasks kept to the lowest possible number of tasks.

[1818] (6) In the above procedure, optimization is performed with regard to the composition of the nozzles on the line gang pickup head 112, so that next it is necessary to review the arrangement of the nozzles and the order of the tasks, as well as the compositions to be used for large components.

[1819] In more detail, large components are handled by inserting them in between the task compositions described above.

[1820] (7) In the illustrated example, reconsidering the order of tasks results in only one interchanging of nozzles being required (between tasks (6) and

[1821] (7).

[1822] 3.10 Example Screen Displays

[1823] The following describes the user interface function of the optimization apparatus 300. This explanation focuses (1) on the example screen displays that the calculation control unit 301 displays, based on an optimization program stored in the optimization program storing unit 305, on the display unit 302 to allow the user to interact with the optimization apparatus 300 and (2) on the parameters obtained from the user via an input unit 303.

[1824] 3.10.1 Main Screen

[1825] As shown in FIG. 108, this screen is used by the optimization apparatus 300 to display information on the state of optimization and the type program. The following describes the various display items (shown in square brackets) and the meanings (the process performed by the optimization apparatus 300) of the items (shown with asterisks) that can be selected from the pop-up menus that are displayed when these display items are selected.

[1826] (1) Menu

[1827] [File]

[1828] *Open

[1829] The optimization apparatus 300 obtains a user selection of a type program (here, defined to mean the mounting point data 307a etc., to be optimized) or a library (the component library 307b, etc.) and loads the selected type program. The result of this loading operation (the type program name, the number of mounting points, the component types, the equipment information, optimization information) is displayed in the main window.

[1830] *Save

[1831] When the user presses “yes” in response to a confirm save operation, the optimization apparatus 300 saves the optimized type program by overwriting the existing type program.

[1832] *Save as

[1833] The optimization apparatus 300 displays the “save as” screen, and saves the optimized program using a file name inputted by the user.

[1834] *Close

[1835] The optimization apparatus 300 closes the type program that is currently selected.

[1836] *Quit

[1837] The optimization apparatus 300 terminates the application.

[1838] [Optimize]

[1839] *Optimize

[1840] The optimization apparatus 300 optimizes the loaded type program information, executes a simulation for the optimization result, and display the result in the main window. This enables the user to make settings for the various resources and optimization conditions before optimization is performed.

[1841] *Stop

[1842] The optimization apparatus 300 stops the optimization.

[1843] *Optimization Details

[1844] The optimization apparatus 300 displays the “optimization details” screen.

[1845] [Settings]

[1846] This menu allows the user to make settings for the optimization resources and the optimization conditions.

[1847] Resources

[1848] *Set Number of Cassettes

[1849] The optimization apparatus 300 displays the “Set No. Of Cassettes” screen. This enables the user to input the number of cassettes that can be used by the present equipment.

[1850] *Set Component Division Number

[1851] The optimization apparatus 300 displays the “Set Component Division Numbers” screen. This enables the user to indicate the number of divisions that can be made when rearranging components for simultaneous pickup.

[1852] *Set Number of Nozzles

[1853] The optimization apparatus 300 displays the “Set No. Of Nozzles” screen. This enables the user to indicate the number of nozzles that can be used by the present equipment.

[1854] *Select Nozzle Station

[1855] The optimization apparatus 300 displays the “Select Nozzle Station” screen. This enables the user to input the plate ID of the nozzle station that can be used by the present equipment.

[1856] Optimization Conditions

[1857] *Set Options

[1858] The optimization apparatus 300 displays the “Options” screen. This enables the user to set the options of the present equipment and the optimization conditions.

[1859] *Z-Axis Information

[1860] The optimization apparatus 300 displays the “Z-Axis Information” screen. This screen shows the characteristics of the components arranged on the Z-axis.

[1861] *Nozzle Station Information

[1862] The optimization apparatus 300 displays the “Nozzle Station Information” screen. This shows information on the nozzle station of the present equipment.

[1863] [Print]

[1864] The optimization apparatus 300 prints the optimization information, resource information, etc., using a printer with which it is equipped.

[1865] *Optimization Details

[1866] The optimization apparatus 300 prints the optimization details.

[1867] *Z-Axis Information

[1868] The optimization apparatus 300 prints the Z-axis information.

[1869] *Nozzle Station Information

[1870] The optimization apparatus 300 prints the nozzle station information.

[1871] *No. of Cassettes Information

[1872] The optimization apparatus 300 prints the number of cassettes information.

[1873] *Component Division Number Information

[1874] The optimization apparatus 300 prints the component division number information.

[1875] *Number of Nozzles Information

[1876] The optimization apparatus 300 prints the number of nozzles information.

[1877] *Nozzle Station Selection Information

[1878] The optimization apparatus 300 prints the nozzle station selection information.

[1879] [Help]

[1880] The optimization apparatus 300 manages the version information for the screens and help screens.

[1881] *Help

[1882] The optimization apparatus 300 launches the help function.

[1883] *Version Information

[1884] The optimization apparatus 300 displays the version information.

[1885] (2) Optimization Information

[1886] The optimization apparatus 300 displays information for before and after optimization for each stage (in the illustrated example, the “1st stage” and the “2nd stage”).

[1887] *Mounting Time (Seconds)

[1888] The optimization apparatus 300 displays the results of simulating the states before and after optimization.

[1889] *Optimization Rate %

[1890] The optimization apparatus 300 displays the mounting time of the states after optimization as a percentage of the mounting time of the states before optimization.

[1891] Equation used: (mounting time after optimization/mounting time before optimization)*100

[1892] *CPH (Points)

[1893] The optimization apparatus 300 displays the number of mounting points processed in one hour.

[1894] Equation used: (number of mounting points/mounting time)*3600(seconds)

[1895] *No. of Tasks

[1896] The optimization apparatus 300 displays the number of tasks.

[1897] (3) Equipment Information

[1898] The optimization apparatus 300 displays information on the equipment in each stage (in the illustrated example, the “1st stage” and the “2nd stage”).

[1899] *Head Type

[1900] The optimization apparatus 300 displays the head types of the front and rear stages (both line gang pickup heads with 10 heads).

[1901] *Camera

[1902] The optimization apparatus 300 displays camera information for the front and rear stages (a 2D sensor, a 2D+3D sensor, etc.).

[1903] *Tray

[1904] The optimization apparatus 300 displays tray information for the front and rear stages (showing manual trays, elevator trays, etc.).

[1905] *No. of Mounting Points

[1906] The optimization apparatus 300 displays the number of mounting points for the front and rear stages in the type program.

[1907] *No. of Component Types

[1908] The optimization apparatus 300 displays the number of component types for the front and rear stages in the type program.

[1909] (4) Type Program Information

[1910] The optimization apparatus 300 displays information on the type program that is currently selected.

[1911] *Type Program Name

[1912] The optimization apparatus 300 displays the name of the type program that is currently selected.

[1913] *No. of Mounting Points

[1914] The optimization apparatus 300 displays the number of mounting points in the type program.

[1915] *No. of Component Types

[1916] The optimization apparatus 300 displays the number of component types in the type program.

[1917] (5) Optimization Button

[1918] The optimization apparatus 300 optimizes the type program information that has been loaded, performs a simulation for the result of the optimization, and displays the result in the main screen. However, before performing optimization, the various resources and optimization conditions need to be set.

[1919] (6) Optimization Details Button

[1920] The optimization apparatus 300 displays the optimization details screen.

[1921] (7) Quit Button

[1922] The optimization apparatus 300 quits the application.

[1923] 3.10.2 Open Screen

[1924] As shown in FIG. 109, the optimization apparatus 300 uses this screen to allow the user to select a type program or various kinds of libraries and to have the optimization apparatus 300 open a type program.

[1925] (1) Type Program List

[1926] The optimization apparatus 300 displays a list of type programs (the filename, date created, date updated, and size of each type program is shown).

[1927] (2) Type Program Search

[1928] After the user has inputted a string corresponding to the name (minus the “P” at the start) of a type program and pressed the search button, the optimization apparatus 300 searches for a matching type program. It should be noted that the search attempts to match the inputted string against the first characters of the type program names, so that the user does not have to input the entire program name.

[1929] (3) Select Library

[1930] The optimization apparatus 300 displays the various libraries that have been registered.

[1931] *Component Library

[1932] The optimization apparatus 300 displays the names of the registered component libraries. Note that these names all start with the letter “L”. These libraries correspond to the component library 307b shown in FIG. 9.

[1933] *Supply Library

[1934] The optimization apparatus 300 displays the names of the registered supply libraries. Note that these names all start with the letter “Y”. These supply libraries are form part of the mounter information 307c shown in FIG. 9, and store information relating to the specifications of the part supplying units 115a and 115b, the component feeders, the tray supplying unit 117, and the trays.

[1935] *Mark Library

[1936] The optimization apparatus 300 displays the names of the registered mark libraries. Note that these names all start with the letter “B”. These mark libraries form part of the mounter information 307c shown in FIG. 9, and store information relating to the shapes of recognition marks that are printed on substrates for use when aligning the line gang pickup head 112 relative to the substrates, for example.

[1937] *Nozzle Library

[1938] The optimization apparatus 300 displays the names of the registered nozzle libraries. Note that these names all start with the letter “V”. These mark libraries form part of the mounter information 307c shown in FIG. 9, and store information relating to the shapes of the various nozzles, for example.

[1939] (4) Open Button

[1940] The optimization apparatus 300 opens the indicated type program using the selected libraries. It should be noted that when the user double clicks the type program list, the same processing is performed as when the open button is pressed.

[1941] (5) Cancel Button

[1942] The display returns to the main screen

[1943] 3.10.3 Optimization Details Screen

[1944] As shown in FIG. 110, the optimization apparatus 300 displays an optimization details for each stage (in the illustrated example, the “1st stage” and the “2nd stage”).

[1945] (1) Type Program Information

[1946] The optimization apparatus 300 displays information for the type program currently selected.

[1947] *Type Program Name

[1948] The optimization apparatus 300 displays the name of the type program that is currently selected.

[1949] *No. of Mounting Points

[1950] The optimization apparatus 300 displays the number of mounting points in the type program.

[1951] *No. of Component Types

[1952] The optimization apparatus 300 displays the number of component types in the type program.

[1953] (2) Optimization Information

[1954] The optimization apparatus 300 displays information for before and after optimization for each stage (in the illustrated example, the “1st stage” and the “2nd stage”).

[1955] *Mounting Time (Seconds)

[1956] The optimization apparatus 300 displays the results of simulating the states before and after optimization.

[1957] *Optimization Rate %

[1958] The optimization apparatus 300 displays the mounting time of the states after optimization as a percentage of the mounting time of the states before optimization.

[1959] Equation used: (mounting time after optimization/mounting time before optimization)*100

[1960] *CPH (Points)

[1961] The optimization apparatus 300 displays the number of mounting points processed in one hour.

[1962] Equation used: (number of mounting points/mounting time)*3600(seconds)

[1963] *No. of Tasks

[1964] The optimization apparatus 300 displays the number of tasks.

[1965] *No. of Nozzle Interchanges

[1966] The optimization apparatus 300 displays the number of nozzle interchanges performed.

[1967] *Nozzle Interchange Time

[1968] The optimization apparatus 300 displays the total time taken by nozzle interchanges.

[1969] *No. of Pickups

[1970] The optimization apparatus 300 displays the number of pickup operations performed.

[1971] *Pickup Time

[1972] The optimization apparatus 300 displays the total time taken by pickup operations.

[1973] *No. of Scans

[1974] The optimization apparatus 300 displays the number of scans.

[1975] *Scanning Time

[1976] The optimization apparatus 300 displays the total time taken by scans.

[1977] (3) Number of Pickups Information

[1978] The optimization apparatus 300 displays, for each stage (in the illustrated example, the “1st stage” and the “2nd stage”), the number of times 1 to 10 tasks are picked up before and after optimization.

[1979] (4) Equipment Information

[1980] The optimization apparatus 300 displays information on the equipment in each stage (in the illustrated example, the “1st stage” and the “2nd stage”).

[1981] *Head Type

[1982] The optimization apparatus 300 displays the head types of the front and rear stages (both line gang pickup heads with 10 heads).

[1983] *Camera

[1984] The optimization apparatus 300 displays camera information for the front and rear stages (a 2D sensor, a 2D+3D sensor, etc.).

[1985] *Tray

[1986] The optimization apparatus 300 displays tray information for the front and rear stages (showing manual trays, elevator trays, etc.).

[1987] *No. of Mounting Points

[1988] The optimization apparatus 300 displays the number of mounting points for the front and rear stages in the type program.

[1989] *No. of Component Types

[1990] The optimization apparatus 300 displays the number of component types for the front and rear stages in the type program.

[1991] (5) Print Button

[1992] The optimization apparatus 300 prints the optimization details.

[1993] (6) Cancel Button

[1994] The optimization apparatus 300 ends the display of the optimization details screen and returns to the main screen.

[1995] 3.10.4 Set No. of Cassettes Screen

[1996] As shown in FIG. 111, the optimization apparatus 300 displays number of cassettes information and sets the maximum number of cassettes in accordance with user instructions.

[1997] (1) No. of Cassettes Information

[1998] The optimization apparatus 300 displays the number of cassettes information. In order to confirm the adjacency conditions for cassettes, the user sets the supply code for a component library.

[1999] *Supply Code

[2000] The optimization apparatus 300 displays the supply codes for cassettes.

2Example Meaning of Codes:1st letterType (E = embossed P = Paper)2nd and 3rd lettersCassette width (08 = 8 mm)4th and 5 lettersFeed pitch (04 = 4 mm)6th letterDriving method (C = cylinder)7th letterCassette type (W = double cassette)

[2001] *Present Number

[2002] The optimization apparatus 300 displays the number of cassettes that are currently used.

[2003] *Maximum Number

[2004] The optimization apparatus 300 displays the maximum number of cassettes that can be used for the present equipment.

[2005] (2) Print Button

[2006] The optimization apparatus 300 prints the number of cassettes information.

[2007] (3) OK Button

[2008] The optimization apparatus 300 stores the maximum number of cassettes that is presently displayed, and ends the display of the number of cassettes setting screen.

[2009] (4) Cancel Button

[2010] The optimization apparatus 300 ends the display of the set no. of cassettes screen, and returns to the main screen. However, the maximum number of cassettes is not stored.

[2011] (5) Maximum Number Input Area

[2012] After double clicking the maximum number area, the user can input the maximum number of cassettes.

[2013] 3.10.5 Set Component Division Numbers Screen

[2014] As shown in FIG. 112, in this screen the optimization apparatus 300 displays the component division information and sets the maximum number of divisions in accordance with user instructions.

[2015] (1) Component Division Number Information

[2016] The optimization apparatus 300 displays the component division number information.

[2017] *Component Name

[2018] The optimization apparatus 300 displays the names of the components used in the type program. To perform the component division efficiently, the user is allowed to input the component names in the type program.

[2019] *No. of Mounting Points

[2020] The optimization apparatus 300 displays the number of mounting points for each component.

[2021] *Present No. of Divisions

[2022] The optimization apparatus 300 displays the number of divisions for each component.

[2023] *Maximum No. of Divisions

[2024] The optimization apparatus 300 displays the maximum number of divisions for each component. It should be noted that when the application is launched, the present number of divisions is displayed as the default value for maximum number

[2025] (2) Print Button

[2026] The optimization apparatus 300 prints the component division numbers information.

[2027] (3) OK Button

[2028] The optimization apparatus 300 stores the maximum numbers of divisions that are presently displayed, and ends the display of the component division numbers setting screen.

[2029] (4) Cancel Button

[2030] The optimization apparatus 300 ends the display of the set component division numbers screen, and returns to the main screen. However, the maximum numbers of divisions are not stored.

[2031] (5) Maximum Division Number Input Area

[2032] After double clicking the maximum division number area, the user can input a maximum division number Note that the maximum division numbers are only valid while the application is running. When the application is launched again, the present number of divisions is displayed as the default for the maximum number of divisions.

[2033] Sort Display

[2034] When the user double clicks on a component name or the number of mounting points, the component names or numbers of mounting points are sorted (their display orders are changed).

[2035] 3.10.6 Set No. of Nozzles Screen

[2036] As shown in FIG. 113, in this screen the optimization apparatus 300 displays the number of nozzles information and sets the maximum number of nozzles in accordance with user instructions.

[2037] (1) Number of Nozzles Information

[2038] The optimization apparatus 300 displays the number of nozzles information.

[2039] *Nozzle Shape Code

[2040] The optimization apparatus 300 displays all of the nozzle shape codes in the nozzle library.

[2041] *Nozzle Type

[2042] The optimization apparatus 300 displays the nozzle library numbers (1 to 99).

[2043] *Present No.

[2044] The optimization apparatus 300 displays the present number of nozzles used.

[2045] *Maximum No.

[2046] The optimization apparatus 300 displays the maximum number of nozzles that can be used.

[2047] (2) Print Button

[2048] The optimization apparatus 300 prints the number of nozzles information.

[2049] (3) OK Button

[2050] The optimization apparatus 300 stores the maximum numbers of nozzles that are currently displayed and ends the display of the number of nozzles setting screen.

[2051] (4) Cancel Button

[2052] The optimization apparatus 300 ends the display of the set no. of nozzles screen, and returns to the main screen. However the maximum numbers of nozzles are not stored.

[2053] (5) Maximum Number Input Area

[2054] After double clicking the maximum number input area, the user can input a maximum number of nozzles.

[2055] 3.10.7 Select Nozzle Station Screen

[2056] As shown in FIG. 114, in this screen the optimization apparatus 300 displays the nozzle station selection information and selects the nozzle station in accordance with user instructions.

[2057] (1) Nozzle Plate ID

[2058] The optimization apparatus 300 allows the user to set whether each nozzle plate ID is valid or invalid separately for each stage (in the illustrated example, the “1st stage” and the “2nd stage”). Any number of IDs that are not shown grayed out can be selected.

[2059] An image of a nozzle station is displayed for the nozzle station ID is currently indicated by the cursor. By moving the cursor, the user can have the display switch between images of different nozzle stations.

[2060] (2) Nozzle Station Image

[2061] The optimization apparatus 300 displays an image of a nozzle station whose ID is currently indicated by the cursor.

[2062] (3) Print Button

[2063] The optimization apparatus 300 prints the nozzle station selection information.

[2064] (4) OK Button

[2065] The optimization apparatus 300 stores the selected nozzle plate IDs and ends the display of the select nozzle station screen.

[2066] (5) Cancel Button

[2067] The optimization apparatus 300 ends the display of the select nozzle station screen and returns to the main screen. However, the nozzle plate IDs are not stored.

[2068] 3.10.8 Options Screen

[2069] As shown in FIG. 115, in this screen the optimization apparatus 300 displays the equipment options and selects optimization level in accordance with user instructions.

[2070] (1) Equipment Settings

[2071] The optimization apparatus 300 allows the user to set the equipment options.

[2072] XL Restrictions

[2073] The optimization apparatus 300 allows the user to set whether the XL restrictions are valid or invalid.

[2074] Z-Axis Speed TA

[2075] The optimization apparatus 300 allows the user to set the speed of the Z-axis TA (“normal” or “slow”).

[2076] Z-Axis Speed TB

[2077] The optimization apparatus 300 allows the user to set the speed of the Z-axis TB (“normal” or “slow”).

[2078] Rear Cassette Components 180° Rotation

[2079] The optimization apparatus 300 allows the user to set whether the rear cassette components are rotated by 180° (“valid” or “invalid”).

[2080] Rear Tray Components 180° Rotation

[2081] The optimization apparatus 300 allows the user to set whether the rear tray components are rotated by 180° (“valid” or “invalid”).

[2082] Rear Manual Tray 180° Rotation

[2083] The optimization apparatus 300 allows the user to set whether the latter manual trays are rotated by 180° (“valid” or “invalid”).

[2084] Prior Shuttle Control

[2085] The optimization apparatus 300 allows the user to set whether forward shuttle control is used (“valid” or “invalid”).

[2086] Prior Pickup Control

[2087] The optimization apparatus 300 allows the user to set whether forward pickup control is used (“valid” or “invalid”).

[2088] Substrate Stopper Position (Front)

[2089] The optimization apparatus 300 allows the user to set the substrate stopper position for the front stage 110 (“lower left” “upper left”, “lower right”, or “upper right”).

[2090] Substrate Stopper Position (Rear)

[2091] The optimization apparatus 300 allows the user to set the substrate stopper position for the rear stage 120 (“lower left”, “upper left”, “lower right” or “upper right”).

[2092] Manual Tray (Front)

[2093] The optimization apparatus 300 allows the user to set whether a manual tray is used for the front stage 110 (“valid” or “invalid”).

[2094] Manual Tray (Rear)

[2095] The optimization apparatus 300 allows the user to set whether a manual tray is used for the rear stage 120 (“valid” or “invalid”).

[2096] (2) Front/Rear Allocation Prohibited

[2097] By checking this item, the user can prohibit a front/rear allocation.

[2098] Front

[2099] The optimization apparatus 300 performs optimization for the front stage 110 only.

[2100] Rear The optimization apparatus 300 performs optimization for the rear stage 120 only.

[2101] Both

[2102] The optimization apparatus 300 performs optimization for the front stage 110 and the rear stage 120. When front/rear assigning is prohibited, the user can set of the F/R allocations using the Z-Axis Information screen.

[2103] (3) Optimization Level Setting

[2104] The optimization apparatus 300 allows the user to set the execution level for the optimization in a range of 1 to 5 (representing “simple” to “complex”). The default level is 4.

[2105] (4) Collection Conveyor Settings

[2106] The optimization apparatus 300 allows the user to make the collection conveyor settings for the first and second stages.

[2107] No setting: None

[2108] Collection conveyor (small): Small

[2109] Collection conveyor (large): Large

[2110] (5) OK Button

[2111] The optimization apparatus 300 stores the options (equipment options, optimization level, front/rear allocation prohibited, collection conveyor) that are presently set, and ends the display of the options screen.

[2112] (6) Cancel Button

[2113] The optimization apparatus 300 ends the display of the options screen and returns to the main screen. However, the equipment options, optimization level, front/rear assigning, and collection compare are not stored.

[2114] (7) Algorithm Setting

[2115] The optimization apparatus 300 allows the user to set the optimization algorithm (“1” or “2”).

[2116] Algorithm 1

[2117] Optimization is performed using an algorithm for small components.

[2118] Algorithm 2

[2119] Small components are optimized using an algorithm for general components.

[2120] (8) Equipment Information

[2121] The optimization apparatus 300 displays the equipment information

[2122] Equipment Orientation

[2123] The optimization apparatus 300 displays the equipment orientation (“normal flow” or “reverse flow”).

[2124] Transportation Standard

[2125] The optimization apparatus 300 displays the transportation standard (“nearside” or “deep”).

[2126] Transportation Speed

[2127] The optimization apparatus 300 displays the transportation speed.

[2128] 3.10.9 Z-Axis Information Screen

[2129] As shown in FIG. 116, in this screen the optimization apparatus 300 displays, in accordance with user instructions, information on components that are set on the Z-axis.

[2130] (1) Z-Axis Information

[2131] The optimization apparatus 300 displays the Z-axis information.

[2132] *Component Name

[2133] The optimization apparatus 300 displays the component names of the components that are set at different Z numbers.

[2134] *Number Of Components

[2135] The optimization apparatus 300 displays the number of components (mounting points) that are set at different Z numbers.

[2136] *Shape Code

[2137] The optimization apparatus 300 displays shape codes for the components that set at different Z numbers.

[2138] *Nozzle

[2139] The optimization apparatus 300 displays the used nozzle numbers (the same numbers as the nozzle types shown in the number of nozzles setting screen) for the components set at different Z numbers.

[2140] *Camera

[2141] The optimization apparatus 300 shows which component recognizing camera (2DS, 2DL, 3DS, 3DL) is used for the components set at different Z numbers.

[2142] *Speed

[2143] The optimization apparatus 300 displays the head speed XY (a value in the range 1 to 8) for the components set at different Z numbers.

[2144] *Supply Code

[2145] The optimization apparatus 300 displays the supply codes for the components set at different Z numbers.

[2146] *Double

[2147] The user needs to specify whether each component type is to placed into single (S) or double (W) cassettes.

[2148] *Shuttle Off

[2149] When shuttle supplying of tray components is not possible for a component set at a Z number, the user can set “not possible” (=not performed) for that component. It should be noted that a check box is not displayed for tray components for which shuttle supplying is not possible.

[2150] *F/R Fixing

[2151] The optimization apparatus 300 allows the user to set whether it is prohibited for the optimization to move components set at different Z numbers between the front and rear stage. It should be noted that that this setting can be made only when the assigning prohibited checkbox in the option setting screen is checked.

[2152] When no data displayed corresponding to a Z number, this indicates that no component has been set at that Z number.

[2153] (2) Switch Between Pre- and Post-Optimization States

[2154] The optimization apparatus 300 switches between the Z-axis information before optimization and the Z-axis information after optimization. However, when optimization has not be performed, Z-axis information after optimization cannot be displayed.

[2155] (3) Print Button

[2156] The optimization apparatus 300 prints the Z-axis information.

[2157] (4) OK Button

[2158] The optimization apparatus 300 stores the Z-axis information (Double indication, shuttle off), and ends the display of the Z-axis information screen. However, when the Z-axis information cannot be edited after optimization, the OK button is displayed grayed-out.

[2159] (5) Cancel Button

[2160] The optimization apparatus 300 ends the display of the Z-axis information screen and returns to the main screen. However, the Z-axis information is not stored.

[2161] 3.10.10 Nozzle Station Information Screen

[2162] As shown in FIG. 117, in this screen the optimization apparatus 300 displays, in accordance with user instructions, the nozzle station information for the present equipment.

[2163] (1) Nozzle Plate ID

[2164] The optimization apparatus 300 displays the nozzle plate ID for each stage (in the illustrated example, the “1st stage” and the “2nd stage”).

[2165] (2) Nozzle Station Information

[2166] The optimization apparatus 300 displays the nozzle station information.

[2167] *Number

[2168] The optimization apparatus 300 displays the station number.

[2169] *Nozzle Shape Code

[2170] The optimization apparatus 300 displays nozzle shape codes for the nozzles on the nozzle station.

[2171] (3) Switch Between Pre- and Post-Optimization States

[2172] The optimization apparatus 300 switches between the nozzle station information before optimization and the nozzle station information after optimization. However, when optimization has not be performed, Z-axis information after optimization cannot be displayed.

[2173] (4) Print Button

[2174] The optimization apparatus 300 prints the nozzle station information.

[2175] (5) Cancel Button

[2176] The optimization apparatus 300 ends the display of the nozzle station information screen and returns to the main screen.

[2177] 4 Operation of the Optimization Apparatus (Application)

[2178] The following describes the operation of the optimization apparatus 300 in applied use. In other words, the following describes the improvements made to the optimization algorithm described above, and an expansion of its functioning.

[2179] 4.1 Optimization of Small Components

[2180] 4.1.1 Optimization of the Z-Axis Arrangement Without Dividing Components

[2181] The pickup patterns 504 shown FIG. 42 are optimized pickup patterns that maximize productivity, though this depends on the condition that component tapes are divided and placed in several cassettes. As one example, 5 component tapes (the five columns of black squares in FIG. 42) have to be provided for component number 1. This increases the number of supplies that are used, and in some cases cannot be tolerated by users. When the user only wants to use one component tape for each type of component, the illustrated pickup patterns cannot be used.

[2182] Due to the above situation, an algorithm that determines pickup patterns when component division is not possible needs to be used. Such algorithm is described below.

[2183]
FIG. 118 is an flowchart showing the procedure used by an algorithm that determines efficient pickup patterns (a Z-axis arrangement) without dividing components.

[2184] First, all of the component tapes are arranged in descending order of the number of components to be mounted, and the numbers i (i=1 to N) are assigned starting with the component tapes with the highest number of components to be mounted (S600). After this, the component tapes are taken in this descending order and rearranged as described below (S601 to S607).

[2185] First, the component tape for component number 1 is taken and placed on the Z-axis (S601). Next, processing where the component tapes for component numbers 2 onwards (i=2 to N) are taken one after the other and placed on the Z-axis at either the right or left side of the component tape 1 is repeated (S602 to S607). In other words, the component tapes for the components 2 to 15 (S605:Yes) are arranged (S604 to S606) on the Z-axis in the order right side, left side, right side . . . Component tapes for components 16 onwards (S605:Yes) are arranged (S605:No) on the Z-axis on the right side of component tape 1.

[2186] This reordering produces the preferred arranged for the Z-axis, which is to say, pickup patterns with a low number of nozzle strokes.

[2187]
FIG. 119 show an arrangement of component tapes that is used to explain the processing performed by the flowchart shown in FIG. 18. In more detail, the upper diagram shows an arrangement 600 of component tapes after the component tapes have been arranged in descending order of the number of components to be mounted, and the lower diagram shows the arrangement 601 produced by taking the component tapes from the arrangement 600 in this descending order and rearranging them on the Z-axis. Component tapes for component numbers 2 to 15 are arranged in the order right side, left side, right side, left side . . . , and the component tapes for component numbers 16 onwards are arranged on the right side.

[2188] FIGS. 120 to 123 are used to explain the optimization level of this optimization algorithm. FIG. 120 is a component histogram 605 in which the component tapes have been arranged simply in descending order (from right to left) of the number of components to be mounted. FIG. 121, meanwhile, shows nozzle stroke number patterns 606 produced when the component histogram 605 is subjected to the cut down process. FIG. 122 shows a component histogram 607 produced by rearranging the component histogram 605 in accordance with the procedure shown in FIG. 118. Finally, FIG. 123 shows the nozzle stroke number patterns 608 produced when the component histogram 607 is subjected to the cut down process.

[2189] It should be noted that in FIGS. 121 and 123, the horizontal axis represents the arrangement of component tapes (on a virtual or real Z-axis), the vertical axis on the left side represents the number of nozzle strokes, and the vertical axis on the right side represents the number of tasks. In these drawings, each set of components shown in a rectangular frame represents a task (a set of components that are simultaneously picked up).

[2190] As can be understood by comparing the nozzle stroke number patterns shown in FIGS. 121 and 123, the reordering performed by the present optimization algorithm does not change the number of tasks (constant at 13), but the number of nozzle strokes is reduced from 31 to 25. This is due to the procedure shown in FIG. 118 rearranging the component tapes, resulting in components (the component tapes for component numbers 3, 6, 9, 12, and 15) of the component histogram 605 shown in FIG. 120 being moved to positions in the component histogram 607a shown in FIG. 122.

[2191] The component histogram 607 shown in FIG. 122 is in the form of a mountain where the gradient differs on the two sides (one side is steeper than the other). The form is close to the ideal form (as one example, the histogram produced when the component histogram 504 shown in FIG. 42 is rearranged by moving all of the mounting points downwards) left after optimization has been performed using the core crush processing. As a result, the arrangement of component tapes produced by the present optimization algorithm can be said to have a higher optimization level than the component histogram 605 shown in FIG. 120.

[2192] 4.1.2 Optimization Through Assigning to the Left And Right Blocks

[2193] In the initial assigning process, component tapes are first assigned to the front stage 110 and the rear stage 120. After this, for each of the stages, component tapes are assigned to the left block 115a or the right block 115b of the component supplying units, based on the component groups to which the component tapes belong.

[2194] At this point, the procedure described thusfar arranges component cassettes, for the component tapes assigned to the left block 115a or the right block 115b, in one of the blocks with no gaps. As a result, component tapes are not divided, even though there may be free space available in other blocks. In some cases, there is the undesirable result of no core crush processing being performed for the component histogram. This increases the number of nozzle strokes, and so increases the tact time.

[2195] Consider the following example. Component cassettes are arranged with no gaps in the right block 115b regardless of whether there is enough free space in the left block 115a, resulting in none of the component tapes in the right block 115b being divided. This is especially likely for the case where there is a component histogram that has many component tapes in both the left block 115a and the right block 115b.

[2196] In this situation, the optimization apparatus 300 searches for the mountain with the lowest priority out of the mountains that have been assigned to the block with no free space, and assigns the component cassettes in this mountain to the other block. This creates a new space in the original block, so that core crush process can now be performed for the mountains in this block.

[2197]
FIG. 124 is a flowchart that shows the procedure which assigns mountains to the left block 115a and the right block 115b. Here, it is assumed that in an original state, a block to which a certain mountain has been assigned does not have enough free cassettes, resulting in an inability to perform the core crush process. This situation is hereafter referred to as a “block overflow”.

[2198] Out of the mountains that have been assigned to the left block 115a and the right block 115b, the optimization apparatus 300 specifies, as a mountain with low priority, a mountain that has been divided and assigned to the left block 115a and the right block 115b (“spanning the left block 115a and the right block 115b”), or a mountain whose core part is the lowest (i.e., a mountain whose most numerous component tape has the lowest number of components to be mounted) (S620).

[2199] Out of the component tapes forming the mountain that is currently specified, the optimization apparatus 300 focuses on the component tapes that are placed in the block with the block overflow. The optimization apparatus 300 judges whether the core crush process becomes possible for the mountains assigned to this block when the component tapes in focus are moved one at a time to another block in ascending order of the number of components to be mounted (S621).

[2200] When the core crush processing is judged to have become possible, the optimization apparatus 300 moves the required number of component tapes (S622) and then performs the cut down process and the core crush process on the mountains for which the core crush process has become possible (S623).

[2201] Finally, for the mountain from which the component tapes have been moved, the optimization apparatus 300 judges whether there are any component tapes left to be moved and whether these component tapes can be moved to another block (S624). When such movement is possible, the optimization apparatus 300 moves the remaining component tapes to another block (S625).

[2202]
FIGS. 125A to 125D show the movement of mountains between blocks according to the processing in the flowchart shown in FIG. 124. In the illustrated example, mountains 620, 621, 622a, and 622b that are divided and assigned to the left block 115a and the right block 115b are moved.

[2203] In FIGS. 125A to 125D, the mountains 620, 621, 622a, and 622b are depicted using the appearances of their component histograms. The reason that the inner sides of the mountains 620, 621, 622a, and 622b are high is that the component recognizing camera 116 is located near the center of FIGS. 125A to 125D, with the line gang pickup head 112 that picks up the components having to pass in front of the component recognizing camera 116. To minimize the total distance moved by the line gang pickup head 112, component tapes are arranged so that tapes with the highest numbers of components to be mounted are near the center.

[2204]
FIG. 125A shows a state where three mountains 620, 621, 622a, and 622b that have been assigned to a stage have been initially distributed to the left block 115a and the right block 115b. The right block 115b suffers from a block overflow, with the mountain 620 and one part (622b) of the mountain 622 that is divided between the left block 115a and the right block 115b being assigned to the right block 115b. On the other hand, the left block 115a does not suffer from a block overflow and has the mountain 621 and the other part (622a) of the mountain 622 assigned to it.

[2205]
FIG. 125B shows how one part (622c) of the mountain 622b is moved from the right block 115b to the left block 115a in order to free enough space to perform the core crush process on the mountain 620.

[2206]
FIG. 125C shows the state after the cut down process and the core crush process have been executed on the mountains 620 and 621. The shapes of these mountains 620 and 621 are changed so that the mountains have one side with a steep gradient and one side with a gradual gradient.

[2207]
FIG. 125D shows the state after the remaining part 622d of the mountain that was divided has been moved from the right block 115b to the left block 115a.

[2208]
FIGS. 126A to 126D show another example of the processing performed by the flowchart in FIG. 124. In this case, the mountain with the lowest core part is moved. With the exception of the mountain subjected to movement, the processing is the same as that shown in FIGS. 125A to 125D. In more detail, one part (627a) of the mountain 627 with the lowest core part out of the three mountains 625, 626, and 627 in FIG. 126A is moved from the right block 115b to the left block 115a (see FIG. 126B). After this, the cut down process and the core crush process are performed on the mountains 625 and 626 (see FIG. 126C), and finally the remaining part 627b of the mountain 627 that was moved is moved from the right block 115b to the left block 115a and combined with the mountain 627a (see FIG. 126D).

[2209] As described above, moving component cassettes (component tapes) from a first block with no space on the Z-axis to another block with space available creates space in the first block that can be used to perform the core crush process. This makes it possible to perform component division that was hitherto impossible. In other words, by reviewing whether component tapes can be moved out of a block, core crush processing can be made possible, resulting the generation of ideal pickup patterns and the likelihood of a reduction in the number of nozzle strokes.

[2210] 4.1.3 Estimating the Number of Double-Cassette Feeders

[2211] When the core crush process has ended for one component group (a “mountain” of component tapes) to be mounted, the component tapes are arranged on the Z-axis (arranged into component feeders). This is also the case where two tapes are arranged in double-cassette feeders that are capable of holding two component tapes. However, when double-cassette feeders are used, it is not always possible to divide up all the component tapes into pairs that can be held in double-cassette feeders, and there are cases where some of the component tapes in the pairs are subject to a fixed arrangement. As a result, it is unclear how many double-cassette feeders are required when arranging the component tapes.

[2212] When arranging all of the component tapes forming a mountain onto the Z-axis for the case where double-cassette feeders are used, it is possible to conceive a method for calculating (estimating) the required number of double-cassette feeders beforehand, based on the number of sets of NC data.

[2213]
FIG. 127 is a flowchart showing the procedure used by the algorithm that estimates the number of double-cassette feeders used in the arrangement.

[2214] First, the optimization apparatus 300 specifies the total number N of component tapes to be arranged (S640).

[2215] Next, the optimization apparatus 300 sorts all of the component tapes to be arranged into the four groups A to D shown in FIG. 128 and specifies the numbers of component tapes Na, Nb, Nc, and Nd that belong to each group (S641 to S644). In more detail, the optimization apparatus 300 calculates the following.

[2216] (i) Number of Component Tapes Na in Group A

[2217] This is the number Na of component tapes that are paired with a component tape in the same component group. Na is always an even number

[2218] (ii) Number of Component Tapes Nb in Group B

[2219] This is the number Nb of component tapes that are (a) paired with a component tape in a different component group and (b) have a component group number that is lower than the component group number of the different component group. Note the component group numbers are consecutive numbers that are assigned to identify each component group.

[2220] (ii) Number of Component Tapes Nc in group C

[2221] This is the number Nc of component tapes that are (a) paired with a component tape in a different component group and (b) have a component group number that is higher than the component group number of the different component group.

[2222] (iv) Number of Component Tapes Nd in Group D

[2223] This is the number Nd of component tapes that have not been paired with another component tape.

[2224] Finally, the optimization apparatus 300 calculates the estimated number (Nw) of double-cassette feeders using the following equation.

Nw=Na/
2+Nb+Nd+ceil((N−Na−Nb−Nc−2Nd)/2)

[2225] where ceil (x) refers to the smallest integer that is no less than the actual value (x).

[2226] The rationale for this equation is as follows.

[2227] The right side of the above equation is the total of the number of double-cassette feeders required for holding component tapes subject to a fixed arrangement (items 1 to 3) and the number of double-cassette feeders required for holding component tapes not subject to a fixed arrangement (item 4).

[2228] The first item “Na/2” on the right side is the number of double-cassette feeders required to hold the component tapes in group A.

[2229] The second item “Nb” is the number of double-cassette feeders required to hold the component tapes in group B and the component tapes in other component groups (component groups with a higher component number) that are paired with component tapes in group B. When component tapes in different component groups are held in the same double-cassette feeder in this way, the number of double-cassette feeders required is calculated by double counting the component group with the lower group number, so that the number of double cassettes Nc required to hold the component tapes in group C is not added (i.e., is not present on the right side of the above equation).

[2230] The third item “Nd” is the number of double-cassette feeders required to hold the component tapes in group D (and the non-fixed component tapes paired with these component tapes).

[2231] The fourth item “(N−Na−Nb−Nc−2Nd)/2” is the number of double-cassette feeders required to hold the non-fixed component tapes for the case where some (a number Nd) of the non-fixed component tapes are paired with component tapes in group D and arranged in double-cassette feeders. Note that when these Nd non-fixed component tapes are not paired with the component tapes in group D, the fourth item on the right side becomes “(N−Na−Nb−Nc−Nd)/2”.

[2232] By calculating the above, the required number of double-cassette feeders is given as the total of the first to fourth items on the right side of the calculation.

[2233]
FIGS. 129A to D show one example of the calculation of the required number of double-cassette feeders. FIG. 129A shows the arrangement a to z of component tapes to be arranged. FIG. 129B shows the details for these component tapes. FIG. 129C shows these component tapes once they have been arranged in double-cassette feeders. FIG. 129D shows the calculation of the required number of double-cassette feeders.

[2234] As can be understood from FIG. 129, the present calculation can calculate the required number of double-cassette feeders for all kinds of arrangements of component tapes.

[2235] Note that the above equation can be rearranged and simplified as shown below.

\begin{matrix} Nw = Na / 2 + Nb + Nd + ceil ((N - Na - Nb - Nc - 2 Nd) / 2) \\ = ceil (Na / 2 + Nb + Nd + (N - Na - Nb - Nc - 2 Nd) / 2) \\ = ceil ((N + Nb - Nc) / 2) \end{matrix}

[2236] 4.1.4 Fixing the Pairs of Component Tapes for Double-Cassette Feeders

[2237] Double-cassette feeders are capable of holding two component tapes that are both 8 mm wide. However, both tapes are ejected with the same feed pitch (2 mm or 4 mm, for example), so that component tapes that have different feed pitches cannot be arranged in the same double-cassette feeder. As a result, when optimization is performed for small components that are to be arranged in double-cassette feeders, component histograms that are produced separately for different feed pitches are produced and then folded upon themselves at the halfway point of the number of component tapes to produce pairs of component tapes. The resulting pairs are then arranged into double-cassette feeders with the suitable feed pitch.

[2238] However, due to the actualities at a production facility, there are cases where component tapes cannot be freely paired off and arranged into double-cassette feeders, which is to say, the component tapes that are paired together are fixed. As a result, there is the problem of how to arrange the component tapes into double-cassette feeders when there are component tapes that form fixed pairs and component tapes that have different feed pitches.

[2239] As a result, an algorithm that can perform optimization (i.e., can determine a Z-axis arrangement of component tapes that is suited to the cut down process) while respecting the restrictions on the pairing of component tapes is required.

[2240]
FIG. 130 is a flowchart showing the procedure used by an optimization algorithm that optimizes the Z-axis arrangement while respecting the restrictions on the pairing of component tapes for double-cassette feeders. Here, it is assumed that the component tapes include component tapes that are used in double-cassette feeders with feed pitches of 2 mm and 4 mm.

[2241] First, the optimization apparatus 300 takes out the component tapes subject to a fixed pairing. In more detail, the optimization apparatus 300 sorts the component tapes of the same feed pitch into component tapes that are not subject to a fixed pairing and component tapes that are subject to a fixed pairing.

[2242] Next, the optimization apparatus 300 produces, from the component tapes that are used in double-cassette feeders with a feed pitch of 2 mm, a mountain of the component tapes on a virtual Z-axis (S661). In more detail, the optimization apparatus 300 forms pairs of the component tapes that are not subject to a fixing pairing using the algorithm (the method for folding a component histogram back on itself) that was described earlier, and leaves the pairs of the component tapes that are subject to fixing pairings as they are.

[2243] In the same way, the optimization apparatus 300 produces, from the component tapes that are used in double-cassette feeders with a feed pitch of 4 mm, a mountain of the component tapes on a virtual Z-axis (S662). In more detail, the optimization apparatus 300 forms pairs of the component tapes that are not subject to a fixing pairing using the algorithm that was described earlier, and leaves the pairs of the component tapes that are subject to fixing pairings as they are.

[2244] Finally, the optimization apparatus 300 combines the component histogram for the double-cassette feeders with a feed pitch of 2 mm with the component histogram for the double-cassette feeders with a feed pitch of 4 mm (S663). When doing so, the combined double-cassette feeders include double-cassette feeders that have fixed pairings of component tapes. In more detail, the optimization apparatus 300 treats the double-cassette feeders produced in steps S661 and S662 as a single group, and rearranges the double-cassette feeders in descending order of the number of components to be mounted for the cassettes in the odd-numbered sides of the double-cassette feeders.

[2245]
FIGS. 131A to 134 show a specific example of the processing performed in steps S660 to S663.

[2246]
FIGS. 131A and 131B shows the processing performed in step S660. In FIG. 131A, the component tapes with a feed pitch of 2 mm are divided into a component histogram 660 made up of component tapes that are not subject to a fixed pairing and component tapes 661a and 661b that are subject to a fixed pairing. In the same way, FIG. 131B, the component tapes with a feed pitch of 4 mm are divided into a component histogram 665 made up of component tapes that are not subject to a fixed pairing and component tapes 666a and 666b that are subject to a fixed pairing.

[2247]
FIGS. 132A and 142B show the processing in step S661 of FIG. 130. In FIG. 132A, the component histogram 660 is shown with its folding position (the dotted line) 661c. FIG. 132B show a component histogram 662 produced by folding the component histogram 660 back on itself at this folding position. Note that “folding” here refers to a process where a former half and latter half that are separated by the folding position are combined with no change in the order of their constituent components but with tapes from both halves in alternating positions.

[2248]
FIGS. 133A and 133B show the processing showing in step S662. In FIG. 133B, the component histogram 665 is shown with its folding position (the dotted line) 665c. FIG. 133B show a component histogram 667 produced by folding the component histogram 665 back on itself at this folding position.

[2249]
FIGS. 134A and 134B show the processing in step S663 of FIG. 130. FIG. 134A shows how the component tapes are arranged on a virtual Z-axis by step S662 and S663 in FIG. 130. This drawing shows the following arranged on a virtual Z-axis: the component histogram 662 of components that have a feed pitch of 2 mm and are not subject to a fixed pairing; the component histograms 661a and 661b of components that have a feed pitch of 2 mm and are subject to a fixed pairing; the component histogram 667 of components that have a feed pitch of 4 mm and are not subject to a fixed pairing; and the component histograms 666a and 666b of components that have a feed pitch of 4 mm and are subject to a fixed pairing. FIG. 134B shows the double-cassette feeders after they have been rearranged in descending order of the number of components to be mounted for the cassettes in the odd-numbered sides of the double-cassette feeders, with the pairs of component tapes in the double-cassette feeders shown in FIG. 134A being maintained.

[2250] As can be seen from the arrangement on the Z-axis in FIG. 134B, the order of the component tapes has the fixed pairings maintained within double-cassette feeders and has the component tapes in an arrangement that is suited to the cut down process. When focusing on only the odd-numbered Z positions (or alternatively only on the even-numbered Z positions) from which the line gang pickup head 112 picks up components in one nozzle stroke, the component tapes are arranged in descending order of the number of components to be mounted.

[2251] 4.1.5 Optimization Algorithm for the Case Where There is a Defective Head

[2252] During the operation of the mounter 100, there are cases where heads become defective. It is necessary to minimize the effect of such defective heads, while continuing to mount components on substrates. Here, the expression “defective head” refers to a mounting head that can no longer pick up a component.

[2253] The mounter 100 operates under the following premises.

[2254] (i) During operation, even if a head becomes defective, the arrangement of the component cassettes (the component tapes) on the Z-axis is not changed.

[2255] (ii) Pickup operations are performed without using the defective head, so that the pickup patterns are changed.

[2256] (iii) Mounting is performed for all mounting points except for mounting points where components can only be mounted by the mounting head with the head number of the head that has become defective.

[2257] As a result, a method that generates pickup patterns that exclude the defective head and only use the normal heads has been conceived. Note the “head numbers” are numbers (1 to 10 starting from the left) that are used to identify the separate mounting heads that compose the line gang pickup head 112.

[2258] In more detail, the following procedure is used to deal with the defective head. An arrangement (mountain) of component tapes is produced on the assumption that none of the heads is defective, and the mountain is subjected to the cut down process without picking up components from the component tape corresponding to the position of the defective head to produce pickup patterns.

[2259] At this point, even if the number of nozzle strokes per task is two or more, priority is given to maximizing the number of components per task. This means that the line gang pickup head 112 makes as many nozzle strokes as are necessary until the line gang pickup head 112 is full (a state in which every normal head is holding a component), before mounting the picked-up components on a substrate.

[2260]
FIG. 135 is a flowchart showing the procedure used by the optimization algorithm that considers the presence of defective heads.

[2261] First, by making a single nozzle stroke, the highest possible number of components are picked up from the given component histogram using all of the normal mounting heads but not the defective head (S680). When, as a result, the line gang pickup head 112 does not become full and there are still components to be picked up (S68:No), the line gang pickup head 112 is moved so as to perform more nozzle strokes (S680) to pick up components using the mounting heads that are yet to be used (S680, S681) until the line gang pickup head 112 becomes full or there are no more components to be picked up.

[2262] When the line gang pickup head 112 has become full, or all of the components have been picked up (S681:Yes), the pickup operation for one task ends, and the line gang pickup head 112 moves towards the circuit board 20 to mount the components (S682).

[2263] The above processing (S680 to S682) is repeated until there are no more components to be mounted (S683). As a result, pickup patterns can be produced giving priority making full use of the line gang pickup head 112 even when there is a defective head on the line gang pickup head 112. Consequently, the mounting of components can be performed with a low number of tasks.

[2264] FIGS. 136 to 138 are used to compare the pickup patterns for the case where there are no defective heads and the case where there is a defective head. FIG. 136 shows a component histogram 680 for the components to be picked up in this example.

[2265]
FIG. 137 shows the pickup patterns 681 produced (by the cut down process and core crush process) from the component histogram 680 shown in FIG. 136 when there are no defective heads. On the other hand, FIG. 137 shows the pickup patterns 685 produced from the component histogram 680 shown in FIG. 136 when the mounting head H2 with the head number 2 is defective.

[2266] It should be noted that the pickup patterns 681 and 685 shown in FIGS. 137 and 138 are produced when the component tapes A, B, and C are divided during the core crush process performed on the component histogram 680 shown in FIG. 136. In these drawings, the left vertical axis shows the number of nozzle strokes (accumulatively), and the right vertical axis shows the number of tasks. However, in FIG. 138, the second and ninth tasks are divided into the two rectangular frames 687a and 687b, and 688a and 688b, respectively.

[2267] In FIG. 138, the second task, for example, includes a first nozzle stroke 687a where the mounting heads H1 and H10 pick up a total of two components and a second nozzle stroke 687b where the mounting heads H3 to H9 pick up a total of seven components. As a result, the line gang pickup head 112 becomes full with all nine normal heads holding a component, making a total of nine components with the defective head H2 not being used.

[2268] By comparing FIGS. 137 and 138, it can be seen that when the defective head is considered, there is a large increase in the number of nozzle strokes over the case where no defective heads are present. However, there is only the merest increase in the number of tasks from 13 to 14. This means that the pickup patterns have been successfully optimized for the case where a defective head is present.

[2269] It should be noted that when the substrate is LL sized or larger, there is a region where components can only be mounted by heads 7 to 10, making the optimization for the case where there is a defective head problematic. The optimization algorithm described earlier divides the heads 1 to 10 into two groups respectively composed of heads 1 to 6 and heads 7 to 10 and generates separate pickup patterns for these two groups of heads. In this case, when picking up components without using a defective head in either group, the method described in this section may be used. However, when there are Z numbers at which only a particular mounting head can perform mounting, the component cassettes have to be rearranged.

[2270] 4.2 Simultaneous Optimization of Several Sets of NC Data

[2271] In some cases, the user of the mounter 100 wants to produce a plurality of substrates in a short time without changing the positions or order of the component cassettes that have been set in the mounter 100. In such cases, it is necessary to determine an optimal order of component cassettes etc., that can be used when mounting components on each of the substrates and can reduce the total time required to completed the mounting for all of the substrates. In other words, an optimization algorithm for the order of component mounting of a plurality of sets of NC data is required. One such algorithm is described below.

[2272] The fundamental principle behind this optimization algorithm is as follows. In order for the cut down process to operate as expected, the component cassettes need to be arranged in order of the number of components to be mounted. Consequently, the coefficient of correlation between the order of the number of components to be mounted and different arrangements of the component cassettes are calculated for each substrate, and the arrangement of component cassettes that maximizes the correlation is found. Other than this, optimization is performed in accordance with the methods described earlier.

[2273]
FIG. 139 is a flowchart showing the entire procedure used to optimize a number of simultaneous sets of NC data. First, for the provided plurality of sets of NC data (S700), the optimization apparatus 300 judges whether there are any sets of NC data that have a predetermined resemblance (S701). When there is resemblance, the optimization apparatus 300 combines the mounting points of the sets of NC data to produce new NC data (S702). This processing is repeated for all sets of NC data (S700 to S703).

[2274] The judgement of whether there is resemblance is performed by expressing each set of NC data using vectors that have the number of components to be mounted for each component type as its elements. These vectors have the component types as the base elements and the number of components to be mounted for each as the magnitude of the base elements. The optimization apparatus 300 judges that there is resemblance when the cosine (cos θ) of the angle between two vectors is larger than a predetermined threshold.

[2275] In other words, when cos θ>threshold value, it is assumed that there is a resemblance between two sets of NC data.

[2276] It should be noted that this cosine is thought to represent an index showing the degree to which two sets of NC data include the same component types.

[2277] For the one or more sets of NC data left after the combining described above, the optimization apparatus 300 optimizes the Z-axis arrangement for one set of NC data at a time in descending order of the number of substrates to be produced for each set of NC data (S704). At this point, when the NC data being optimized includes component tapes whose Z-axis arrangement has already been decided, the optimization apparatus 300 leaves out these component tapes and determines the Z-axis arrangement using the cut down process and other processes as normal.

[2278] In this way, when sets of NC data include many common component types, optimization can be performed by treating the sets of NC data as a single set of NC data. When there are not many common component types, optimization is performed separately for different sets of NC data.

[2279] The following describes a specific algorithm that can optimize a plurality of sets of NC data as a single set of NC data, which is to say, an algorithm that can simultaneously optimize a plurality of sets of NC data.

[2280] This optimization aims to optimize the Z-axis arrangement. In this specification, the following are the three main items subjected to optimization: (i) the Z-axis arrangement; (ii) the mounting paths within tasks; and (iii) the order of tasks. When simultaneously optimizing a plurality of sets of NC data, however, a common Z-axis arrangement is required, so that the optimization of the Z-axis arrangement is the most important of the three. The remaining two items can be optimized for the tasks produced by performing the cut down process on the optimized Z-axis arrangement.

[2281] A common Z-axis arrangement that enables the cut down process to be successfully performed for the separate sets of NC data needs to have the component tapes arranged on the Z-axis in descending order of the number of components to be mounted. As a result, the optimization algorithm used here determines a Z-axis arrangement that is as close as possible to this ideal kind of arrangement for the separate sets of NC data.

[2282]
FIG. 140 is a flowchart showing the procedure used when optimizing a Z-axis arrangement that is used for several sets of NC data. First, an initial Z-axis arrangement is determined by arranging component tapes in accordance with one of the “ranking”, a “total number of components”, and “number of substrates” (S740).

[2283] When component tapes are arranged according to “ranking”, component tapes are arranged in descending order of the average ranking of each component tape within each set of NC data, the component tapes having been arranged in descending order of the number of components to be mounted within each set of NC data.

[2284] When component tapes are arranged according to “total number of components”, component tapes are arranged in descending order of the total number of components to be mounted in all sets of NC data.

[2285] When component tapes are arranged according to “number of substrates”, component tapes are arranged giving priority to the set of NC data with the highest number of substrates to be produced, with the component tapes for other sets of NC data being arranged according to the “total number of components”.

[2286] Note that the decision as to which of the above three methods should be used is taken based on standards that are established in advance from the results of simulation. As one example of such a standard, when there are less than five sets of NC data, the “number of substrates” method is used.

[2287] After determining the initial Z-axis arrangement, the optimization apparatus 300 performs optimization using a probability-based search (S711). In other words, the optimization apparatus 300 randomly changes the Z-axis arrangement, and accepts the new Z-axis arrangement if there is an increase in the average number of components picked up simultaneously. If not, the optimization apparatus 300 rejects the new Z-axis arrangement and returns to the previous Z-axis arrangement. This process is then repeated. As one example, the optimization apparatus 300 may (i) remove one component tape from the Z-axis arrangement, (ii) move up the component tapes on the right to fill the resulting gap, and (iii) insert the removed component tape at a different position. When this operation results in an increase in the optimization level, the new arrangement is accepted. By repeating this process where slight changes are made and the result is evaluated, gradual improvements can be made to the optimization level.

[2288]
FIGS. 141A and 141B show a specific example that is used to describe the three methods of determining the initial Z-axis arrangement. For ease of explanation, this example is for the case where an initial Z-axis arrangement is determined for three sets of NC data that include all or some of the five component tapes A to E.

[2289]
FIG. 141A is a table that shows, for each of the sets of NC data 1 to 3, the numbers of components to be mounted for each component tape used in the NC data, a ranking of each component tape in descending order of this number of components (the numbers shown in parenthesis), and the number produced of each substrate corresponding to each set of NC data. The table also shows the average ranking of each component tape and the total number of components to be mounted for each component tape.

[2290]
FIG. 141B shows the initial Z-axis arrangements that are produced for the three sets of NC data 1 to 3 shown in FIG. 141A based on “ranking”, “total number of components”, and “number of substrates”, respectively.

[2291] When the initial Z-axis is produced based on “ranking”, the optimization apparatus 300 (i) determines the ranking of each component tape in each set of NC data, (ii) finds the average ranking of each component tape, and (iii) arranges the component tapes in descending order of average ranking to produce the initial Z-axis arrangement. As a result, when the component tapes are arranged using the average rankings shown in FIG. 141A, the initial arrangement becomes “CABED”, as shown in FIG. 141B.

[2292] When the initial Z-axis is produced based on “total number of components”, the optimization apparatus 300 (i) finds the total number of components for each component tape, and (ii) arranges the component tapes in descending order of the total numbers of components to produce the initial Z-axis arrangement. As a result, when the component tapes are arranged using the numbers of components shown in FIG. 141A, the initial arrangement becomes “ACBDE”, as shown in FIG. 141B.

[2293] When the initial Z-axis is produced based on “number of substrates”, the optimization apparatus 300 (i) specifies the NC data with the highest number of manufactured substrates (ii) fixes the arrangement of component tapes on the Z-axis as the arrangement that is optimal for the component tapes used in the specified NC data, and (iii) arranges the other component tapes in the remaining space on the Z-axis based on the total number of components mounted for each component tape in the other sets of NC data to produce the initial Z-axis arrangement. As a result, when the component tapes are arranged using the numbers of substrate shown in FIG. 141A, the arrangement “CAB” is determined for the specified NC data (NC data 2) and the arrangement for the other component tapes is determined as “DE” based on the total numbers of components, resulting in the initial arrangement “CABDE”, as shown in FIG. 141B.

[2294] The following describes the result of the evaluation based on simulation by the optimization algorithm that simultaneously optimizes a plurality of sets of NC data.

[2295] It should be noted that in this simulation, the distribution in the numbers of components is such that many small components are mounted and there is a gradual decrease in the number of components mounted as components size increases. The following distribution was used in view of the normal properties of NC data.

[2296] The average number of components mounted for the component type “part” is set as

n
(part)=C/part

[2297] where “part” is a component tape number and C is a constant. Note that component tape numbers are assigned consecutively to component tapes.

[2298] In each set of NC data A, a degree of noise is added to the above equation so that

n
(part,A)=(C/random number for the width of “part”)±((C/3)/random number for the width of “part”)

[2299] The number of sets of NC data was set as a random number between 1 and 20.

[2300] The simulation is performed as follows.

[2301] (i) The number of sets of NC data to be optimized is set using a random number.

[2302] (ii) The number of components to be mounted in each set of NC data is determined.

[2303] (iii) The initial Z-axis arrangements are found using the three methods described above.

[2304] (iv) A probability-based search is performed for an optimal Z-axis arrangement that minimizes the pickup operations is found using the trial-and-error method described above.

[2305] When simulation was performed using the above method, the following results were apparent.

[2306] (i) For each of the three methods for determining the initial Z-axis arrangement, it was found that as the number of sets of NC data increases, the number of components that can be simultaneously picked up gradually decreases.

[2307] (ii) When there are few sets of NC data, the number of components that can be simultaneously picked up is high for an initial Z-axis arrangement based on the “number of substrates” method, but as the number of sets of NC data increases, more components can be simultaneously picked up when the “total number of components” method is used.

[2308] (iii) When optimization is performed by making one thousand “trial-and-error” rearrangements, an improvement of over 10% was observed in the number of nozzle strokes (i.e., the number of nozzle strokes decreased by 10%).

[2309] From the results of the above simulation, it is believed that the “number of substrates” method is best for cases where there are less than five sets of NC data and the “total number of components” method is best for cases where there are five or more sets of NC data.

[2310] 4.3 Optimization for General Components (Introduction of the Rule Base)

[2311] As described in the “2.9 Optimization For General Components” section earlier in this specification, the optimization algorithm for general components that is described earlier is based on a probability-based search. In other words, since general components are subject to restrictions as to which nozzles can pick up which components, “states” in which the arrangement of component tapes on the Z-axis and the composition of tasks are used as parameters are evaluated based on mounting time. A search for states with shorter mounting times is performed by varying the states based on probability.

[2312] However, when optimization is performed using this kind of probability-based search, there is a tendency for the optimization process to take an extremely long time when the initial state before optimization is poor. In fact, with the algorithms described above, it cannot be said that the tasks generated as the initial state produce an initial state that is favorable for the pickup operation. As one example, even though 10 components can be picked up at once by arranging component tapes one after the other along the Z-axis, there are cases where in the initial state is based on a mounting order where 10 nozzle strokes are performed to pick up ten components from the same component tape (i.e., a component tape located at one Z position).

[2313] In order to speed up the optimization performed for general components, it is better to use an algorithm which considers the nozzle restrictions and is based on predetermined rules. This algorithm generates an optimal initial state and optimizes the nozzle exchange operations. This optimization algorithm is described below in terms of the four methods it uses. These methods are “appropriation”. “task division”, “task combining”, and “task interchanging”.

[2314] 4.3.1 Appropriation

[2315] “Appropriation” refers to an algorithm that generates initial tasks (a sets of tasks corresponding to an initial state) that are to be optimized by the optimization algorithm that uses a probability-based search. As its name suggests, this method searches the Z-axis for components that can be picked up and resembles the cut down process developed as the optimization algorithm for small components.

[2316]
FIG. 142 is a flowchart showing the procedure used by the algorithm that creates initial tasks by appropriation. This procedure can be roughly divided into a former half that arranges component tapes on the Z-axis (S720 to S722) and a latter half that repeatedly generates tasks (S723 to S726).

[2317] In more detail, in the former half, the optimization apparatus 300 generates a component histogram for general components in which the component tapes in each component group are arranged in descending order of the number of components to be mounted (S720).

[2318] Next, the optimization apparatus 300 divides the component histogram produced in S720 into separate component histograms for each nozzle type (S721). In more detail, the optimization apparatus 300 takes all of the component tapes from which components can be picked up by the same nozzle type out of the component histogram it has generated for each component group and arranges the component tapes it has taken in descending order of the number of components to be mounted. This is repeated for every nozzle type with a component included in the component histogram.

[2319] After this, the component histograms that have been produced for each nozzle type are arranged one at a time onto the Z-axis, starting from the inner sides of the left block 115a and the right block 115b (S722).

[2320] In the latter half of the procedure, the optimization apparatus 300 performs the following processing on the component histograms produced in the former half of the procedure. First, for each component group (S723 to S726), the optimization apparatus 300 scans the Z-axis and removes (“appropriates”) components to produce tasks (S724). This process is performed starting from the lower edge of each component histogram moving towards the upper part, and is repeated until no more components are left (S725). The resulting tasks are the initial tasks for the optimization process.

[2321] It should be noted that in the order for scanning the component histograms, priority is given to nozzles where the nozzle resources are scarce. Even when there are different types of nozzles, priority is given to producing tasks with the highest possible number of components. As one example, when the line gang pickup head 112 is fitted with two type M nozzles and eight type S nozzles, two components are removed from the component histogram for components requiring nozzle type M before eight components are removed from the component histogram for components requiring nozzle type S to complete the task.

[2322]
FIGS. 143A to 143C show a specific example of the former half (S720 to S722) of the processing in the flowchart shown in FIG. 142.

[2323]
FIG. 143A shows the component histograms that are generated in units of component group in step S720 of FIG. 142. In the present example, two component histograms 720 and 721 are shown.

[2324]
FIG. 143B shows the component histograms that are generated in units of nozzle types in step S721 of FIG. 142. In the present example, component histogram 720 is divided into component histograms 720a and 720b, and component histograms 721 is divided into component histograms 721a and 721b.

[2325]
FIG. 143C shows the component histograms arranged on the Z-axis in step S722 of FIG. 142. In the present example, the component histograms 720a and 721a are arranged in the right block 115b and the component histograms 720b and 721b are arranged in the left block 115a.

[2326]
FIGS. 144A to 144E show specific examples of the latter half (S723 to S726) of the processing in the flowchart shown in FIG. 142.

[2327]
FIG. 144A shows the scanning direction and the order (numbers 1 to 13) of the scans in step S724 of FIG. 142. In the present example, two component histograms, i.e., the component histogram 725 for nozzle type S and the component histogram 726 for nozzle type M are shown. Note that it is assumed that neither type of nozzle is subject to restrictions on the availability of nozzle resources.

[2328]
FIG. 144B shows the generation of tasks in step S724 of FIG. 142. In the present example, a task is generated by removing 8 components that are positioned at the base of the component histogram 725 and 2 components that are positioned on the second bottom row of the component histogram 725.

[2329]
FIG. 144C shows the tasks (pickup patterns 1 to 5) that are generated one after the other by the repeated processing in the latter half (S723 to S726) of FIG. 142. The numbers written inside the components (illustrated using squares) composing the component histograms 725 and 726 in FIG. 144C are the tasks numbers that are assigned to the tasks in order. In the present example, task 3 with the task number 3 includes both components belonging the component histogram 725 and components belonging the component histogram 726. This means that different types of nozzles are used by this task.

[2330]
FIG. 144D shows the initial tasks 727 that are finally produced in the latter half (S723 to S726) of FIG. 142. Note that in FIG. 144D, the components belonging to the component histogram 725 are surrounded by a thin line, while the components belonging to the component histogram 726 are surrounded by a thick line. The first of the generated tasks (i.e., the first task to be mounted) is task 1 that is at the bottom.

[2331]
FIG. 144E shows the nozzle patterns for the initial tasks 727 shown in FIG. 144D. Here, a “nozzle pattern” is a pattern in which the nozzle types used to pick up components are shown corresponding to the positions of the mounting heads (i.e., positions at which nozzles are fitted onto the line gang pickup head 112). In the present example, the nozzle pattern for the third task includes both type S and type M nozzles.

[2332]
FIG. 145 shows the effect of this “appropriation” using an example which, for ease of explanation, only includes one component histogram 730. The number of nozzle strokes are shown for the case where the initial tasks 731 are generated by the algorithm described earlier in this specification and for the case where the initial tasks 732 are generated using “appropriation”.

[2333] It should be noted that the components that are surrounded by thick lines belong to the same task, and that the numbers written inside the squares representing the tasks show the number of the mounting head used to pick up that component.

[2334] The conventional method is shown in the upper part of FIG. 145. The component histogram 730 is composed of four tasks 731, 732a and 732b, 733a and 733b, and 734, so that a total of 40 nozzle strokes are required. The “appropriation” method is shown in the lower part of FIG. 145. The component histogram 730 is composed of four tasks 735 to 738, so that a total of only 14 nozzle strokes are required.

[2335] 4.3.2 Task Division

[2336] The mounting time for general components can be greatly reduced by optimizing the interchanging of nozzles. However, nozzle interchanging cannot be directly controlled using NC data, since the mounter 100 automatically interchanges the nozzles in accordance with the types of components given in the NC data. As a result, to optimize the nozzle interchanging operations performed when nozzle are changed, it is necessary to perform an indirect optimization that changes the component types that compose tasks. This means that optimization of tasks and optimization of the nozzle interchanging operations have to be performed simultaneously, which is not realistically possible.

[2337] Because of this, the composition of tasks is decided in a way which reduces the required number of nozzle interchanges, with the aim of reducing the overall mounting time.

[2338] One method for composing tasks is “task division”. In more detail, the nozzle pattern is investigated for each of the initial tasks, focus is placed on tasks before or after which nozzles are interchanged, such tasks are divided into tasks composed of component types that can be picked up by the nozzle pattern being nozzles are interchanged and component types that can be picked up by the nozzle pattern after nozzles are interchanged, and the tasks are recomposed so that unnecessary interchanges of nozzles are avoided.

[2339]
FIG. 146 is a flowchart showing the procedure used by an optimization algorithm for optimizing the nozzle interchanging operations based on “task division”. First, the optimization apparatus 300 investigates the nozzle patterns for the tasks (or initial tasks) to be optimized, and judges whether there are any tasks that use two or more types of nozzles (S740).

[2340] When there are no such tasks (S740:No), the optimization apparatus 300 judges that “task division” is unnecessary and the procedure ends.

[2341] On the other hand, when there is such a task (S740:Yes), this task the task is split into tasks where there is only one nozzle type (S741). After this, one of the tasks produced by this splitting (the tasks that uses different nozzles to the immediately preceding task) is moved to the end of a set of tasks that use the same nozzles (S742). Hereafter, a set of tasks that use the same nozzles is referred to as a “task set”.

[2342] As a result, tasks where there are different types of nozzles are eliminated, so that tasks are only composed of components that use the same type of nozzles.

[2343]
FIGS. 147A to 147D show a specific example of the flowchart shown in FIG. 146. In this example, task division is performed on initial tasks that have been generated using appropriation.

[2344]
FIG. 147A shows the tasks 740 that are to be subjected to task division. These tasks are the same as the tasks 727 shown in FIG. 144D. In this example, task 3 out of the tasks 740 has components that use two types of nozzles. As a result, nozzle interchanging is necessary before and after task 3. In other words, type S nozzles have to be replaced with type M nozzles both before task 3 is executed following task 2 and after task 3 is executed prior to task 4.

[2345]
FIG. 147B shows the splitting of the tasks in step S741 of FIG. 146. In the present example, task 3 is divided into the task 741 that includes only nozzle type S and task 742 that includes only nozzle type M.

[2346]
FIG. 147C shows the movement of tasks in step S742 of FIG. 146. In the present example, task 742 that was generated by splitting task 3 is moved to the end of the task set 743.

[2347]
FIG. 147D shows the nozzle patterns corresponding to the tasks shown in FIG. 147C. As can be seen from the drawing, all of the tasks with different nozzle types have been removed, and the initial tasks have been recomposed to form three tasks that include only nozzle type S and three tasks that include only nozzle type M.

[2348] As can be understood from the nozzle patterns that are produced by task division, nozzle interchanging (from type S to type M) only needs to be performed when task 4 is executed following task 3. This means that using these nozzle patterns reduces the number of nozzle interchanging operations from two to one.

[2349] 4.3.3 Task Combining

[2350] While task division reduces the number of nozzle interchanging operations, there is an increase in the number of tasks. As a result, there can be cases where the overall optimization level is still insufficient.

[2351] For this reason, task combining is performed to suppress the increase in the number of tasks by combining the increased tasks with other tasks.

[2352]
FIG. 148 is a flowchart showing the procedure used by an optimization algorithm based on “task combining”. First, the optimization apparatus 300 judges whether there are any pairs of tasks that can be combined in each task set in the tasks to be optimized, or in other words, judges whether there are any pairs of tasks where there is no coincidence between the mounting heads used to pick up components (S750). In more detail, the optimization apparatus 300 takes a logical AND for whether each mounting head (i.e., coinciding positions on the line gang pickup head 112) is used in two tasks (the tasks being expressed using logic values where “1” shows that the nozzle is used and “0” that the nozzle is not used) to find pairs of task where the result “0” is given for all nozzles.

[2353] When there is no such pair of tasks (S750:No), the optimization apparatus 300 judges that task combining is not possible, and this procedure ends.

[2354] On the other hand, when a pair of tasks is found (S750:Yes), the optimization apparatus 300 combines the tasks (S751). In more detail, the tasks are linked with the present nozzle positions being maintained to produce a single new task.

[2355]
FIGS. 149A to 149C shows a specific example of the processing performed by the flowchart shown in FIG. 148. In this example, task combining is performed for the tasks generated by the task division shown in FIGS. 147A to 147D.

[2356]
FIG. 149A shows the tasks that are to be subjected to task combining. These tasks are the same as those shown in FIG. 147C. In this example, task 5 and task 742 belong to the same task set and include only components that correspond to non-coinciding positions on the line gang pickup head 112. As a result, the optimization apparatus 300 judges that task 5 and task 742 can be combined.

[2357]
FIG. 149B shows the combining of tasks in step S751 of FIG. 148. In the present example, task 5 and task 742 are combined with the positions of their constituent components being maintained.

[2358]
FIG. 149C shows the nozzle patterns corresponding to the tasks shown in FIG. 149B. As can be understood by comparing these nozzle patterns with the nozzle patterns in FIG. 147D, the nozzle patterns in FIG. 149C include one less task composed of all type M nozzles. This means that the overall number of tasks is reduced without increasing the number of nozzle interchanges, thereby further increasing the optimization level. As a result of both processes, the required number of nozzle interchanges is reduced from two to one.

[2359] 4.3.4 Task Interchanging

[2360] By performing task division and task combining as described above, the nozzle interchanging operations can be optimized, though this optimization only focuses on one set of tasks (when there are many sets of tasks, one component group) at a time. In other words, there can be cases where unnecessary nozzle interchanging operations occur due to the relationship of a present set of tasks with the preceding or succeeding set of tasks.

[2361]
FIG. 150 shows a specific example of this situation. This example shows two component groups 1 and 2 and two nozzle patterns 760 and 761 where the nozzle interchanging operations have been optimized in units of component groups by performing task division and/or task combining. The nozzle pattern 760 for component group 1 is composed of a task set 760a for nozzle type S and a task set 760b for nozzle type M that are arranged in this order Similarly, the nozzle pattern 761 for component group 2 is composed of a task set 760a for nozzle type M and a task set 760b for nozzle type S that are arranged in this order.

[2362] As can be understood from the nozzle patterns shown in FIG. 150, an unnecessary nozzle interchanging operation is performed between the component groups. Focusing on type S nozzles, for example, these nozzles are fitted onto the line gang pickup head 112 to execute the task set 760a, the nozzles are then removed so that the line gang pickup head 112 can execute the task set 760b, and then are fitted back onto the line gang pickup head 112 to execute the task set 761a, thereby involving an unnecessary nozzle interchanging operation. Since the nozzle types on the line gang pickup head 112 change from S to M to S to M, a total of three nozzle interchanging operations are required.

[2363] To remedy this situation, task interchanging, that reorders the tasks in the task sets belonging to each component group is performed to eliminate unnecessary nozzle interchanging operations that are performed in between component groups.

[2364]
FIG. 151 is a flowchart showing the procedure used by an optimization algorithm that uses task interchanging. This process determines an optimal arrangement of task sets using a “round-robin” method.

[2365] In more detail, the optimization apparatus 300 first specifies all of the possible orders for the task sets in each of the component groups being optimized (S760). When doing so, the optimization apparatus 300 only investigates whether task sets can be moved within component groups, and do not consider changing the order of the component groups themselves.

[2366] After this, the optimization apparatus 300 calculates the number of nozzle interchanging operations in the nozzle patterns for each of the orders found in step S760 (S761 to S763). The optimization apparatus 300 then finds which nozzle pattern (order of task sets) results in the lowest number of nozzle interchanging operations and sets this as the optimal solution (S764).

[2367]
FIG. 152 shows the nozzle pattern obtained by performing optimization though task interchanging. This nozzle pattern is obtained by performing task interchanging on the nozzle pattern shown in FIG. 150, and is characterized by the order of the two task sets 760a and 760b composing component group 1 having been reversed.

[2368] With the nozzle pattern shown in FIG. 152, the nozzle types on the line gang pickup head 112 change from M to S to M, making a total of only two nozzle interchanging operations. In other words, task interchanging has resulted in the number of nozzle interchanging operations falling from three to two.

[2369] 4.4 Optimization with Respect to the Nozzle Restrictions

[2370] The following describes the procedure used when the positions of nozzles in the nozzle station 119 are fixed and an optimization method for small components when the number of nozzles used is less than ten.

[2371] 4.4.1 Procedure Performed When the Arrangement of Nozzles in the Nozzle Station is Fixed

[2372] When optimizing a plurality of sets of NC data simultaneously, it is not possible to change the arrangement of nozzles in the nozzle station 119 for each set of NC data, so that the arrangement of nozzles in the nozzle station 119 ends up being fixed, making this a restriction for the optimization processing performed.

[2373] When the arrangement of the nozzles in the nozzle station 119 is fixed, the restrictions on the construction of the mounter 100 (i.e., the movable range of the line gang pickup head 112 above the nozzle station 119 and the component supplying units 115a and 115b) mean that there can be cases where it is not possible to pick up certain components using the specified nozzles.

[2374] For this reason, when provided with a nozzle arrangement for the nozzle station 119, the optimization apparatus 300 checks whether this arrangement can be used (i.e., judges whether the existence of a possible order of component mounting is likely). In other words, when provided with an arrangement of nozzles in the nozzle station 119 and a Z-axis arrangement of component tapes, the optimization apparatus 300 judges whether it appears likely that each of the components can be picked up with the appropriate nozzle.

[2375]
FIG. 153 is used to show the restrictions present in this kind of situation. In the drawing, the nozzle restrictions are caused by the limited range of movement of the line gang pickup head 112 above the nozzle station 119. From the top, FIG. 153 shows (1) the positional relationship between the line gang pickup head 112 and the nozzle station 119 (a front elevation of the line gang pickup head 112 and the nozzle station 119) when the line gang pickup head 112 is positioned at its rightmost-position, (2) an overhead view of the nozzle station 119, and (3) a table 770 shows the relationship between the nozzle positions and the mounting heads, with circles indicating that a nozzle can be fitted onto a mounting head.

[2376] It should be noted that in the illustrated example, the line gang pickup head 112 can move past the nozzle station 119 on the left side, so that there are no restrictions as to which nozzles can be fitted on the line gang pickup head 112.

[2377] As can be understood from FIG. 153, the nozzles n1 to n4 positioned in the first to fourth columns counting from the left side of the nozzle station 119 can be fitted to the mounting heads H1 to H10, so that no restrictions apply for these nozzles. However, the remaining nozzles n5 to n10 are subject to restrictions. The nozzle n5 positioned in the fifth column can only be fitted to the mounting heads H2 to H10, the nozzle n6 positioned in the sixth column can only be fitted to the mounting heads H3 to H10, . . . , and the nozzle n10 positioned in the tenth column can only be fitted to the mounting heads H7 to H10.

[2378]
FIGS. 154A to 154C show another example of a restriction. In this example, restrictions are placed on the pickup of components due to the range of movement of the line gang pickup head 112 over the component supplying units 115a and 115b. These drawings correspond to FIGS. 5A and 5B, though, the detailed content is different.

[2379]
FIG. 154A shows the relative positional relationship between the line gang pickup head 112 and the component supplying unit 115a when the line gang pickup head 112 has been moved to its leftmost position. The consecutive numbers that are written on the component supplying unit 115a are the Z numbers. FIG. 154B shows the relative positional relationship between the line gang pickup head 112 and the component supplying unit 115b when the line gang pickup head 112 has been moved to its rightmost position. FIG. 154C shows the mounting heads that can access a given Z number using circles and the mounting heads that can access a given Z number using crosses.

[2380] As can be understood from FIGS. 154A to 154C, the component tapes at the Z numbers 1 to 17 and 86 to 96 cannot be accessed by every mounting head. In more detail, only mounting head H1 can assess a component tape at Z number 1, only mounting heads H1 and H2 can assess a component tape at Z number 2, . . . and only mounting heads H1 to H9 can assess a component tape at Z number 17. In the same way, only mounting heads H2 to H10 can assess a component tape at Z number 86, . . . , and only mounting heads H7 to H10 can assess a component tape at Z number 96.

[2381] It should be noted that this kind of access restriction occurs near the left and right ends of the Z-axis due to the design of the mounter 100. When designing the mounter 100, more priority is given to maximizing the number of components tapes that can be set in the component supplying units 115a and 115b than to avoiding these kinds of access restrictions.

[2382] As can be seen from FIG. 153 and FIG. 154A to 154C, the optimization apparatus 300 can check whether a given nozzle arrangement in the nozzle station 119 may be used by examining whether the mounting heads can access components arranged near the left edge of the Z-axis. Only mounting heads with low head numbers are capable of accessing positions near the left edge of the Z-axis (see FIG. 154C), though such mounting heads with low head numbers cannot be fitted with all of the nozzles in the nozzle station 119 (see FIG. 153C).

[2383] On the other hand, this kind of investigation does not need to be performed for the right edge of the Z-axis. The mounting head H10, at least, can be fitted with every nozzle on the nozzle station 119 (see FIG. 153) so that at a maximum of 96 numbered positions on the Z-axis can be accessed (see FIG. 154C), so that there are no restrictions on the arrangement of nozzles in the nozzle station 119.

[2384]
FIG. 155 is a flowchart showing the procedure that checks whether an arrangement of nozzles in the nozzle station can be used.

[2385] First, the optimization apparatus 300 specifies the lowest Z number PZ min(Ntype,Z arrangement) for each nozzle type “Ntype” in a provided Z-axis arrangement of component tapes (S780). As one example, the optimization apparatus 300 specifies the Z number of the component tape located at the left edge of the Z-axis, out of the component tapes that use the nozzle type S.

[2386] Next, the optimization apparatus 300 repeats the following processing for each nozzle type Ntype in the provided nozzle arrangement NP in the nozzle station 119 (S781 to S785).

[2387] First, the optimization apparatus 300 specifies the lowest head number H min(Ntype,NP) that is capable of being fitted with the nozzle type Ntype (S782). As one example, when type S nozzles are located in the sixth column counting from the left of the nozzle station 119, head number “3” is specified from the table in FIG. 153 as the lowest head number that is capable of being fitted with a type S nozzle.

[2388] Next, the optimization apparatus 300 specifies the lowest Z coordinate NZ min(Ntype,NP) that can be reached by a nozzle of nozzle type Ntype when fitted on the mounting head with the specified head number H min(Ntype,NP) (S783). As one example, when the specified head number H min(Ntype,NP) is “3”, it can be seen from the table in FIG. 154C that the lowest Z coordinate NZ min(Ntype,NP) that can be reached by this mounting head is “4”.

[2389] After this, the optimization apparatus 300 judges whether the lowest Z coordinate NZ min(Ntype,NP) is no greater than the Z number PZ min(Ntype,Z arrangement) that was specified for the nozzle type N-type in step S780 (S784). In other words, the optimization apparatus 300 judges whether the relationship

NZ
min(Ntype,P)≦PZ min(Ntype,Z arrangement)

[2390] is established for the present nozzle type N-type.

[2391] In this way, the optimization apparatus 300 judges whether the lowest Z coordinate NZ min (Ntype,NP) that can be accessed by a nozzle of the nozzle type Ntype due to the arrangement of the nozzles in the nozzle station 119 is equal to or lower than the lowest Z number PZ min(Ntype,Z arrangement) that is determined by the Z-axis arrangement provided. In simpler terms, the optimization apparatus 300 judges whether this nozzle can pick up all of the components it is supposed to pick up when the line gang pickup head 112 is moved to the left.

[2392] When positive judgements are made for every nozzle type Ntype in step S784, the optimization apparatus 300 judges that the nozzle arrangement provided can be used for the present Z-axis arrangement (S786). If not, the optimization apparatus 300 judges that the nozzle arrangement provided cannot be used (S787).

[2393] By checking that the nozzle arrangement can be used when composing the initial tasks or updating a state, optimization can be performed with due consideration to the influence of the fixed arrangement of nozzles in the nozzle station.

[2394] 4.4.2 Optimization for Small Components When Less Than 10 Nozzles are Used

[2395] While the line gang pickup head 112 is able to pick up a maximum of ten components simultaneously, the performance of such efficient pickup operations rests on the premise that ten nozzles have been fitted onto the line gang pickup head 112. At a production facility, however, there are cases where there are less than ten nozzles that can be used by a particular mounter 100. In such cases, the line gang pickup head 112 can perform a nozzle interchanging operation at the nozzle station 119 and change the positions of the mounted nozzles, so that in theory, if there is at least one of each of the required types of nozzles, components that are positioned anywhere on the Z-axis can be picked up, thereby enabling all of the components to be mounted.

[2396] However, nozzle interchanging is a time-consuming operation, so that especially for small components where the number of mounting points is high, a mounting order that suppresses the number of nozzle interchanging operations is desired.

[2397] Optimization for small components when the number of used nozzles is below ten is based on the small components algorithm described earlier that includes the cut down process and other processes, and includes the following processes so as to minimize the number of nozzle interchanging operations.

[2398] When the number of used nozzles is set as n (<10), the following two nozzle patterns are provided and all of the small components are mounted using these two nozzle patterns (in some cases, using only one of these nozzle patterns).

[2399] (i) Nozzle Pattern 1

[2400] This is a pattern in which nozzles are fitted onto the head numbers 1 to n.

[2401] (ii) Nozzle Pattern 2

[2402] This is a pattern in which nozzles are mounted onto the head numbers (10−n+1) to 10.

[2403]
FIG. 156 shows one example of the two nozzle patterns that are provided when the number of used nozzles is 6. In this case, nozzle pattern 1 only mounts components using nozzles that are fitted onto the six mounting heads with the head numbers 1 to 6, while nozzle pattern 2 only mounts components using nozzles that are fitted onto the six mounting heads with the head numbers 5 to 10.

[2404]
FIG. 157 is a flowchart showing the timing at which nozzle interchanging is performed. This processing determines (a) which of the two nozzle patterns 1 and 2 is used in accordance with the position (left/right block, Z numbers) in the provided arrangement of component tapes on the Z-axis, and (b) at what point switching is performed between the nozzle patterns.

[2405] The following processing is performed for the component tapes positioned in the left block (S800:Left). When at least one component tape is located at any of the Z positions 1 to 17 (S801:Yes), nozzle pattern 1 is used and components are picked up in the direction Z number 1 to 48 (S802). As soon as there are no more components to be picked up from the Z numbers 1 to 17 (S801:No), the nozzle pattern to be used for the line gang pickup head 112 is switched from nozzle pattern 1 to nozzle pattern 2, and the remaining components are picked up in order from the Z numbers 18 to 48 (S803).

[2406] On the other hand, when no component tapes are arranged at any of the Z numbers 1 to 17 in the left block (S801:No), nozzle pattern 2 is used from the start and components are picked up in order from the Z numbers 18 to 48 (S803).

[2407] For the component tapes arranged in the right block (S800: Right), nozzle pattern 2 is used from the start and is used to pick up all of the components in order (S804).

[2408] The following is the reason why this timing is used for interchanging the nozzles. As can be understood from the head numbers of the mounting heads that can access each Z number in FIG. 154C, the mounting head H10 with the head number 10 can access the Z numbers 18 to 96. Accordingly, so long as the number of used nozzles n is 1 or above, the component tapes with the Z numbers 18 to 96 can definitely be picked up using nozzle pattern 2. On the other hand, the component tapes with the Z numbers 1 to 17 can be accessed with at least the mounting head H1 with the head number 1, so that so long as the number of used nozzles n is 1 or above, the component tapes with the Z numbers 1 to 17 can definitely be picked up using nozzle pattern 1. Here, the nozzle pattern 2 that can access many Z numbers is given priority. As a result, every different Z-axis arrangement can be handled using only two different nozzle patterns and a low number of nozzle interchanging operations.

[2409] It should be noted that pickup patterns can be generated by performing the cut down process in units of n components instead of 10 components on the component histogram provided.

[2410] This completes the explanation of the optimization of the order of component mounting according to the above embodiment of the present invention. However, the invention is not limited to above embodiment.

[2411] In the above explanation, the optimization apparatus 300 is used to generate optimal NC data that is downloaded in the mounters 100 and 200. However, the optimization apparatus 300 does not have to be used in this way. It should be obvious that the optimization apparatus 300 can be used to determine the composition of a production line that is necessary to fulfill the production requirements. The optimization apparatus 300 may be provided with mounter information for a virtual electrical component mounting system produced by modeling mounting point data for the substrate to be produced, with the optimization apparatus 300 judging whether the produced optimized state (estimated tact time) fulfills the production requirements.

[2412] In more detail, the optimization apparatus is capable of (i) to (iii) below.

[2413] (i) The optimization apparatus 300 may make the following variations to find the most efficient (i.e., productive) design for the head or other components of the mounter. As examples, the number of nozzles on the line gang pickup head 112 may be changed from four nozzle heads to ten nozzle heads to eight nozzle heads, the nozzle pitch may be changed from 21.5 mm to 22 mm, and the pitch of the component cassettes (the pitch of the Z-axis) may be changed.

[2414] (ii) The optimization apparatus may determine which production line (or mounter) out of a plurality of production lines should be used to manufacture the intended substrate.

[2415] (iii) The optimization apparatus 300 may be used as a sales tool to calculate the productivity (number of substrates that can be produced per hour) for mounters that can be equipped with various options (different numbers and types of component cassettes and nozzles).

[2416] The optimization apparatus 300 was described as being a separate apparatus to the mounters 100 and 200, though the optimization apparatus may be internally provided in the mounters 100 and 200.

[2417] The state optimizing part 316 was described as optimizing the small components belonging to component groups G[1] to G[5] and the general components belonging to component groups G[6] to G[9] separately using different approaches for finding an optimal solution. However, the present invention is not limited to this classification of components or these approaches.

[2418] Intersection disentanglement was described as optimizing the order of mounting by judging whether the tact time is reduced when mounting points in two tasks are interchanged so as to remove intersections between lines drawn between the mounting points composing each task. However, mounting points that are joined by non-intersecting lines may also be interchanged. This is because reductions in tact time can also be achieved by reorganizing the paths for tasks where there are no intersections.

[2419] 5 Glossary

[2420] The following explains the main terminology used above when describing an embodiment of the present invention.

[2421] Component Mounting System

[2422] A system composed of an optimization apparatus and one or more mounters.

[2423] Optimization Apparatus

[2424] An apparatus for optimizing the order of mounting components. In order to reduce the tact time (time taken by mounting) taken when manufacturing substrates, the optimization apparatus determines various factors, such as an optimal arrangement of component cassettes for each mounter (what component tapes should be placed in which component feeders and at what positions (on the Z-axis) such component feeders should be arranged in the mounters) and the order in which a line gang pickup head should pick up and mount components (from which component feeders components should be picked up and at which mounting points on a substrate these components should be mounted).

[2425] Mounter

[2426] A mounter is a manufacturing robot that picks up components from component feeders using a line gang pickup head and mounts them on a substrate, in accordance with optimized NC data.

[2427] Stage

[2428] An apparatus (mounting unit) that is equipped with a single line gang pickup head and a plurality of component feeders and mounts components onto a substrate independent of (and in parallel with) another stage.

[2429] Single Cassette Feeder

[2430] A type of component feeder that holds one component tape.

[2431] Double Cassette Feeder

[2432] A type of component feeder that can hold a maximum of two component tapes. However, both component tapes need to have the same feed pitch.

[2433] Z-Axis

[2434] A coordinate axis (and coordinate values on this axis) that specifies positions in an arrangement of component feeders that can be arranged in each mounter (or stage when a mounter is equipped with stages).

[2435] Component Type

[2436] A type of electrical components, such as resistors or capacitors. Each component type is associated with component information (such as electrical characteristics, shape, number of components, maximum number of divisions, and cassette type).

[2437] Component Tapes

[2438] A plurality of components of the same component type that are lined up on a tape. During the optimization process, the expression “component tape” is used to specify a group of components of the same component type (on the assumption that these components are lined up on a virtual tape). In the process referred to a “component division”, there are cases where a group of components of the same component type (or one component tape) is divided into a plurality of component tapes. The number of component tapes resulting from this division is called the “number of divisions”.

[2439] Mounting Points

[2440] Mounting points are coordinate positions on a substrate at which components are to mounted. In some cases, the same component is mounted at more than one mounting point. The total number of components that are lined up on a component tape for components of the same component type (also referred to as “mounting points”) matches the number of components for that component type (the total number of components to be mounted).

[2441] Component Histogram

[2442] A component histogram is a bar chart produced with the component tapes (component types) on the horizontal axis and the number of components to be mounted on the vertical axis. During optimization, the final arrangement of component feeders is mapped using a component histogram.

[2443] Core

[2444] When a component histogram in which component tapes are arranged in descending order of the number of components to be mounted is subjected to the cut down procedure, the core is the part of the component histogram that is left after pickup patterns in which n components are simultaneously picked up have been cut down from the component histogram. The component tapes that includes components in the core are referred to as the “core component tapes”, and the corresponding component cassettes are referred to as the “core cassettes”.

[2445] Cut Down Process

[2446] The cut down process is a process performed on a component histogram in which component tapes are arranged in descending order of the number of components to be mounted. Starting from the component tapes with few components to be mounted, pickup patterns in which n components are simultaneously picked up are cut away from the component histogram.

[2447] Task

[2448] A task is a series of mounting operations in which a line gang pickup head picks up, transports, and mounts components onto a substrate. The line gang pickup head repeatedly executes tasks to mount all of the required components.

[2449] Pickup Pattern

[2450] A pickup pattern is a figure showing how components are simultaneously picked up by the line gang pickup head in one or more tasks, and also refers to the components picked up in this way.

[2451] Task Group

[2452] A task group is a collection of tasks that are related in view of the ability to simultaneously pick up components. A task group can be produced by gathering n component tapes with the same number of components to be mounted and then generating tasks where n components are simultaneously picked up by taking one component from each of the n component tapes. An optimization method that determines the arrangement of component tapes by producing a task group in this way is referred to as the “task group generation method”.

[2453] Mountain

[2454] A mountain is a collection of component tapes whose arrangement has been determined by optimization, or a component histogram corresponding to the arrangement of these component tapes. A component histogram that has been subjected to optimization using the “cut down procedure” is in the form of a “mountain” with one steeply inclined side and one gradually inclined side. In some cases, the resulting mountain is again subjected to optimization.

[2455] Estimated Tact Time Balance

[2456] The estimated tact time balance reflects the degree to which the distribution of the tact times for each mounter (or stage in the case where a mounter is equipped with stages) is even. The process that determines the order of component mounting so as to even out the distribution of tact times is called the “estimated tact time balancing process”.

INDUSTRIAL APPLICABILITY

[2457] The order of component mounting optimization method of the present invention can be used by an optimization apparatus that optimizes the order of component mounting for a mounter that mounts electronic components onto a printed circuit board. This optimization method can also be used by a controller of mounters that form a production line, and, before a production line is assembled, by a simulation/evaluation tool that is used to make predictions as to the relationship between the construction/specification of planned mounting equipment and the time taken to mount components.

Claims

1. An optimizing method that optimizes, using a computer, a component mounting order in which a production line composed of at least one mounter mounts a plurality of components on a substrate, the optimizing method comprising: a classifying step for classifying the plurality of components into component groups by setting groupings of components whose heights are equal or within a predetermined range as the component groups; and a sorting step for determining a mounting order for each component group so that components belonging to component groups of low components are mounted on the substrate first.
2. An optimizing method according to claim 1, wherein the production line is composed of at least two mounters arranged in a line, and the sorting step assigns the components, in units of component groups, in order starting with the component groups of low components and in a direction that heads from a mounter positioned upstream on the line towards a downstream mounter.
3. An optimizing method according to claim 1, wherein in the classifying step, components, out of the plurality components, that are no higher than predetermined height are classified into a component group for components with a lowest height.
4. An optimizing method according to claim 1, wherein each mounter is equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that store components, and mounts the components on a substrate, the optimizing method further comprising a mounting order determining step for determining a mounting order for components so that when the mounting head picks up at least two components, low components are mounted on the substrate first.
5. An optimizing apparatus that optimizes, using a computer, a component mounting order in which a production line composed of at least one mounter mounts a plurality of components on a substrate, the optimizing method comprising: classifying means for classifying the plurality of components into component groups by setting groupings of components whose heights are equal or within a predetermined range as the component groups; and sorting means for determining a mounting order for each component group so that components belonging to component groups of low components are mounted on the substrate first.
6. A mounter for mounting components on a substrate, comprising: mounting means for mounting a plurality of components, which have been classified into component groups of components whose heights are equal or within a predetermined range, on a substrate so that components belonging to component groups of low components are mounted on the substrate first.
7. A computer program which, when executed by a computer, has the computer optimize a component mounting order in which a production line composed of at least one mounter mounts a plurality of components on a substrate, the computer program causing the computer to function as: a classifying means for classifying the plurality of components into component groups by setting groupings of components whose heights are equal or within a predetermined range as the component groups; and a sorting means for determining a mounting order for each component group so that components belonging to component groups of low components are mounted on the substrate first.
8. A computer-readable storage medium on which a computer program according to claim 7 is recorded.
9. An optimizing method that optimizes, using a computer, a component mounting order in which a production line composed of at least one mounter mounts a plurality of components on a substrate, the optimizing method comprising: a classifying step for classifying the plurality of components into component groups by setting groupings of components whose heights are within a predetermined range as the component groups; and an assigning step for assigning each of the plurality of components to one of the mounters so that each mounter mounts components belonging to component groups of components that are no higher than components belonging to component groups that are assigned to a mounter positioned downstream on the production line.
10. An optimizing method according to claim 9, wherein the plurality of component groups are each composed of at least one task group, a task group being a grouping of components whose positions in a mounting order may be interchanged, and the assigning step assigns components to mounters in units of task groups.
11. An optimizing method according to claim 10, wherein the assigning step includes: a first assigning substep for assigning the task groups in ascending order of the height of the components composing the groups to the mounters starting with a most upstream mounter and moving downstream along the production line, and a second assigning substep for changing a pattern in which task groups have been assigned by the first assigning step by reassigning at least one task group that has been assigned to an arbitrary mounter to an adjacent mounter on an upstream or downstream side of the arbitrary mounter.
12. An optimizing method according to claim 11, wherein the second assigning substep (1) specifies, out of all of the mounters, a mounter for which a total time taken to mount all components assigned to the mounter is the longest and a mounter for which a total time taken to mount all components assigned to the mounter is the shortest, and (2) reassigns task groups by moving task groups between adjacent mounters within a part of the production line from one of the two specified mounters to another of the two specified mounters, in a direction moving from the mounter with the longest total time towards the mounter with the shortest total time.
13. An optimizing method according to claim 12, wherein the second assigning substep reassigns a task group to an adjacent mounter only if after reassignment a time taken to mount all of the task groups assigned to the adjacent mounter to which the task group is reassigned is shorter than the total time, before reassignment, of the mounter specified as having the longest total time.
14. An optimizing method according to claim 11, wherein the assigning step further includes: a third substep for changing a pattern in which components have been assigned by the first and second assigning substeps by reassigning components in units of component tapes, a component tape being a group of components of a same type, from an arbitrary mounter to an adjacent mounter on an upstream or downstream side of the arbitrary mounter.
15. An optimizing method that optimizes, using a computer, a component mounting order in which a mounter equipped with a first stage and second stage mounts a plurality of components on a substrate, the first and second stage being independent and each including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that store components, and mounts the components on a substrate, the optimizing method assigning component cassettes to the first stage and second stage so as to even out a load of the stages during mounting and comprising: an initial assigning step for assigning, according to predetermined rules, each of the plurality of components to one of the first and second stages, and for specifying a plurality of mountains, a mountain being a plurality of related component tapes, a component tape being a group of components of a same type, for the assigned components so as to maximize the number of times the mounting heads can pick up n components, and a rearranging step for changing, by reassigning components between the first and second stages in units of component tapes or mountains, a pattern in which components have been assigned to the first and second stages in the initial assigning step so as to make load levels of the first and second stages approximately equal, the load level of a stage showing a magnitude of processing required to mount all of the components assigned to the stage.
16. An optimizing method that optimizes, using a computer, a component mounting order in which a mounter equipped with a first stage and second stage mounts a plurality of components on a substrate, the first and second stage being independent and each including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that store components, and mounts the components on a substrate, the optimizing method assigning component cassettes to the first stage and second stage so as to even out a load of the stages during mounting and comprising: an initial assigning step for assigning, according to predetermined rules, each of the plurality of components to one of the first and second stages, and for specifying a plurality of mountains, a mountain being a plurality of related component tapes, a component tape being a group of components of a same type, for the assigned components so as to maximize the number of times the mounting heads can pick up n components, and a rearranging step for changing, by reassigning components between the first and second stages in units of components, component tapes, or mountains, a pattern in which components have been assigned to the first and second stages in the initial assigning step so as to make load levels of the first and second stages approximately equal, the load level of a stage showing how much time is required to mount all of the components assigned to the stage.
17. An optimizing method that optimizes, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the mounter including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes for a case where component tapes are held in the component cassettes, a component tape being a group of components of a same type, the mounter being equipped with a first block and a second block that are component supplying units and are each capable of holding a plurality of component cassettes, and the optimizing method optimizing an arrangement of the component tapes in the component cassettes, the optimizing method comprising: an assigning step for assigning each of the plurality of components to one of the first and second blocks, in units of component groups into which components are classified based on height; a detecting step for detecting whether either of the first and second block has an amount of free space, for holding component cassettes, that is insufficient for an optimization process to be performed; a reassigning step for specifying, out of the component groups that have been assigned to a block detected as having insufficient free space, either (i) a component group that has been assigned so as to straddle the first and second blocks, or (ii) a component group for which a number of components in a most numerous component tape is the lowest, for extracting a number of component tapes that is equivalent to the insufficient amount of free space from the specified component group, and for reassigning the extracted component tapes to another component group; and an optimizing step for performing an optimization process on at least one component group that has been assigned to the block that was detected as having insufficient free space.
18. An optimizing apparatus that optimizes, using a computer, a component mounting order in which a plurality of components are mounted on a substrate by a production line composed of a plurality of mounters, the optimizing apparatus comprising: classifying means for classifying the plurality of components into component groups by setting groupings of components whose heights are within a predetermined range as the component groups; and assigning means for assigning each of the plurality of components to one of the mounters so that each mounter mounts components belonging to component groups of components that are no higher than components belonging to component groups that are assigned to a mounter positioned downstream on the production line.
19. A production line in which a plurality of mounters, which mount a plurality of components on a substrate, are arranged in a line, wherein each of the plurality of mounters is equipped with at least one component supplying unit that stores the components to be mounted by the mounter, and wherein the plurality of components are assigned to the component supplying units in the mounters so that the plurality of components are classified into component groups by setting groupings of components whose heights are within a predetermined range as the component groups and each mounter mounts components belonging to component groups of components that are no higher than components belonging to component groups that are mounted by a mounter positioned further downstream on the production line.
20. A computer program which, when executed by a computer, has the computer optimize a component mounting order in which a production line composed of at least one mounter mounts a plurality of components on a substrate, the computer program causing the computer to function as: classifying means for classifying the plurality of components into component groups by setting groupings of components whose heights are within a predetermined range as the component groups; and assigning means for assigning each of the plurality of components to one of the mounters so that each mounter mounts components belonging to component groups of components that are no higher than components belonging to component groups that are assigned to a mounter positioned downstream on the production line.
21. A computer-readable storage medium on which a computer program according to claim 20 is recorded.
22. An optimizing method for optimizing, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the optimizing method comprising: a classifying step for classifying the plurality of components into a small component group and a general component group, based on heights of components; a small component optimizing step for optimizing, using a first algorithm, a mounting order for components belonging to the small component group; and a general component optimizing step for optimizing, using a second algorithm that differs from the first algorithm, a mounting order for components belonging to the general component group.
23. An optimizing algorithm according to claim 22, wherein the mounter is equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that store components, and mounts the components on a substrate, the first algorithm used in the small component optimizing step generates as many tasks composed of n components as a possible, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, and the second algorithm used in the general component optimizing step sets a mounting time of each task as an evaluation function and searches, by changing between states, for a state that has a shortest mounting time as calculated by the evaluation function, a state being a potential mounting order for the general components.
24. An optimizing method according to claim 23, wherein the second algorithm used in the general components optimizing step is a combination of (1) an algorithm that finds a locally optimal state using a greedy method and (2) an algorithm that finds a globally optimal state using a multicanonical method.
25. An optimizing method according to claim 1, wherein the classifying step classifies all components whose heights are no greater than a predetermined height into a small component group and all other components into a general component group.
26. An optimizing apparatus for optimizing, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the optimizing apparatus comprising: classifying means for classifying the plurality of components into a small component group and a general component group, based on heights of components; small component optimizing means for optimizing, using a first algorithm, a mounting order for components belonging to the small component group; and general component optimizing means for optimizing, using a second algorithm that differs from the first algorithm, a mounting order for components belonging to the general component group.
27. A computer program which, when executed by a computer, has the computer optimize a component mounting order in which a mounter mounts a plurality of components on a substrate, the computer program causing the computer to function as: classifying means for classifying the plurality of components into a small component group and a general component group, based on heights of components; small component optimizing means for optimizing, using a first algorithm, a mounting order for components belonging to the small component group; and general component optimizing means for optimizing, using a second algorithm that differs from the first algorithm, a mounting order for components belonging to the general component group.
28. A computer-readable storage medium on which a computer program according to claim 27 is recorded.
29. An optimizing method that optimizes, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the mounter including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes for a case where component tapes are held in the component cassettes, a component tape being a group of components of a same type and the optimizing method optimizing an arrangement of the components tapes in the component cassettes, the optimizing method comprising: a histogram generating step for generating a component histogram in which the plurality of components to be mounted are shown in units of component tapes that have been arranged in descending order of a number of components to be mounted for each component tape; and a diagram generating step (1) for taking partial histograms, which are each a part of the generated component histogram, (2) for arranging the partial histograms at two-dimensional coordinates where an arrangement of component cassettes is shown by a horizontal axis and a number of pickup operations by the mounting head is shown by a vertical axis, so that the partial histograms arranged in two dimensions form a diagram, the diagram being generated so that for as many rows in the diagram as possible, a number of components on the row is n or an integer multiple of n, and (3) for setting an arrangement of component tapes corresponding to the generated diagram as an optimal arrangement of component tapes.
30. An optimizing method according to claim 29, wherein the diagram generating step includes: a first arranging step for taking, from the component histogram generated in the histogram generating step, partial histograms that correspond to n component tapes that are arranged consecutively and arranging the partial histograms along the horizontal axis; and a second arranging substep for taking, from the component histogram, partial histograms composed of remaining component tapes and arranging, at positions where a width of the partial histograms arranged in the first arranging step is less than n components, the taken partial histograms next to the partial histograms arranged by the first arranging step so as to make the widths at the positions closer to n components.
31. An optimizing method according to claim 30, wherein the taking and arranging of partial histograms by the first and second arranging steps are repeated until no components are left in the component histogram generated in the histogram generating step.
32. An optimizing method according to claim 31, wherein in the second arranging step, only partial histograms composed of component tapes with numbers of components that do not exceed a difference between (1) a number of components in a component tape with the most components in the partial histograms arranged in the first arranging step, and (2) a number of components in a component tape with the fewest components in the partial histograms arranged in the first arranging step are taken.
33. An optimizing method according to claim 31, wherein the second arranging step takes at least one partial histogram including a component tape with a number of components that exceeds a difference between (1) a number of components in a component tape with the most components in the partial histograms arranged in the first arranging step and (2) a number of components in a component tape with the fewest components in the partial histograms arranged in the first arranging step.
34. An optimizing method according to claim 29, wherein the second arranging step includes: a regenerating substep for regenerating, after partial histograms have been taken in the first arranging step, the component histogram by arranging remaining component tapes in descending order of number of components to be mounted; a diagram generating substep for repeatedly (a) taking a partial histogram from the regenerated component histogram and (b) arranging the partial histogram at a position corresponding to two-dimensional coordinates, so that a width of every row in a diagram formed from the partial histograms arranged at the two-dimensional coordinates is equal to n components; and a diagram positioning substep for positioning the diagrams generated in the diagram generating substep above the partial histograms arranged by the first arranging step so that partial histograms for the same component tapes are located at the same position on the horizontal axis.
35. An optimizing apparatus that optimizes, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the mounter including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes, the optimizing apparatus comprising: histogram generating means for generating a component histogram in which the plurality of components to be mounted are shown in units of component tapes that have been arranged in descending order of a number of components to be mounted for each component tape; and diagram generating means (1) for taking partial histograms, which are each a part of the generated component histogram, (2) for arranging the partial histograms at two-dimensional coordinates where the arrangement of component cassettes is shown by a horizontal axis and a number of pickup operations by the mounting head is shown by a vertical axis, so that the partial histograms arranged in two dimensions form a diagram, the diagram being generated so that for as many rows in the diagram as possible, a number of components on the row is n or an integer multiple of n, and (3) for setting an arrangement of component tapes corresponding to the generated diagram as an optimal arrangement of component tapes.
36. A mounter that is equipped with (1) an arrangement of component cassettes that store components, and (2) a mounting head that picks up a maximum of n components, n being no less than 2, from the component cassettes and mounts the components on a substrate, wherein each of the plurality of component cassettes holds a plurality of components of a same type, and the component cassettes are arranged so that if a histogram is produced with an arrangement of the component cassettes as a horizontal axis and a number of components, out of a number of components in each component cassette, that are to be mounted by the mounter as a vertical axis, horizontal sections of the histogram are n or an integer multiple of n wide at each position on the vertical axis.
37. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that store components and mounts a plurality of components on a substrate, the computer program causing the computer to function as: histogram generating means for generating a component histogram in which the plurality of components to be mounted are shown in units of component tapes that have been arranged in descending order of a number of components to be mounted for each component tape; and diagram generating means (1) for taking partial histograms, which are each a part of the generated component histogram, (2) for arranging the partial histograms at two-dimensional coordinates where the arrangement of component cassettes is shown by a horizontal axis and a number of pickup operations by the mounting head is shown by a vertical axis, so that the partial histograms arranged in two dimensions form a diagram, the diagram being generated so that for as many rows in the diagram as possible, a number of components on the row is n or an integer multiple of n, and (3) for setting an arrangement of component tapes corresponding to the generated diagram as an optimal arrangement of component tapes.
38. A computer-readable storage medium on which a computer program according to claim 37 is recorded.
39. An optimizing method that optimizes, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the mounter including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes for a case where component tapes are held in the component cassettes, a component tape being a group of components of a same type and the optimizing method optimizing an arrangement of the components tapes in the component cassettes, the optimizing method comprising: a histogram generating step for generating a component histogram in which the plurality of components to be mounted are shown in units of component tapes that have been arranged in descending order of a number of components to be mounted for each component tape; a cutting down step for repeatedly removing pickup patterns, each of which is a series of n consecutive components aligned in a horizontal direction, from the generated component histogram so that component tapes with few components to be mounted are taken first, the cutting down step ending when no more pickup patterns of n components can be taken; a core crush processing step for reshaping a remaining part of the component histogram after the cutting down step has been performed with an aim of producing a diagram which is n-components wide; and a combining step for arranging all of the components removed during the cutting down step and the components in the reshaped part of the component histogram at corresponding positions on a horizontal axis, combining the arranged components to produce an updated component histogram, and setting an arrangement of component tapes corresponding to the updated component histogram as an optimized arrangement for the component tapes.
40. An optimizing method according to claim 39, wherein the core crush processing step reshapes the remaining part of the component histogram after the cutting down step by dividing a component tapes that compose the remaining part into sections composed of certain numbers of components and arranging the sections at new positions on the horizontal axis.
41. An optimizing method according to claim 40, wherein the core crush processing step reshapes the remaining part of the component histogram after the cutting down step into a parallelogram or rectangle that has a base which is parallel to the horizontal axis and is sufficiently high so as to hold all of the components in the remaining part.
42. An optimizing method according to claim 40, wherein the core crush processing step reshapes the remaining part of the component histogram after the cutting down step by (1) applying a template in a form of a parallelogram or rectangle that has a base which is parallel to the horizontal axis and is sufficiently high so as to hold all of the components in the remaining part, and (2) moving components located outside the template to positions inside the template.
43. An optimizing apparatus that optimizes, using a computer, a component mounting order in which a mounter mounts a plurality of components on a substrate, the mounter including a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes for a case where component tapes are held in the component cassettes, a component tape being a group of components of a same type and the optimizing apparatus optimizing an arrangement of the components tapes in the component cassettes, the optimizing apparatus comprising: histogram generating means for generating a component histogram in which the plurality of components to be mounted are shown in units of component tapes that have been arranged in descending order of a number of components to be mounted for each component tape; cutting down means for repeatedly removing pickup patterns, each of which is a series of n consecutive components aligned in a horizontal direction, from the generated component histogram so that component tapes with few components to be mounted are taken first, the cutting down step ending when no more pickup patterns of n components can be taken; core crush processing means for reshaping a remaining part of the component histogram after the cutting down step has been performed with an aim of producing a diagram which is n-components wide; and combining means for arranging all of the components removed during the cutting down step and the components in the reshaped part of the component histogram at corresponding positions on a horizontal axis, combining the arranged components to produce an updated component histogram, and setting an arrangement of component tapes corresponding to the updated component histogram as an optimized arrangement for the component tapes.
44. A mounter that is equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that store components, and mounts the components on a substrate, wherein in a certain part of the arrangement of component cassettes, the component cassettes are arranged in descending order of a number of components to be mounted and the mounting head repeats an operation where n components are picked up from the certain part of the arrangement and are mounted onto the substrate.
45. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes for a case where component tapes are held in the component cassettes, a component tape being a group of components of a same type and the computer optimizing an arrangement of the components tapes in the component cassettes, the computer program causing the computer to function as: histogram generating means for generating a component histogram in which the plurality of components to be mounted are shown in units of component tapes that have been arranged in descending order of a number of components to be mounted for each component tape; cutting down means for repeatedly removing pickup patterns, each of which is a series of n consecutive components aligned in a horizontal direction, from the generated component histogram so that component tapes with few components to be mounted are taken first, the cutting down step ending when no more pickup patterns of n components can be taken; core crush processing means for reshaping a remaining part of the component histogram after the cutting down step has been performed with an aim of producing a diagram which is n-components wide; and combining means for arranging all of the components removed during the cutting down step and the components in the reshaped part of the component histogram at corresponding positions on a horizontal axis, combining the arranged components to produce an updated component histogram, and setting an arrangement of component tapes corresponding to the updated component histogram as an optimized arrangement for the component tapes.
46. A computer-readable storage medium on which a computer program according to claim 45 is recorded.
47. An optimizing method that optimizes, using a computer, a component mounting order for a mounter, the mounter being equipped with a mounting head that picks up components from an arrangement of component cassettes that store components and mounts the components on a substrate, the optimizing method comprising: an initializing step for generating an initial state that is a first state to be used, a state being one out of all potential mounting orders for all of the components in the component mounting order; a state changing step for generating a second state by provisionally changing the first state; a judging step for judging whether both (1) the mounter can mount all of the components according to a mounting order that corresponds to the generated second state, and (2) the mounter takes less time when all of the components are mounted according to the second state than when all of the components are mounted according to the first state; and a repeated control step for optimizing the mounting order of the components by setting the second state as a new first state when a judging step judges that the mounter can mount all of the components and that less time is taken when the components are mounted according to the second state, and then having the state changing step and the judging step repeatedly performed so that the first state is updated.
48. An optimizing method according to claim 47, wherein the state changing step changes the first state using a method selected at random from a plurality of predetermined changing methods.
49. An optimizing method according to claim 48, wherein the plurality of predetermined changing methods that can be selected in the state changing step include a method that interchanges components that come from a same component tape and belong to two tasks, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, and a component tape being a group of components of a same type.
50. An optimizing method according to claim 48, wherein the plurality of components are classified into a plurality of component groups, a component group being a grouping of components whose heights are within a predetermined range, and a state being expressed in an intermediate language that includes, for each of the component groups, priority order parameters showing priority orders for use when arranging component cassettes and component tape order parameters showing an arrangement of component tapes belonging the same component group, a component tape being a group of components of a same type.
51. An optimizing method according to claim 50, wherein the plurality of predetermined changing methods that can be selected in the state changing step include a method where two component groups are selected at random out of the plurality of component groups and the priority order parameters of the selected component groups are interchanged.
52. An optimizing method according to claim 50, wherein the plurality of predetermined changing methods that can be selected in the state changing step include a method where two component tapes are selected at random out of the plurality of component tapes belonging to a same component group and the component tape order parameters of the selected component tapes are interchanged.
53. An optimizing method according to claim 47, wherein in the state changing step, all of the possible states are classified into a plurality of groups, and the second state is generated so that a probability of containing the state generated as the second state is equal for each of the plurality of groups.
54. An optimizing apparatus that optimizes, using a computer, a component mounting order for a mounter, the mounter being equipped with a mounting head that picks up components from an arrangement of component cassettes that store components and mounts the components on a substrate, the optimizing apparatus comprising: initializing means for generating an initial state that is a first state to be used, a state being one out of all potential mounting orders for all of the components in the component mounting order; state changing means for generating a second state by provisionally changing the first state; judging means for judging whether both (1) the mounter can mount all of the components according to a mounting order that corresponds to the generated second state, and (2) the mounter takes less time when all of the components are mounted according to the second state than when all of the components are mounted according to the first state; and repeated control means for optimizing the mounting order of the components by setting the second state as a new first state when a judging step judges that the mounter can mount all of the components and that less time is taken when the components are mounted according to the second state, and then having the state changing step and the judging step repeatedly performed so that the first state is updated.
55. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that picks up components from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the computer program causing the computer to function as: initializing means for generating an initial state that is a first state to be used, a state being one out of all potential mounting orders for all of the components in the component mounting order; state changing means for generating a second state by provisionally changing the first state; judging means for judging whether both (1) the mounter can mount all of the components according to a mounting order that corresponds to the generated second state, and (2) the mounter takes less time when all of the components are mounted according to the second state than when all of the components are mounted according to the first state; and repeated control means for optimizing the mounting order of the components by setting the second state as a new first state when a judging step judges that the mounter can mount all of the components and that less time is taken when the components are mounted according to the second state, and then having the state changing step and the judging step repeatedly performed so that the first state is updated.
56. A computer-readable storage medium on which a computer program according to claim 55 is recorded.
57. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method determining an arrangement of tasks where a task is a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, wherein the mounting head can be equipped with a maximum of n interchangeable nozzles for picking up components, the components to be mounted include at least two types of components that are picked up using different types of nozzle, and the optimizing method comprises: a histogram generating step for generating, for a case where groups of components of the same type are treated as single component tapes and for each nozzle type required by the components to be mounted, a two-dimensional histogram in which a horizontal axis represents an arrangement of component tapes and a vertical axis represents a number of components to be mounted, the component tapes in each histogram for each nozzle type being arranged in descending order of the number of components to be mounted, and for arranging the generated histograms on a horizontal axis; and a task generating step for repeatedly scanning the generated histograms on the horizontal axis, removing components to generate tasks, and arranging the generated tasks in order, until all of the components in the arranged histograms have been removed.
58. An optimizing method according to claim 57, wherein during the task generating step, the histograms are scanned in an order that gives priority to histograms corresponding to nozzle types for which there are limited nozzle resources.
59. An optimizing method according to claim 57, wherein during the task generating step, tasks are generated so as to maximize a number of components forming each task, regardless of whether components that are picked up using different nozzle types end up in a same task.
60. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method optimizing an arrangement of tasks where a task is a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, wherein the mounting head can be equipped with a maximum of n interchangeable nozzles for picking up components, and the arrangement of tasks to be optimized includes at least one mixed task which contains components that are picked up using at least two different types of nozzles, the optimizing method comprising: a separating step for separating each mixed task into a plurality of partial tasks which only contain components that are picked up using one type of nozzle; and a reordering step for moving each partial task, which contains components that are picked up using different types of nozzles to components in an immediately preceding task, to a position in the arrangement of tasks that follows tasks composed of components that are picked up using a same type of nozzle as the partial task.
61. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method optimizing an arrangement of tasks where a task is a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, wherein the mounting head can be equipped with a maximum of n interchangeable nozzles for picking up components, the arrangement of tasks to be optimized includes at least two tasks which contain only components that are picked up using a same type of nozzle, and the optimizing method comprising: a judging step for judging, for a case where the at least two tasks are combined, whether a combined number of components at each position corresponding to the n nozzles is no greater than one component; and a combining step for combining, when the judging step judges that the combined number is no greater than one at each position, the at least two tasks without repositioning components included in the at least two tasks to produce a new task.
62. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method optimizing an arrangement of tasks where a task is a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, wherein the mounting head can be equipped with a maximum of n interchangeable nozzles for picking up components, the arrangement of tasks to be optimized includes at least two tasks which contain only components that are picked up using a same type of nozzle, and is composed of an arrangement of task sets, a task set being an arrangement of tasks containing components that only use a same type of nozzle, the optimizing method including: a specifying step for specifying every possible order for the task sets in the arrangement of tasks; a nozzle interchange number designating step for counting a number of positions, in each order of task sets, where task sets of different types of nozzle are adjacent so as to designate a number of times nozzles need to be interchanged when components are mounted according to each order for the task sets; and a changing step for specifying a lowest number of times nozzles need to be interchanged and changing the arrangement of tasks to the order of tasks sets corresponding to the specified lowest number.
63. An optimizing apparatus that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing apparatus determining an arrangement of tasks where a task is a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, wherein the mounting head can be equipped with a maximum of n interchangeable nozzles for picking up components, the components to be mounted include at least two types of components that are picked up using different types of nozzles, and the optimizing apparatus comprises: histogram generating means for generates, for a case where groups of components of the same type are treated as single component tapes and for each nozzle type required by the components to be mounted, a two-dimensional histogram in which a horizontal axis represents an arrangement of component tapes and a vertical axis represents a number of components to be mounted, the component tapes in each histogram for each nozzle being arranged in descending order of the number of components to be mounted, and for arranging the generated histograms on a horizontal axis; and task generating means for repeatedly scanning the generated histograms on the horizontal axis, removing components to generate tasks, and lining up the generated tasks in order, until all of the components in the arranged histograms have been removed.
64. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the computer determining an arrangement of tasks where a task is a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, wherein the mounting head can be equipped with a maximum of n interchangeable nozzles for picking up components, the components to be mounted include at least two types of components that are picked up using different types of nozzles, and the computer program causing the computer to function as: histogram generating means for generates, for a case where groups of components of the same type are treated as single component tapes and for each nozzle type required by the components to be mounted, a two-dimensional histogram in which a horizontal axis represents an arrangement of component tapes and a vertical axis represents a number of components to be mounted, the component tapes in each histogram for each nozzle type being arranged in descending order of the number of components to be mounted, and for arranging the generated histograms on a horizontal axis; and task generating means for repeatedly scanning the generated histograms on the horizontal axis, removing components to generate tasks, and lining up the generated tasks in order, until all of the components in the arranged histograms have been removed.
65. A computer-readable storage medium on which a computer program according to claim 64 is recorded.
66. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up components from an arrangement of component cassettes that hold the components and mounts the components on a substrate, for a case where groups of components of the same type are treated as component tapes and the optimizing method optimizes an arrangement of component tapes that are held in the component cassettes while respecting restrictions that require certain component tapes to be arranged at certain positions, the optimizing method comprising: a provisional optimizing step for optimizing, in units of component tapes, an arrangement of all the components to be mounted without considering the restrictions; and a changing step for changing the arrangement of component tapes produced by the provisional optimizing step so that the arrangement respects the restrictions.
67. An optimizing method according to claim 66, wherein the provisional optimizing step determines, for the components to be mounted, an arrangement of component tapes on a first coordinate axis so as to maximize a number of times the mounting head can pick up n components, without considering the restrictions.
68. An optimizing method according to claim 67, wherein the changing step includes: a first arranging step for removing component tapes that are subject to the restrictions from the arrangement of component tapes on the first coordinate axis, and arranging the removed component tapes in accordance with the restrictions on a second coordinate axis; and a second arranging step for taking the component tapes that remain in the arrangement on the first coordinate axis and arranging the component tapes in unoccupied positions on the second coordinate axis without changing an order of the taken component tapes.
69. An optimizing method according to claim 68, wherein the mounting head can pick up a maximum of n components, where n is no less than two, and the changing step further includes: a cutting down step for (1) repeatedly taking, starting with component tapes that have few components to be mounted, pickup patterns composed of n components that are consecutive in the horizontal axis until no more pickup patterns of n components can be taken from a component histogram composed of an arrangement of component tapes after the second arranging step, a horizontal axis of the component histogram showing the arrangement of component tapes and a vertical axis of component histogram showing a number of components in each component tape, and (2) assigning the pickup patterns to component cassettes corresponding to the arrangement of component tapes; a core crush processing step for reshaping a remaining part of the component histogram after the cutting down step has been performed with an aim of producing a diagram which is n-components wide; and a combining step for arranging all of the components removed during the cutting down step and the components in the reshaped part of the component histogram at corresponding positions on a horizontal axis, combining the arranged components to produce an updated component histogram, and setting an arrangement of component tapes corresponding to the updated component histogram as an optimized arrangement for the component tapes.
70. An optimizing apparatus that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up components from an arrangement of component cassettes that hold the components and mounts the components on a substrate, for a case where groups of components of the same type are treated as component tapes and the optimizing apparatus optimizes an arrangement of component tapes that are held in the component cassettes while respecting restrictions that require certain component tapes to be arranged at certain positions, the optimizing apparatus comprising: provisional optimizing means for optimizing, in units of component tapes, an arrangement of all the components to be mounted without considering the restrictions, and changing means for changing the arrangement of component tapes produced by the provisional optimizing means so that the arrangement respects the restrictions.
71. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that picks up components from an arrangement of component cassettes that hold the components and mounts the components on a substrate, for a case where groups of components of the same type are treated as component tapes and the computer optimizes an arrangement of component tapes that are held in the component cassettes while respecting restrictions that require certain component tapes to be arranged at certain positions, the computer program causing the computer to function as: provisional optimizing means for optimizing, in units of component tapes, an arrangement of all the components to be mounted without considering the restrictions, and changing means for changing the arrangement of component tapes produced by the provisional optimizing means so that the arrangement respects the restrictions.
72. A computer-readable storage medium on which a computer program according to claim 71 is recorded.
73. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up components from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method comprising: a task group generating step for generating task groups that are arrangements of tasks, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components; and a task interchanging step for changing an order of tasks within each task group so as to minimize a time required to mount all components each task group, and setting a mounting order of components corresponding to a resulting order of tasks as an optimal component mounting order.
74. The optimizing method according to claim 73, wherein the task interchanging step rearranges an order of tasks in each task group so as to minimize paths taken by the mounting head, each path being from a position where the mounting head completes a mounting of all components in one task to a position where the mounting head picks up components for a next task to be mounted.
75. The optimizing method according to claim 74, wherein a position of the mounting head immediately after completing a mounting of all components in one task is set as a final mounting point and a position at which the mounting head picks up components belonging to a next task to be mounted is set as a pickup point, and the task interchanging step includes: a shortest looped partial path specifying step for selecting an arbitrary first task in a task group, specifying the final mounting point for the first task, for selecting, out of all remaining tasks in the task group, a second task whose pickup point is closest to the final mounting point of the first task, for repeating a process specifying the final mounting point of a selected task and then selecting a next task until the first task is selected again, and for setting all tasks that have been selected as a shortest looped partial path; a repeating step for having the shortest looped partial path specifying step repeated until every task in the task group has been selected; and an arranging step for arranging the shortest looped partial paths that are produced as a result of the repeating step having the shortest looped partial path specifying step repeated.
76. The optimizing method according to claim 75, wherein in the task interchanging step, a first task for each shortest looped partial path and an order of the shortest looped partial paths are determined so as to minimize distances moved by the mounting head from a completion of a mounting of all components in a shortest looped partial path to a start of a next shortest looped partial path, and tasks are reordered in accordance with the determined order of shortest looped partial paths.
77. An optimizing apparatus that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up components from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing apparatus comprising: task group generating means for generating task groups that are arrangements of tasks, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components; and task interchanging means for changing an order of tasks within each task group so as to minimize a time required to mount all components composing each task group, and setting a mounting order of components corresponding to a resulting order of tasks as an optimal component mounting order.
78. A mounter that is equipped with (1) an arrangement of component cassettes which hold component tapes, a component tape being a group of components of a same type, and (2) a mounting head that picks up components from the arrangement of component cassettes and mounts the components on a substrate, wherein after the mounting head has mounted every component in a task, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, the mounting head then mounts a task, out of remaining tasks, whose components are picked up at a position which requires a least amount movement by the mounting head.
79. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that picks up components from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the computer program causing the computer to function as: task group generating means for generating task groups that are arrangements of tasks, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components; and task interchanging means for changing an order of tasks within each task group so as to minimize a time required to mount all components each task group, and setting a mounting order of components corresponding to a resulting order of tasks as an optimal component mounting order.
80. A computer-readable storage medium on which a computer program according to claim 79 is recorded.
81. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method comprising: a task group generating step for generating task groups that are arrangements of tasks, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components; and a component interchanging step for changing, within each task group, a mounting order of components so as to minimize a time required to mount all components composing the task group, without changing a combination of component types in each task.
82. An optimizing method according to claim 81, wherein the task interchanging step includes: a selecting step for selecting two components of a same type at random; a judging step for judging whether a total mounting time of a task group containing the two selected components decreases when a mounting order of the two selected components is interchanged; and an interchanging step for interchanging the two selected components in the mounting order when the judging step judges that the total mounting time decreases.
83. An optimizing method according to claim 81, wherein the task interchanging step includes: a judging step for judging whether a total mounting time of a task group decreases when two sets of components that are consecutively mounted on a substrate are interchanged between two tasks in the task group that are composed of a same combination of component types; and an interchanging step for interchanging the two sets of components when the judging step judges that the total mounting time decreases.
84. An optimizing method according to claim 81, wherein the task interchanging step includes: a detecting step for detecting, for a case where for each task, straight lines are drawn between mounting points on the substrate of adjacent components that are picked up and belong to a task, whether there is an intersection between straight lines that belong to two different tasks that are composed of combinations of the same component types; and an interchanging step for interchanging, when the detecting step has detected an intersection, components of the same component type between the two tasks to eliminate the detected intersection.
85. An optimizing apparatus that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing apparatus comprising: task group generating means for generating task groups that are arrangements of tasks, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components; and task interchanging means for changing, within each task group, a mounting order of components so as to minimize a time required to mount all components composing the task group, without changing a combination of component types in each task.
86. A mounter that is equipped with (1) an arrangement of component cassettes which hold component tapes, a component tape being a group of components of a same type, and (2) a mounting head that picks up components from the arrangement of component cassettes and mounts the components on a substrate, wherein a task is a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components, and the mounter mounts components belonging to two tasks that (i) are composed of a same combination of component types and (ii) have a risk of there being an intersection between straight lines which are drawn between mounting points on the substrate for adjacent components that are picked up using mounting paths chosen so that there is no intersection between the straight lines.
87. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the computer program causing the computer to function as: task group generating means for generating task groups that are arrangements of tasks, a task being a set of components that are mounted in one iteration of a repeated series of operations in which the mounting head picks up, transports, and mounts components; and task interchanging means for changing, within each task group, a mounting order of components so as to minimize a time required to mount all components composing the task group, without changing a combination of component types in each task.
88. A computer-readable storage medium on which a computer program according to claim 87 is recorded.
89. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that (1) picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes including double cassettes that are capable of holding two types of components, and (2) mounts the components on a substrate, the optimizing method respecting a restriction that requires the two types of components held in a double cassette to be tape-held components with a same feed pitch, and optimizing an arrangement of component tapes for a case where components are arranged in component cassettes in units of component tapes, a component tape being a group of components of a same type, the optimizing method comprising: a first optimizing step for determining, for all components that use a first feed pitch, an order of component tapes that maximizes a number of times the mounting head can pick up n components; a first folding step for cutting the determined order of components at a central position into a former half and latter half and combining the former half and latter half with component tapes belonging to the former and latter halves in alternating positions; a second optimizing step for determining, for all components that use a second feed pitch, an order of component tapes that maximizes a number of times the mounting head can pick up n components; a second folding step for cutting the determined order of components at a central position into a former half and latter half and combining the former half and latter half with component tapes belonging to the former and latter halves in alternating positions; and a combining step for combining an arrangement of component tapes produced by the first folding step with an arrangement of component tapes produced by the second folding step and setting a result of combining as an optimal arrangement of component tapes.
90. An optimizing method according to claim 89, wherein the combining step does not break up pairs of components from the former half and the latter half that become adjacent as a result of folding in the first folding step and the second folding step, and arranges the pairs of components in descending order of number of components to be mounted for the component tapes that were originally in the former halves.
91. An optimizing method according to claim 90, wherein, in order to respect further restrictions that require certain component tapes to be arranged at certain positions, the optimizing method further comprises: a separating step for separating the combined arrangement of component tapes into a first arrangement that only includes component tapes that were originally in the former halves and a second arrangement that only includes component tapes that were originally in the latter halves; a removing step for removing component tapes that are subject to the further restrictions and component tapes that are paired with component tapes that are subject to the further restrictions from the first arrangement and second arrangement; a returning step for returning component tapes, out of the removed component tapes, that were originally in the former halves to the first arrangement to fill gaps in the first arrangement and reordering paired component tapes in the second arrangement accordingly; and a rearranging step for rearranging the component tapes in the second arrangement based on a feed pitch of each component tape;
92. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method estimating a required number of double cassettes for a plurality of components that belong to component groups into which components have been classified based on component height, a double cassette being capable of holding a maximum of two component tapes, a component tape being a group of components of a same type, and the component groups having been assigned component group numbers in advance for identification purposes, the optimizing method comprising: a first specifying step that specifies a total number N of component tapes belonging to the component groups; a second specifying step for specifying a number Na of component tapes, out of the component tapes belonging to the component groups, that are each (a) arranged into a component cassette that is determined in advance, and (b) arranged in a double cassette together with another part tape from a same component group; a third specifying step for specifying a number Nb of component tapes, out of the component tapes belonging to the component groups, that are each (a) arranged into a component cassette that is determined in advance, and (b) arranged into a double cassette together with another component tape from a component group with a component group number that is lower than a component group number of a component group to which the component tape belongs; a fourth specifying step for specifying a number Nc of component tapes, out of the component tapes belonging to the component groups, that are each (a) arranged into a component cassette that is determined in advance, and (b) arranged in a double cassette together with another component tape from a component group with a component group number that is higher than a component group number of a component group to which the component tape belongs; a fifth specifying step for specifying a number Nd of component tapes, out of the component tapes belonging to the component groups, that are each (a) arranged into a component cassette that is determined in advance, and (b) arranged in a double cassette together with another part tape whose arrangement in a component cassette is not are determined in advance; a sixth specifying step for specifying a number Ne of component tapes, out of the component tapes belonging to the component groups, whose arrangement in a component cassette is not are determined in advance; and a calculating step for calculating the required number of double cassettes in accordance with a predetermined equation that is expressed using the numbers N, Na, Nb, Nc, Nd, and Ne.
93. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method optimizing an arrangement of component tapes, a component tape being a group of components of a same type, for a case where components are held in the component cassettes in units of component tapes, the component cassettes being double cassettes that can hold a maximum of two component tapes and being classified depending on feed pitch into first double cassettes and second double cassettes, the optimizing method comprising: a separating step for separating components, out of the plurality of components that to be held in first double cassettes, into (i) a first fixed component group composed of fixed pairings of components for first double cassettes and (ii) a first free component group composed of components that are not part of a fixed pairing, and for separating components, out of the plurality of components that to be held in second double cassettes, into (i) a second fixed component group composed of fixed pairings of components for second double cassettes and (ii) a second free component group composed of components that are not part of a fixed pairing; a first arranging step for arranging, in units of component tapes and in a manner that maximizes a number of times the mounting head can pick up n components, the components in the first free component group on a first axis that corresponds to an arrangement of the first double cassettes, and for arranging, in units of component tapes, the components in the first fixed component group on the first axis in accordance with the fixed pairings; a second arranging step for arranging, in units of component tapes and in a manner that maximizes a number of times the mounting head can pick up n components, the components in the second free component group on a second axis that corresponds to an arrangement of the second double cassettes, and for arranging, in units of component tapes, the components in the second fixed component group on the second axis in accordance with the fixed pairings; and a combining step for combining an arrangement of component tapes on the first axis with an arrangement of component tapes on the second axis.
94. An optimizing apparatus that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that (1) picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes including double cassettes that are capable of holding two types of components, and (2) mounts the components on a substrate, the optimizing apparatus respecting a restriction that requires the two types of components held in a double cassette to be tape-held components with a same feed pitch, and optimizing an arrangement of component tapes for a case where components are arranged in component cassettes in units of component tapes, a component tape being a group of components of a same type, the optimizing apparatus comprising: first optimizing means for determining, for all components that use a first feed pitch, an order of component tapes that maximizes a number of times the mounting head can pick up n components; first folding means for cutting the determined order of components at a central position into a former half and latter half and combining the former half and latter half with component tapes belonging to the former and latter halves in alternating positions; second optimizing means for determining, for all components that use a second feed pitch, an order of component tapes that maximizes a number of times the mounting head can pick up n components; second folding means for cutting the determined order of components at a central position into a former half and latter half and combining the former half and latter half with component tapes belonging to the former and latter halves in alternating positions; and combining means for combining an arrangement of component tapes produced by the first folding step with an arrangement of component tapes produced by the second folding step and setting a result of combining as an optimal arrangement of component tapes.
95. A mounter equipped with (1) an arrangement of component cassettes including double cassettes that are capable of holding two types of components and (2) a mounting head that picks up a maximum of n components, n being no less than 2, from the component cassettes and mounts the components on a substrate, the component cassettes having been arranged so as to hold a specific order of component tapes, a component tape being a group of components of a same type, the specific order having been produced by (1) forming an arrangement of component tapes that use a same pitch in a manner that maximizes a number of times the mounting head can pick up n components, (2) splitting the arrangement at a midpoint, (3) sliding a latter half of the arrangement back over a former half of the arrangement, and (4) combining the former and latter halves by arranging component tapes from the former and latter halves in alternating positions.
96. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that (1) picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes including double cassettes that are capable of holding two types of components, and (2) mounts the components on a substrate, the computer respecting a restriction that requires the two types of components held in a double cassette to be tape-held components with a same feed pitch, and optimizing an arrangement of component tapes for a case where components are arranged in component cassettes in units of component tapes, a component tape being a group of components of a same type, the computer program causing the computer to function as: first optimizing means for determining, for all components that use a first feed pitch, an order of component tapes that maximizes a number of times the mounting head can pick up n components; first folding means for cutting the determined order of components at a central position into a former half and latter half and combining the former half and latter half with component tapes belonging to the former and latter halves in alternating positions; second optimizing means for determining, for all components that use a second feed pitch, an order of component tapes that maximizes a number of times the mounting head can pick up n components; second folding means for cutting the determined order of components at a central position into a former half and latter half and combining the former half and latter half with component tapes belonging to the former and latter halves in alternating positions; and combining means for combining an arrangement of component tapes produced by the first folding step with an arrangement of component tapes produced by the second folding step and setting a result of combining as an optimal arrangement of component tapes.
97. A computer-readable storage medium on which a computer program according to claim 96 is recorded.
98. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that has n nozzles, n being no less than 2, and so can pick up a maximum of n components from an arrangement of component cassettes that hold the components and mount the components on a substrate, the optimizing method optimizing an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, while respecting a restriction whereby only m nozzles out the n nozzles can mount components in a specific region of the substrate, the optimizing method comprising: a component histogram generating step for arranging, in units of component tapes, components that are not arranged in the specific region in descending order of a number of components to be mounted to produce a first component histogram and for arranging, in units of component tapes, components that are arranged in the specific region in descending order of a number of components to be mounted to produce a second component histogram; a cutting down step for repeatedly removing pickup patterns composed of n consecutive components in a horizontal direction from each of the first and second component histograms in order so that components in component tapes with few components to be mounted are removed first, until no more pickup patterns can be removed, and arranging the pickup patterns at corresponding positions on a first coordinate axis and a second coordinate axis; a core crush processing step for arranging, at corresponding positions on the first and second coordinate axes, component tapes in the first and second component histograms after the cutting down step, with an aim of producing a diagram which is n-components wide; and a combining step for combining the component histograms arranged on the first and second coordinate axes by the core crush processing step and setting an arrangement of component tapes that corresponds to a component histogram that results from the combining as the optimal arrangement of component tapes.
99. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that has n nozzles, n being no less than 2, and so can pick up a maximum of n components from an arrangement of component cassettes that hold the components and mount the components on a substrate, the optimizing method optimizing an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, while respecting a restriction whereby only m nozzles out the n nozzles can mount components in a specific region of the substrate, the optimizing method comprising: a provisional optimizing step for determining, for the plurality of components, an arrangement of component tapes so as to maximize a number of times a mounting head can pick up n components, without considering the restriction; and an interchanging step for interchanging each component tape that includes components to be mounted in the specific region with a component tape that (a) has a similar number of components to be mounted, and (b) does not include a component to be mounted in the specific region, and determining an optimal arrangement of cassette tapes based on the arrangement of component tapes after interchanging.
100. An optimizing method that optimizes, using a computer, a component mounting order in which a mounter equipped with a first stage and second stage mounts a plurality of components on a substrate, the first and second stage being independent and each including a mounting head that picks up components from an arrangement of component cassettes that store components and mounts the components on a substrate, the optimizing method assigning component cassettes to the first stage and second stage while respecting a restriction whereby only one of the first and second stages is able to mount components in a specific region of the substrate, the optimizing method comprising: a first assigning step for specifying, for all the components in the mounting order to be optimized, component tapes, a component tape being a group of components of a same type, that include components that can only be mounted by the first stage, and assigning the specified component tapes to the first stage; a second assigning step for specifying, for all the components in the mounting order to be optimized, component tapes that include components that can only be mounted by the second stage, and assigning the specified component tapes to the second stage; and a dividing step for assigning components, for all the components in the mounting order to be optimized, that were not assigned by either the first assigning step or the second assigning step to one of the first and second stages.
101. An optimizing method according to claim 100, wherein the dividing step assigns, to the first stage, components that are mounted in a first region of the substrate which is positioned near the first stage during mounting, and assigns, to the second stage, components that are mounted in a second region of the substrate which is positioned near the first stage during mounting.
102. An optimizing method according to claim 101, wherein the dividing step assigns component tapes to one of the first and second stages so as to make load levels of the first and second stages approximately equal, a load level showing a magnitude of processing for mounting all components assigned to a stage.
103. An optimizing method according to claim 102, wherein the dividing stage assigns as many of the component tapes that were not assigned by either the first assigning step or the second assigning step as possible to the first stage, assigns remaining component tapes to the second stage, and then assigns component tapes to one of the first and second stages so as to make the load levels of the first and second stages approximately equal.
104. An optimizing apparatus that optimizes, using a computer a component mounting order for a mounter equipped with a mounting head that has n nozzles, n being no less than 2, and so can pick up a maximum of n components from an arrangement of component cassettes that hold the components and mount the components on a substrate, the optimizing apparatus optimizing an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, while respecting a restriction whereby only m nozzles out the n nozzles can mount components in a specific region of the substrate, the optimizing apparatus comprising: component histogram generating means for arranging, in units of component tapes, components that are not arranged in the specific region in descending order of a number of components to be mounted to produce a first component histogram and for arranging, in units of component tapes, components that are arranged in the specific region in descending order of a number of components to be mounted to produce a second component histogram; cutting down means for repeatedly removing pickup patterns composed of n consecutive components in a horizontal direction from each of the first and second component histograms in order so that components in component tapes with few components to be mounted are removed first, until no more pickup patterns can be removed, and arranging the pickup patterns at corresponding positions on a first coordinate axis and a second coordinate axis; core crush processing means for arranging, at corresponding positions on the first and second coordinate axes, component tapes in the first and second component histograms after cutting down by the cutting down means, with an aim of producing a diagram which is n-components wide; and combining means for combining the component histograms arranged on the first and second coordinate axes by the core crush processing means and setting an arrangement of component tapes that corresponds to a component histogram that results from the combining as the optimal arrangement of component tapes.
105. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that has n nozzles, n being no less than 2, and so can pick up a maximum of n components from an arrangement of component cassettes that hold the components and mount the components on a substrate, the computer optimizing an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, while respecting a restriction whereby only m nozzles out the n nozzles can mount components in a specific region of the substrate, the computer program causing the computer to function as: component histogram generating means for arranging, in units of component tapes, components that are not arranged in the specific region in descending order of a number of components to be mounted to produce a first component histogram and for arranging, in units of component tapes, components that are arranged in the specific region in descending order of a number of components to be mounted to produce a second component histogram; cutting down means for repeatedly removing pickup patterns composed of n consecutive components in a horizontal direction from each of the first and second component histograms in order so that components in component tapes with few components to be mounted are removed first, until no more pickup patterns can be removed, and arranging the pickup patterns at corresponding positions on a first coordinate axis and a second coordinate axis; core crush processing means for arranging, at corresponding positions on the first and second coordinate axes, component tapes in the first and second component histograms after cutting down by the cutting down means, with an aim of producing a diagram which is n-components wide; and combining means for combining the component histograms arranged on the first and second coordinate axes by the core crush processing means and setting an arrangement of component tapes that corresponds to a component histogram that results from the combining as the optimal arrangement of component tapes.
106. A computer-readable storage medium on which a computer program according to claim 105 is recorded.
107. An optimizing apparatus that optimizes, using a computer, a component mounting order in which a mounter equipped with a first stage and second stage mounts a plurality of components on a substrate, the first and second stage being independent and each including a mounting head that picks up components from an arrangement of component cassettes that store components and mounts the components on a substrate, the optimizing apparatus assigning component cassettes to the first stage and second stage while respecting a restriction whereby only one of the first and second stages is able to mount components in a specific region of the substrate, the optimizing apparatus comprising: first assigning means for specifying, for all the components in the mounting order to be optimized, component tapes, a component tape being a group of components of a same type, that include components that can only be mounted by the first stage, and assigning the specified component tapes to the first stage; second assigning means for specifying, for all the components in the mounting order to be optimized, component tapes that include components that can only be mounted by the second stage, and assigning the specified component tapes to the second stage; and dividing means for assigning component tapes, for all the components in the mounting order to be optimized, that were not assigned by either the first assigning means or the second assigning means to one of the first and second stages.
108. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a first stage and second stage mounts a plurality of components on a substrate, the first and second stage being independent and each including a mounting head that picks up components from an arrangement of component cassettes that store components and mounts the components on a substrate, the computer assigning component cassettes to the first stage and second stage while respecting a restriction whereby only one of the first and second stages is able to mount components in a specific region of the substrate, the computer program causing the computer to function as: first assigning means for specifying, for all the components in the mounting order to be optimized, component tapes, a component tape being a group of components of a same type, that include components that can only be mounted by the first stage, and assigning the specified component tapes to the first stage; second assigning means for specifying, for all the components in the mounting order to be optimized, component tapes that include components that can only be mounted by the second stage, and assigning the specified component tapes to the second stage; and dividing means for assigning component tapes, for all the components in the mounting order to be optimized, that were not assigned by either the first assigning means or the second assigning means to one of the first and second stages.
109. A computer-readable storage medium on which a computer program according to claim 108 is recorded.
110. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method optimizing an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, the optimizing method comprising: a sorting step for arranging, in units of component tapes, the plurality of components to be mounted on a first coordinate axis in descending order of a number of components; and an interchanging step for repeatedly removing component tapes in descending order of components from an arrangement on the first coordinate axis produced in the sorting step and arranging the component tapes on a second coordinate axis that corresponds to an arrangement of component cassettes, wherein the interchanging step (1) arranges a first component tape removed from the arrangement on the first coordinate axis on the second coordinate axis, (2) arranges each of a second to an mth component tape removed from the arrangement on the first coordinate axis on the second coordinate axis at a position that alternates between a start and an end of an arrangement of preceding component tapes on the second coordinate axis, and (3) arranges each component tape from an m+1th component tape onwards on the second coordinate axis at an end of an arrangement of preceding component tapes on the second coordinate axis.
111. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that ordinarily picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method optimizing an order in which the mounting head picks up components from an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, for a case where the mounting head can only pick up m (where 0<m<n) components from the arrangement of component tapes, the arrangement having been optimized under an assumption that the mounting head can pick up n components, the optimizing method comprising: a first repeating step for having the mounting head repeatedly perform pickup operations for the arrangement of component tapes until the mounting head has picked up m components; a second repeating step for having the mounting head mount, on the substrate, the m components picked up in the first repeating step and for having the mounting head repeatedly perform pickup operations for remaining component tapes until the mounting head has picked up m components.
112. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing method optimizing, for a case where there are a plurality of sets of NC (Numeric Control) data corresponding to a plurality of different substrates, an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, the optimizing method comprising: a detecting step for detecting, from all the sets of NC data, each NC data group, an NC data group being a plurality of sets of NC data that have a predetermined resemblance, including a characteristic whereby sets of NC data contain matching types of components; a combining step for combining all sets of NC data in each NC data group to produce a new set of NC data for each NC data group; and an arrangement determining step for determining an optimal arrangement of component tapes for each set of NC data after the combining step, the sets of NC data being arranged in descending order of a number of substrates to be manufactured for each set of NC data, wherein when the arrangement determining step determines an arrangement of component tapes for each set of NC data, matching component tapes that have already been arranged for a previous set of NC data are not arranged again.
113. An optimizing method according to claim 112, wherein the arrangement determining step determines an optimal arrangement for the sets of NC data after the combining step, based on averages of rankings of each component tape in the sets of NC data before the combining step, the rankings being based on numbers of components to be mounted for each component tape.
114. An optimizing method according to claim 112, wherein the arrangement determining step determines an optimal arrangement for the sets of NC data after the combining step, based on a total number of components to be mounted for each component tape in the sets of NC data after combining.
115. An optimizing method according to claim 112, wherein the arrangement determining step determines an optimal arrangement for the sets of NC data after the combining step by giving priority to rankings, based on numbers of components to be mounted, of component tapes in a set of NC data, out of the sets of NC data before combining, for which a highest number of substrates are to be manufactured.
116. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, wherein the mounting head can be fitted with a maximum of n interchangeable nozzles for picking up components, the nozzles being classified into types according to what types of component can be picked up and being provided at specific positions in a fixed arrangement on a nozzle station, the optimizing method comprising: a first judging step for judging, when provided with an arrangement of component tapes, a component tape being a group of components of a same type, whether (a) the mounting head can be fitted at the nozzle station with each type of nozzle required for the component tapes in the given arrangement, and (b) once fitted with the required nozzles, the nozzle head can pick up components from each of the component tapes in the given arrangement; a second judging step for judging that there is a possible mounting order of components only when a judgement in the first judging step is affirmative for every type of nozzle.
117. An optimizing method that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, wherein the mounting head can be fitted with a maximum of n interchangeable nozzles for picking up components, but a number of nozzles that can be used is limited to m, where 0<m<n, the optimizing method comprising: a determining step for determining a pickup order in which the mounting head picks up the plurality of components to be mounted using any of a first nozzle pattern and a second nozzle pattern as a pattern in which nozzles are fitted to the mounting head, the first nozzle pattern being a pattern in which m nozzles are fitted onto the mounting head from one end of a row of positions where the n nozzles can be fitted, and the second nozzle pattern being a pattern in which m nozzles are fitted onto the mounting head from the other end of the row of positions where the n nozzles can be fitted.
118. An optimizing apparatus that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing apparatus optimizing an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, the optimizing apparatus comprising: sorting means for arranging, in units of component tapes, the plurality of components to be mounted on a first coordinate axis in descending order of a number of components; and interchanging means for repeatedly removing component tapes in descending order of components from an arrangement on the first coordinate axis produced by the sorting means and arranging the component tapes on a second coordinate axis that corresponds to an arrangement of component cassettes, wherein the interchanging means (1) arranges a first component tape removed from the arrangement on the first coordinate axis on the second coordinate axis, (2) arranges each of a second to an mth component tape removed from the arrangement on the first coordinate axis on the second coordinate axis at a position that alternates between a start and an end of an arrangement of preceding component tapes on the second coordinate axis, and (3) arranges each component tape from an m+1th component tape onwards on the second coordinate axis at an end of an arrangement of preceding component tapes on the second coordinate axis
119. A mounter that is equipped with (1) an arrangement of component cassettes that hold component tapes, a component tape being a group of components of a same type, and (2) a mounting head that picks up a maximum of n components, n being no less than 2, from the component cassettes and mounts the components on a substrate, wherein the arrangement of component tapes is such that if the component tapes in the arrangement are listed in descending order of numbers of components, a first component tape in the list is at a certain position in the arrangement, a second to mth component tape in the list are at closest unoccupied positions on alternating sides of the first component tape, and the m+1th and following component tapes are at closest unoccupied positions on a same side of the first component tape.
120. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the computer optimizing an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, the computer program causing the computer to function as: sorting means for arranging, in units of component tapes, the plurality of components to be mounted on a first coordinate axis in descending order of a number of components; and interchanging means for repeatedly removing component tapes in descending order of components from an arrangement on the first coordinate axis produced by the sorting means and arranging the component tapes on a second coordinate axis that corresponds to an arrangement of component cassettes, wherein the interchanging means (1) arranges a first component tape removed from the arrangement on the first coordinate axis on the second coordinate axis, (2) arranges each of a second to an mth component tape removed from the arrangement on the first coordinate axis on the second coordinate axis at a position that alternates between a start and an end of an arrangement of preceding component tapes on the second coordinate axis, and (3) arranges each component tape from an m+1th component tape onwards on the second coordinate axis at an end of an arrangement of preceding component tapes on the second coordinate axis
121. A computer-readable storage medium on which a computer program according to claim 120 is recorded.
122. An optimizing apparatus that optimizes, using a computer, a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the optimizing apparatus optimizing, for a case where there are a plurality of sets of NC (Numeric Control) data corresponding to a plurality of different substrates, an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, the optimizing apparatus comprising: detecting means for detecting, from all the sets of NC data, each NC data group, an NC data group being a plurality of sets of NC data that have a predetermined resemblance, including a characteristic whereby sets of NC data contain matching types of components; combining means for combining all sets of NC data in each NC data group to produce a new set of NC data for each NC data group; and arrangement determining means for determining an optimal arrangement of component tapes for each set of NC data after combining by the combining means, the sets of NC data being arranged in descending order of a number of substrates to be manufactured for each set of NC data, wherein when the arrangement determining means determines an arrangement of component tapes for each set of NC data, matching component tapes that have already been arranged for a previous set of NC data are not arranged again.
123. A computer program which, when executed by a computer, has the computer optimize a component mounting order for a mounter equipped with a mounting head that picks up a maximum of n components, n being no less than 2, from an arrangement of component cassettes that hold the components and mounts the components on a substrate, the computer optimizing, for a case where there are a plurality of sets of NC (Numeric Control) data corresponding to a plurality of different substrates, an arrangement of component tapes that are held in the component cassettes in units of component tapes, a component tape being a group of components of a same type, the computer program causing the computer to function as: detecting means for detecting, from all the sets of NC data, each NC data group, an NC data group being a plurality of sets of NC data that have a predetermined resemblance, including a characteristic whereby sets of NC data contain matching types of components; combining means for combining all sets of NC data in each NC data group to produce a new set of NC data for each NC data group; and arrangement determining means for determining an optimal arrangement of component tapes for each set of NC data after combining by the combining means, the sets of NC data being arranged in descending order of a number of substrates to be manufactured for each set of NC data, wherein when the arrangement determining means determines an arrangement of component tapes for each set of NC data, matching component tapes that have already been arranged for a previous set of NC data are not arranged again.
124. A computer-readable storage medium on which a computer program according to claim 123 is recorded.

Priority Claims (3)

Number	Date	Country
2000-237681	Aug 2000	JP
2000-366311	Nov 2000	JP
2001-147566	May 2001	JP

PCT Information

Filing Document	Filing Date	Country	Kind
PCT/JP01/06679	8/2/2001	WO

Method for optimization of an order of component mounting, apparatus using the same, and mounter

Information

Publication Number

Date Filed

Date Published

Inventors

CPC

US Classifications

International Classifications

Abstract

Description

Claims

Priority Claims (3)

PCT Information