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

MaRDI QIDQ3540968zbMATH OpenFDO

Authors

Publication date 25 November 2008

zbMATH Keywords

branch-and-bound (B\&B) algorithminteger programmingPCB assemblyplanning and control

Mathematics Subject Classification ID

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

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

Cited in

(9)

• Design of electronic assembly lines: An analytical framework and its application
• A genetic algorithm of determining cycle time for printed circuit board assembly lines
• The simultaneous determination of the assignment of items to resources, the cycle times, and the reorder intervals in repetitive PCB assembly
• An integer programming application to solve sequencer mix problems in printed circuit board production
• Implementing Setup Optimization on the Shop Floor
• scientific article; zbMATH DE number 2062240 (Why is no real title available?)
• Optimal algorithm for minimizing production cycle time of a printed circuit board assembly line
• Optimization of the assignment of circuit cards to assembly lines in electronics assembly
• Integer programming approach to the printed circuit board grouping problem

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)