Minimizing cycle time for PCB assembly lines: An integer programming model and a branch-and-bound approach

zbMATH Open1152.90539MaRDI QIDQ3540968FDOQ3540968

Authors:

Publication date: 25 November 2008

Recommendations

• scientific article; zbMATH DE number 2062240
• A genetic algorithm of determining cycle time for printed circuit board assembly lines
• Optimal algorithm for minimizing production cycle time of a printed circuit board assembly line
• Balancing printed circuit board assembly line systems
• Optimization of the assignment of circuit cards to assembly lines in electronics assembly

zbMATH Keywords

integer programmingPCB assemblyplanning and controlbranch-and-bound (B\&B) algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited In (8)

• Optimal algorithm for minimizing production cycle time of a printed circuit board assembly line
• Integer programming approach to the printed circuit board grouping problem
• Optimization of the assignment of circuit cards to assembly lines in electronics assembly
• Design of electronic assembly lines: An analytical framework and its application
• The simultaneous determination of the assignment of items to resources, the cycle times, and the reorder intervals in repetitive PCB assembly
• A genetic algorithm of determining cycle time for printed circuit board assembly lines
• An integer programming application to solve sequencer mix problems in printed circuit board production
• Title not available (Why is that?)

This page was built for publication: Minimizing cycle time for PCB assembly lines: An integer programming model and a branch-and-bound approach

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