Routing Printed Circuit Cards Through an Assembly Cell

DOI10.1287/OPRE.39.6.992MaRDI QIDQ4006342zbMATH OpenOpenAlexFDO

Authors Christopher B. Lofgren, Leon F. McGinnis, Craig A. Tovey

Publication date 26 September 1992

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.39.6.992

Mathematics Subject Classification ID

General theory of computer systems (68M01) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Production models (90B30) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Cited in

(7)

• 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
• Optimization of printed circuit board manufacturing: Integrated modeling and algorithms
• A planning and scheduling model for onsertion in printed circuit board assembly
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
• Production planning problems in printed circuit board assembly
• A note on the precedence-constrained class sequencing problem

This page was built for publication: Routing Printed Circuit Cards Through an Assembly Cell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4006342)