Optimal bin location and sequencing in printed circuit board assembly

DOI10.1016/0377-2217(93)90217-BzbMath0771.90060MaRDI QIDQ2367380

Horst W. Hamacher, Les R. Foulds

Publication date: 23 August 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

traveling salesmansequencingefficient production of printed circuit boardsone-facility location modelsoptimal bin locations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Production models (90B30) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (12)

Combinatorial algorithms for some 1-facility median problems in the plane ⋮ The quadratic assignment problem in the context of the printed circuit board assembly process ⋮ Unnamed Item ⋮ Location and layout planning. A survey ⋮ Product location, allocation and server home base location for an order picking line with multiple servers. ⋮ Planar weber location problems with line barriers ⋮ A taboo search heuristic for the optimisation of a multistage component placement system ⋮ Multicommodity flows and Benders decomposition for restricted continuous location problems ⋮ The optimisation of the single surface mount device placement machine in printed circuit board assembly: a survey ⋮ Production planning problems in printed circuit board assembly ⋮ Unnamed Item ⋮ The assembly of printed circuit boards: A case with multiple machines and multiple board types

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of the movements of a component placement machine
• Combinatorial algorithms for some 1-facility median problems in the plane
• Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel

This page was built for publication: Optimal bin location and sequencing in printed circuit board assembly