A model to optimize placement operations on dual-head placement machines

Dual-head placement machines are important in the assembly of circuit cards because they offer the capability to place large components accurately. This paper presents a novel column-generation approach for optimizing the placement operations of a dual-head placement machine with the ultimate goal of improving the efficiency of assembly operations. Research objectives are a model that reflects relevant, practical considerations; a solution method that can solve instances within reasonable run times; and tests to establish computational benchmarks. Test results demonstrate the efficacy of our optimization approach on problems of realistic size and scope.

[1]  Martin Desrochers,et al.  A Column Generation Algorithm for the Vehicle Routing Problem with Time Windows , 1992 .

[2]  M. Selim Akturk,et al.  Tool magazine arrangement and operations sequencing on CNC machines , 1996, Comput. Oper. Res..

[3]  Reza H. Ahmadi,et al.  Component Fixture Positioning/Sequencing for Printed Circuit Board Assembly with Concurrent Operations , 1995, Oper. Res..

[4]  Frits C. R. Spieksma,et al.  The component retrieval problem in printed circuit board assembly , 1995 .

[5]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[6]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[7]  Panagiotis Kouvelis,et al.  Staging Problem of a Dual Delivery Pick-and-Place Machine in Printed Circuit Card Assembly , 1994, Oper. Res..

[8]  Frits C. R. Spieksma,et al.  Throughput rate optimization in the automated assembly of printed circuit boards , 1991 .

[9]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

[10]  Dennis Johnson,et al.  Emulating concurrency in a circuit card assembly system , 1991 .

[11]  O. E. Flippo,et al.  The assembly of printed circuit boards : a case with multiple machines and multiple board types , 1995 .

[12]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[13]  Peter I. Cowling,et al.  New models and heuristics for component placement in printed circuit board assembly , 1999, Proceedings 1999 International Conference on Information Intelligence and Systems (Cat. No.PR00446).

[14]  Stephen Grotzinger.  FEEDER ASSIGNMENT MODELS FOR CONCURRENT PLACEMENT MACHINES , 1992 .

[15]  Peter C. Nelson,et al.  Optimization of high-speed multistation SMT placement machines using evolutionary algorithms , 1999 .

[16]  Dennis Johnson,et al.  Component Allocation and Partitioning for a Dual Delivery Placement Machine , 1988, Oper. Res..

[17]  David Simchi-Levi,et al.  On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows , 1997, Oper. Res..

[18]  Wilbert E. Wilhelm,et al.  Optimizing picking operations on dual-head placement machines , 2006, IEEE Transactions on Automation Science and Engineering.

[19]  Wilbert E. Wilhelm,et al.  Process planning for circuit card assembly on a series of dual head placement machines , 2007, Eur. J. Oper. Res..

[20]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[21]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[22]  Frits C. R. Spieksma,et al.  Production planning problems in printed circuit board assembly , 2002, Discret. Appl. Math..

[23]  Ping Ji,et al.  Planning for printed circuit board assembly: the state-of-the-art review , 2001 .

[24]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[25]  Brigitte Jaumard,et al.  A Two-Phase Resource Constrained Shortest Path Algorithm for Acyclic Graphs , 1996 .

[26]  Daniel Mercier,et al.  IC insertion: an application of the travelling salesman problem , 1989 .

[27]  W. Wilhelm,et al.  Prescribing the Content and Timing of Product Upgrades , 2003 .

[28]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[29]  Wilbert E. Wilhelm,et al.  Circuit Card Assembly on Tandem Turret-Type Placement Machines , 2003 .

[30]  Joel G. Siegel,et al.  Information security and data protection , 2001 .

[31]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[32]  Leon F. McGinnis,et al.  AUTOMATED PROCESS PLANNING FOR PRINTED CIRCUIT CARD ASSEMBLY , 1992 .

[33]  Herbert Moskowitz,et al.  Optimization of printed circuit board manufacturing: Integrated modeling and algorithms , 2000, Eur. J. Oper. Res..

[34]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[35]  W. Wilhelm.  A Technical Review of Column Generation in Integer Programming , 2001 .

[36]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[37]  GILBERT LAPORTE,et al.  Exact algorithms for the job sequencing and tool switching problem , 2002 .

[38]  M. Desrochers,et al.  A reoptimization algorithm for the shortest path problem with time windows , 1988 .