Throughput rate optimization in the automated assembly of printed circuit boards
From MaRDI portal
Publication:922276
zbMath0709.90057MaRDI QIDQ922276
Frits C. R. Spieksma, Antoon W. J. Kolen, Yves Cramer, Alwin G. Oerlemans
Publication date: 1990
Published in: Annals of Operations Research (Search for Journal in Brave)
hierarchical schedulingprinted circuit boardsflexible assembly systemsheuristic hiearchical approachplacement of electronic components
Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Mathematical problems of computer architecture (68M07) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Approximation algorithms for multi-dimensional assignment problems with decomposable costs ⋮ Scheduling with resource management in manufacturing systems ⋮ A planning and scheduling model for onsertion in printed circuit board assembly ⋮ Workload planning in small lot printed circuit board assembly ⋮ Scheduling jobs of equal length: Complexity, facets and computational results ⋮ Design of electronic assembly lines: An analytical framework and its application ⋮ A model to optimize placement operations on dual-head placement machines ⋮ Production planning problems in printed circuit board assembly ⋮ Enabling flexibility on a dual head placement machine by optimizing platform-tray-feeder picking operations ⋮ A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool ⋮ Approximation algorithms for three-dimensional assignment problems with triangle inequalities ⋮ An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors ⋮ Geometric three-dimensional assignment problems ⋮ The assembly of printed circuit boards: A case with multiple machines and multiple board types ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ Lower bounds for the axial three-index assignment problem ⋮ Scheduling jobs of equal length: Complexity, facets and computational results
