WO2000011923A2 - Verfahren und vorrichtung zur rechnergestützten pipettenauswahl für einen bestückungskopf - Google Patents
Verfahren und vorrichtung zur rechnergestützten pipettenauswahl für einen bestückungskopf Download PDFInfo
- Publication number
- WO2000011923A2 WO2000011923A2 PCT/DE1999/002536 DE9902536W WO0011923A2 WO 2000011923 A2 WO2000011923 A2 WO 2000011923A2 DE 9902536 W DE9902536 W DE 9902536W WO 0011923 A2 WO0011923 A2 WO 0011923A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- pipette
- types
- type
- components
- component
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K13/00—Apparatus or processes specially adapted for manufacturing or adjusting assemblages of electric components
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K13/00—Apparatus or processes specially adapted for manufacturing or adjusting assemblages of electric components
- H05K13/04—Mounting of components, e.g. of leadless components
- H05K13/0404—Pick-and-place heads or apparatus, e.g. with jaws
- H05K13/0408—Incorporating a pick-up tool
- H05K13/0409—Sucking devices
-
- H—ELECTRICITY
- H05—ELECTRIC TECHNIQUES NOT OTHERWISE PROVIDED FOR
- H05K—PRINTED CIRCUITS; CASINGS OR CONSTRUCTIONAL DETAILS OF ELECTRIC APPARATUS; MANUFACTURE OF ASSEMBLAGES OF ELECTRICAL COMPONENTS
- H05K13/00—Apparatus or processes specially adapted for manufacturing or adjusting assemblages of electric components
- H05K13/08—Monitoring manufacture of assemblages
- H05K13/085—Production planning, e.g. of allocation of products to machines, of mounting sequences at machine or facility level
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10T—TECHNICAL SUBJECTS COVERED BY FORMER US CLASSIFICATION
- Y10T29/00—Metal working
- Y10T29/49—Method of mechanical manufacture
- Y10T29/49002—Electrical device making
- Y10T29/49117—Conductor or circuit manufacturing
- Y10T29/49124—On flat or curved insulated base, e.g., printed circuit, etc.
- Y10T29/4913—Assembling to base an electrical component, e.g., capacitor, etc.
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10T—TECHNICAL SUBJECTS COVERED BY FORMER US CLASSIFICATION
- Y10T29/00—Metal working
- Y10T29/49—Method of mechanical manufacture
- Y10T29/49002—Electrical device making
- Y10T29/49117—Conductor or circuit manufacturing
- Y10T29/49124—On flat or curved insulated base, e.g., printed circuit, etc.
- Y10T29/4913—Assembling to base an electrical component, e.g., capacitor, etc.
- Y10T29/49144—Assembling to base an electrical component, e.g., capacitor, etc. by metal fusion
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10T—TECHNICAL SUBJECTS COVERED BY FORMER US CLASSIFICATION
- Y10T29/00—Metal working
- Y10T29/53—Means to assemble or disassemble
- Y10T29/5313—Means to assemble electrical device
- Y10T29/53174—Means to fasten electrical component to wiring board, base, or substrate
- Y10T29/53178—Chip component
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10T—TECHNICAL SUBJECTS COVERED BY FORMER US CLASSIFICATION
- Y10T29/00—Metal working
- Y10T29/53—Means to assemble or disassemble
- Y10T29/5313—Means to assemble electrical device
- Y10T29/53174—Means to fasten electrical component to wiring board, base, or substrate
- Y10T29/53183—Multilead component
Definitions
- the invention relates to a computer-based pipette selection for a placement head of an automatic placement machine and the assignment of components to the types of pipettes specified in a pipette selection.
- Components e.g. electrical resistors, transistors, capacitors, etc., placed on a circuit board at predetermined positions within the circuit board. This is done in that the components are transported from a component memory to the respective position above the printed circuit board and then set using a mounting head.
- Such a placement head is e.g. the so-called SP head (Speed Placer head), with which several components can be picked up from the component memory, transported and successively placed on the circuit board.
- SP head Speed Placer head
- An SP placement head has several segments (usually 6 or 12 segments), on each of which a pipette can be applied. Components can be picked up and placed with the pipettes. There are different types of pipettes that can be used to set different types of components.
- the assembly of a printed circuit board with components by an SP assembly head usually takes place in several iterations (cycles), in which the assembly head first accepts the maximum number of components that it can process and then in the same order in which it is processed recorded has deposited on the circuit board.
- the time required for a cycle depends only to a small extent on the number of components included and set in this cycle, so that the smallest possible number of cycles for the assembly is the most time-critical criterion in the assembly.
- a method for checking the so-called acyclic hypergraph property is known from [2], which has a linear complexity.
- the invention is based on the problem of specifying a method and a device for selecting an assembly head and a predetermined quantity of components to be placed by it, for selecting the pipettes to be equipped on the assembly head and for assigning the components to the types of pipette that occur in the pipette selection , with or with which an assembly of a printed circuit board with the specified components is achieved with the smallest possible number of cycles.
- the problem is solved by the method with the features according to the independent claims and by the devices with the features according to the independent claims.
- f (p) min ⁇ be B
- the components are successively assigned to the pipette types in an order given by the component type order: there are pipette types for a component type that do not have an arbitrary multiple of the number of cycles z many Construction- elements are already assigned, components are first assigned to these types of pipettes according to the pipette type order in such a way that the number of assigned components is expanded as far as possible to the next multiple of the number of cycles z; Then there are still components of this component type, these are assigned to the last possible pipette type according to the pipette type order, and a number of pipettes to be selected by the pipette type is determined from the number of components assigned to a pipette type.
- Another method for computer-aided pipette selection for a placement head of an automatic placement machine and for the assignment of components to the pipette types specified in a pipette selection at a specified number of cycles z comprises the following step: using
- f (p) min ⁇ b ⁇ B
- the components are successively assigned to the pipette types in an order given by the component type order: there are pipette types for a component type that do not have an arbitrary multiple of the number of cycles z many Components are already assigned, these pipette types are first assigned to components in accordance with the pipette type order in such a way that the number of assigned components is expanded as far as possible to the next multiple of the number of cycles z; If there are still components of this component type, these are assigned to the last possible pipette type according to the pipette type order, and a number of pipettes to be selected by the pipette type is determined from the number of components assigned to a pipette type.
- a device for computer-aided pipette selection for a placement head of an automatic placement machine and for assigning components to the pipette types specified in a pipette selection at a predetermined number of cycles z contains - a memory for storing a component type list B, a pipette type list P, and an assignment list E. , - A processor coupled to the memory, which is set up in such a way that the following steps can be carried out: using
- f (p) min ⁇ be B
- Another device for computer-aided pipette selection for a placement head of an automatic placement machine and for assigning components to the pipette types specified in a pipette selection at a predetermined number of cycles z contains - a memory for storing a component type list B, a pipette type list P, and an assignment list E,
- a processor coupled to the memory, which is set up in such a way that the following steps can be carried out: using a stored component type list B with the associated number of components of the component type to be set,
- b components of the component type list B are designated, - (b, p) e E, b e B, p e P, the case that a
- Component of component type b can be set with a pipette of the pipette type p, in which a pipette type order is formed for the pipette types p e P based on the permissible component type order, such that:
- f (p) min ⁇ b e B
- the invention is characterized in that the assembly of a printed circuit board with predetermined components can be carried out in the smallest possible number of cycles, sometimes even in an optimal number of cycles, which leads to a considerable acceleration of the assembly.
- the method according to claim 2 checks the so-called consecutive ones property of the possible assignments of the components to the respective predetermined types of pipette, ie it examines the question of whether there is a permissible component type order. Preferred developments of the invention result from the dependent claims.
- the solution to be determined can be determined by solving a sequence of flow problems.
- each of a set of pipette types P (b), which can set a component b, is related to the sub-graph of the set of trees, and, if such a set of trees can be determined, pipette types can then be sorted topologically and that Solution to be determined is determined by solving a sequence of flow problems.
- a set of trees with the pipette types as nodes of the trees is determined for possible assignments of the component types to the pipette types according to the assignment list can be such that each subgraph of the set of trees induced by a set of pipette types P (b) which can set a component b is contiguous. If such a quantity of trees cannot be determined, elements are deleted from the assignment list E until such a quantity of trees can be determined.
- the solution to be determined is determined by solving a sequence of flow problems. This training, which no longer guarantees an optimal solution, has shown very good results in practice.
- the river problem can be formed according to the following rules:
- - nfc specifies a number of components of component type b s B to be placed
- a first solution variable x ⁇ p indicates how many components of the component types b e E are set by a pipette of the pipette type p e P.
- Subgraph of the amount of trees is contiguous. If such a quantity of trees cannot be determined, the solution to be determined can be determined by solving a linear program.
- the linear program can be created according to the following rules:
- - nb indicates a number of components of component types b e B to be placed
- a first solution variable x ⁇ p indicates how many components of the component types b e B are set by a pipette of the pipette type p e P,
- a second solution variable yp indicates how many pipettes of the pipette type p e P are selected
- - k denotes a number of segments of the placement head, - x, y> 0, is an integer.
- FIG. 1 shows a flow chart in which the method steps of the exemplary embodiment are shown
- FIG. 2 shows a sketch of an automatic placement machine
- FIGS. 3a and 3b show a sketch of possible assignments of components to types of pipette which fulfill the consecutive ones property
- Figures 5a and 5b show a sketch of possible assignments that meet the acyclic hypergraph property.
- FIG. 2 shows an automatic placement machine 201 with a conveying area 202 which contains conveyors with component memories.
- the component memories contain components which are placed by the placement machine 201 on a circuit board 203 at predetermined placement positions 204.
- the components 205 are picked up by an assembly head - an SP head or an IC head -, transported to the assembly positions and placed on the printed circuit board 203 at the respective assembly position.
- the placement head has segments for receiving pipettes of different types of pipettes p e P, with which different components can be picked up, transported and placed.
- the automatic placement machine 201 has a device 206 with a memory 207 and a processor 208 which is connected to the memory 207.
- a pipette type list P in which the available pipette types are stored.
- An assignment list E which specifies which component types can be set with which pipette types.
- the pipettes to be set up for the assembly of the circuit board 203 on the SP assembly head are determined.
- the assembly head is equipped with the pipettes of the corresponding pipette types, and the circuit board 203 is equipped with the components 205 in accordance with the predefined assembly and the predefined assembly positions 204.
- the assignment list E can be represented in the form of a bipartite graph for easier understanding (see FIGS. 3a and 3b).
- Nodes on the left side of the graph denote component types and nodes on the right side of the bipartite graph denote pipette types. Connections between the nodes of the left and the right side of the graph indicate that a component of the respective component type can be set with a pipette of the respective pipette type.
- An assembly takes place in at least one cycle, with one cycle in each case denoting a pass in which the assembly head picks up, transports a predefinable number, maximum of its capacity, of components and places it at the corresponding, predefined assembly positions 204 of the printed circuit board 203.
- the aim is to keep the number of cycles required for assembly as low as possible.
- the method described below is carried out iteratively for at least a predeterminable number of cycles.
- the method is ended, if no solution is determined, the number of cycles is increased and the method for solving the pipette selection problem is carried out until a number of cycles for which a solution exists has been determined.
- step 101 it is checked for the possible assignments of the component types to the different pipette types whether the consecutive ones property is fulfilled.
- a component type order can be specified on the set of component types, so that applies
- 3a and 3b represent an example of a possible assignment which fulfills the consecutive ones property.
- the component types are arranged in the graph in FIG. 3b such that for all pipette types p e P the component types that can be set with a pipette of the respective pipette type p e P follow one another directly. The consecutive ones property is therefore given.
- the method described in [1] is used, with which a data record can be checked for the consecutive ones property in linear runtime. If the consecutive ones property is present, the method from [1] implicitly returns all permissible orders on the component types.
- step 102 a method which is referred to below as the inverse greedy method and is explained in detail in its method steps is carried out.
- a minimum number of pipettes which is necessary to set all components to be set with z cycles, is determined for a predetermined number of cycles z.
- the corresponding assignments of the components to the pipettes of the different pipette types and the number of pipettes of the respective pipette type pe P are determined. If the number of pipettes required is not greater than the number of segments on the placement head, a solution to the pipette selection problem has been found for z cycles, otherwise there is no such solution.
- f (p) min ⁇ b e B
- FIGS. A and b show the example started in FIGS. 3a and 3b with regard to the pipette type order.
- the pipette types are also suitably arranged.
- step 102 the components are successively assigned to the pipette types in an order given by the component type order:
- the following program section shows a possible implementation of the inverse greedy method in the form of a computer program in the programming language C.
- a first solution variable x ⁇ p, a second solution variable y p , parameters nj- ,, tfc, etc. are denoted in the program section with x [bp], y [p], n [b], t [b] etc.
- t ⁇ by tb max ⁇ pe P
- FIG. 6 a shows the inverse greedy method and the resulting assignment in a graph. The following initial situation is assumed.
- the number at the nodes with which the pipette types are designated in each case indicates the number yp (second solution variable) of the pipettes of the respective pipette type determined by the method.
- the components of the first component type can only be set with pipettes of the first pipette type, as represented by the connection of the two nodes of the graph.
- the components of the second component type can be set using both the first and the second type of pipette.
- Components of the third component type can be set by pipettes of the first as well as the second or the third type of pipette.
- Components of the fourth component type can be set by pipettes of the second type and by pipettes of the third type.
- Components of the fifth component type can only be set using pipettes of the third type.
- the components of the second component type (10 components) are then assigned to the pipettes.
- Four of the 10 components of the second component type are thus assigned to the pipettes of the first pipette type, since when assigning, if possible, the pipettes are “filled” with the components.
- the remaining six components of the second component type are assigned to a pipette of the second type, since one Pipette of the second type of pipette can set a total of six components in the six cycles.
- the components of the third component type (15 components) are assigned to the pipettes.
- the pipettes of the first type of pipette and the second type of pipette are already occupied, so that the 15 components of the third type of component are assigned to pipettes of the third type of pipette. Seven pipettes of the third pipette type are required for this.
- the seven components of the fourth component type and the 20 components of the fifth component type are assigned to pipettes of the third pipette type.
- a total of 7 x 6 42 components can be set with the seven pipettes of the third pipette type. This is exactly the number of components that are to be set by components of the third component type, the fourth component type and the fifth component type.
- step 102 there is a solution for the assignment according to the inverse greedy method (step 102) for 6 cycles and the assembly can be carried out in accordance with this assignment.
- the result of the method is given by the number of pipettes required for the respective pipette types and by the assignment of the components to the pipette types.
- step 101 the consecutive ones property
- step 103 or step 104 one of the variants (step 103 or step 104), which will be explained below, is carried out.
- a first heuristic (step 103), starting from an empty graph, i.e. a lot of component types and pipette types, but without assignments, which trivially fulfills the consecutive ones property, consecutively looks at the individual pipette types pe P and adds as many edges (p, b) e E as possible to the graph, without the consecutive ones -To lose property.
- the inverse greedy method described above is now carried out on the resulting graph, which now contains fewer edges than the original graph, but which fulfills the consecutive ones property.
- step 104 it is also possible to proceed in a further step (step 104) in such a way that the possible assignments are examined for the following property, which is referred to below as the acyclic hypergraph property:
- the pipette types are sorted wopologically according to the forest W, that is, a linear order is determined for the pipette types.
- a method for checking the acyclic hypergraph property is known from [2], which has a linear complexity.
- FIGS. 5a and 5b show, on the one hand, an assignment list E with component types and pipette types (Fig.5a) and a forest with the required properties; the digits define a desired linear order (Fig. 5b).
- step 105 a method described below as the greedy flow method is carried out.
- the pipette selection problem is formulated as a sequence PAP C of flow problems according to the following rules:
- n b specifies a number of the components of the component type be E to be set, Cp, pe P denotes a predefinable barrier, the variation of which forms the sequence of flow problems,
- a first solution variable x b p indicates how many components of the component types be B are set by a pipette of the pipette type pe P.
- step 104 If the check for the acyclic hypergraph property (step 104) gives a negative result, i.e. if the property is not fulfilled, then a method is carried out from two possible methods described below (step 106 or step 107).
- a method is carried out in which edges have been deleted from the assignment graph, so that a forest W with the acyclic hypergraph property can be formed in accordance with the method described above. It is advantageous to ensure that as few edges as possible are deleted. The greedy flow process is then performed on the resulting graph.
- the greedy flow method can be carried out for each linear order on the pipette types P. It is only in the general case that there is no guarantee that there will be no solution if the Greedy Fluß method does not ne solution is found. Nevertheless, very good results are also achieved with the greedy flow method.
- the pipette selection problem can be formulated and solved as an integer linear program or its inadmissibility can be determined.
- the linear program PAP Z is formulated for the pipette selection problem according to the following regulations:
- n specifies a number of the components of the component type be E to be set
- a first solution variable x b p indicates how many components of the component type be B are set by a pipette of the pipette type pe P
- a second solution variable yp indicates how many pipettes of the pipette type p e P are selected, k denotes a number of segments of the placement head,
- the assignment of the components to the pipettes of the different types of pipettes and thus the assignment of the pipettes or types of pipettes is too determined from the placement head, the placement is carried out according to this assignment using the determined pipettes.
- the respective process variant is selected depending on the computing time available for carrying out the process.
Abstract
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/763,460 US6678947B1 (en) | 1998-08-25 | 1999-08-13 | Method and device for computer assisted selection of suction nozzles |
JP2000567063A JP2002524842A (ja) | 1998-08-25 | 1999-08-13 | 自動装着装置の実装ヘッドに対する、コンピュータ支援されたピペット選択、およびピペット選択で設定されるピケット形式への構成素子の割り当てを行う方法および装置 |
DE59911012T DE59911012D1 (de) | 1998-08-25 | 1999-08-13 | Verfahren und vorrichtung zur rechnergestützten pipettenauswahl für einen bestückungskopf und zur zuordnung von bauelementen zu den in einer pipettenauswahl vorgegebenen pipettenarten |
KR1020017002456A KR20010072999A (ko) | 1998-08-25 | 1999-08-13 | 자동 배치 머신의 배치 헤드의 컴퓨터 이용 피펫 선택 및선택된 피펫 타입에 대한 부품 할당을 위한 방법 및 장치 |
EP99952388A EP1116425B1 (de) | 1998-08-25 | 1999-08-13 | Verfahren und vorrichtung zur rechnergestützten pipettenauswahl für einen bestückungskopf und zur zuordnung von bauelementen zu den in einer pipettenauswahl vorgegebenen pipettenarten |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19838595A DE19838595A1 (de) | 1998-08-25 | 1998-08-25 | Verfahren und Vorrichtung zur rechnergestützten Pipettenauswahl für einen Bestückungskopf eines Bestückungsautomaten und zur Zuordnunung von Bauelementen zu den in einer Pipettenauswahl vorgegebenen Pipettenarten |
DE19838595.1 | 1998-08-25 |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2000011923A2 true WO2000011923A2 (de) | 2000-03-02 |
WO2000011923A3 WO2000011923A3 (de) | 2000-04-20 |
Family
ID=7878652
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/DE1999/002536 WO2000011923A2 (de) | 1998-08-25 | 1999-08-13 | Verfahren und vorrichtung zur rechnergestützten pipettenauswahl für einen bestückungskopf |
Country Status (7)
Country | Link |
---|---|
US (1) | US6678947B1 (de) |
EP (1) | EP1116425B1 (de) |
JP (1) | JP2002524842A (de) |
KR (1) | KR20010072999A (de) |
CN (1) | CN1196398C (de) |
DE (2) | DE19838595A1 (de) |
WO (1) | WO2000011923A2 (de) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7546255B2 (en) * | 2000-03-31 | 2009-06-09 | International Business Machines Corporation | Inventory system |
DE102009013353B3 (de) * | 2009-03-16 | 2010-10-07 | Siemens Aktiengesellschaft | Verfahren zur Bestimmung von Rüstungen für konstante Tische von Bestückautomaten |
DE102009039988A1 (de) * | 2009-09-03 | 2011-03-17 | Siemens Aktiengesellschaft | Verfahrwege für Lackierroboter |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0036826A1 (de) * | 1980-03-25 | 1981-09-30 | Eurosoft Robotique | Vorrichtung zur automatischen Herstellung elektronischer Hybridenschaltungen |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3474682B2 (ja) * | 1995-08-07 | 2003-12-08 | 松下電器産業株式会社 | 実装部品振り分け方法及び実装設備 |
JP3504394B2 (ja) * | 1995-09-08 | 2004-03-08 | 松下電器産業株式会社 | 部品配列のデータ作成方法 |
JPH10190299A (ja) * | 1996-12-20 | 1998-07-21 | Matsushita Electric Ind Co Ltd | 電子部品実装ライン及び電子部品実装方法 |
JP3245081B2 (ja) * | 1997-02-04 | 2002-01-07 | 松下電器産業株式会社 | 電子部品実装機 |
-
1998
- 1998-08-25 DE DE19838595A patent/DE19838595A1/de not_active Withdrawn
-
1999
- 1999-08-13 CN CNB998125938A patent/CN1196398C/zh not_active Expired - Fee Related
- 1999-08-13 JP JP2000567063A patent/JP2002524842A/ja active Pending
- 1999-08-13 US US09/763,460 patent/US6678947B1/en not_active Expired - Fee Related
- 1999-08-13 DE DE59911012T patent/DE59911012D1/de not_active Expired - Fee Related
- 1999-08-13 WO PCT/DE1999/002536 patent/WO2000011923A2/de not_active Application Discontinuation
- 1999-08-13 EP EP99952388A patent/EP1116425B1/de not_active Expired - Lifetime
- 1999-08-13 KR KR1020017002456A patent/KR20010072999A/ko not_active Application Discontinuation
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0036826A1 (de) * | 1980-03-25 | 1981-09-30 | Eurosoft Robotique | Vorrichtung zur automatischen Herstellung elektronischer Hybridenschaltungen |
Also Published As
Publication number | Publication date |
---|---|
EP1116425A2 (de) | 2001-07-18 |
CN1324559A (zh) | 2001-11-28 |
KR20010072999A (ko) | 2001-07-31 |
CN1196398C (zh) | 2005-04-06 |
WO2000011923A3 (de) | 2000-04-20 |
EP1116425B1 (de) | 2004-11-03 |
JP2002524842A (ja) | 2002-08-06 |
DE59911012D1 (de) | 2004-12-09 |
DE19838595A1 (de) | 2000-03-23 |
US6678947B1 (en) | 2004-01-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO1990005344A1 (de) | Verfahren zur plazierung von modulen auf einem träger | |
DE1538604B2 (de) | Verfahren zum realisieren einer elektrischen integrierten schaltung | |
DE69532307T2 (de) | Ausdrucks-Propagierung für hierarchisches Netzlisten | |
WO2014005742A1 (de) | Bildung von rüstfamilien auf bestückungslinien | |
DE102012221259A1 (de) | Optimieren von Rüstfamilien | |
DE69721395T2 (de) | Verfahren und Vorrichtung zur Anpassung von Modellen zur Sprecherverifikation | |
DE19703965C1 (de) | Verfahren zur Transformation einer zur Nachbildung eines technischen Prozesses dienenden Fuzzy-Logik in ein neuronales Netz | |
DE10121978B4 (de) | Verfahren zur Zuweisung von Frequenzen zu Basisstationen eines Mobilfunknetzes | |
EP1116425B1 (de) | Verfahren und vorrichtung zur rechnergestützten pipettenauswahl für einen bestückungskopf und zur zuordnung von bauelementen zu den in einer pipettenauswahl vorgegebenen pipettenarten | |
DE4136061A1 (de) | Leiterplatten-pruefsystem | |
DE19963493A1 (de) | Verfahren und System zur Prüfmuster-Erzeugung sowie rechnerlesbares Medium, welches das System zur Durchführung des Verfahrens anweist | |
DE19834620C2 (de) | Verfahren zum Aufrüstung der Bestückungsautomaten einer Bestückungslinie für ein Mix unterschiedlicher Leiterplattentypen | |
DE10206658B4 (de) | Verfahren zum Überprüfen einer integrierten elektrischen Schaltung | |
CH676304A5 (de) | ||
DE102005008345A1 (de) | Verfahren und Vorrichtung, die kontextabhängige Testzahlfaktoren zum Zuweisen von Testzahlen verwenden | |
DE19644680A1 (de) | Verfahren und Vorrichtung zur Handhabung von Kennzeichnungsdaten einer Mehrzahl von Komponenten eines Produktes | |
DE102005008344A1 (de) | Verfahren und Vorrichtung zum Handhaben von Testzahlkollisionen | |
DE2419522A1 (de) | Verfahren und anordnung zur unterteilung eines oder mehrerer nicht benutzter bereiche eines mit einem rechner verbundenen speichers | |
DE19910536A1 (de) | Automatisierungssystem mit aus Modulkomponenten bestehenden Automatisierungsobjekten | |
EP1331794B1 (de) | Verfahren zur Adresszuweisung in einem Netzwerk und Komponenten dafür | |
DE19649692C1 (de) | Verfahren zur Verifikation eines Musterschriftzuges mit Hilfe eines Referenzschriftzugs | |
DE60308325T2 (de) | Informationswegeleitung | |
EP1399856A1 (de) | Verfahren zur zusammenführung verteilter datenbanken | |
EP0598741B1 (de) | Verfahren zum generieren eines referenzstrings | |
DE102005008622A1 (de) | Verfahren und Vorrichtung, die kontextabhängige Testzahlfaktoren zum Zuweisen von Testzahlen verwenden |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 99812593.8 Country of ref document: CN |
|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): CN JP KR SG US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
AK | Designated states |
Kind code of ref document: A3 Designated state(s): CN JP KR SG US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A3 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
WWE | Wipo information: entry into national phase |
Ref document number: 1999952388 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020017002456 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 09763460 Country of ref document: US |
|
WWP | Wipo information: published in national office |
Ref document number: 1999952388 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1020017002456 Country of ref document: KR |
|
WWG | Wipo information: grant in national office |
Ref document number: 1999952388 Country of ref document: EP |
|
WWR | Wipo information: refused in national office |
Ref document number: 1020017002456 Country of ref document: KR |