Optimization of printed circuit board manufacturing: Integrated modeling and algorithms
From MaRDI portal
Publication:1577779
DOI10.1016/S0377-2217(99)00169-1zbMath0967.90034OpenAlexW2059063909MaRDI QIDQ1577779
Kemal Altinkemer, Burak Kazaz, Herbert Moskowitz, Murat M. Köksalan
Publication date: 4 September 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00169-1
optimizationprinted circuit board\(\varepsilon\)-approximation algorithmintegrated optimization problem
Related Items
A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines ⋮ Efficient operation methods for a component placement machine using the patterns on printed circuit boards ⋮ Minimizing the assembly cycle time on a revolver gantry machine ⋮ Process planning for circuit card assembly on a series of dual head placement machines ⋮ Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees. ⋮ Component scheduling for chip shooter machines: A hybrid genetic algorithm approach. ⋮ A model to optimize placement operations on dual-head placement machines ⋮ A taboo search heuristic for the optimisation of a multistage component placement system ⋮ 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 ⋮ Enabling flexibility on a dual head placement machine by optimizing platform-tray-feeder picking operations ⋮ An adaptive memory programming method for risk logistics operations ⋮ PCB assembly scheduling for collect-and-place machines using genetic algorithms ⋮ A note on a motion control problem for a placement machine
Uses Software
Cites Work
- Unnamed Item
- Optimization of the movements of a component placement machine
- Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees.
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Optimal Routing under Capacity and Distance Restrictions
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Topological design of centralized computer networks—formulations and algorithms
- Parallel Savings Based Heuristics for the Delivery Problem
- Routing Printed Circuit Cards Through an Assembly Cell
- Staging Problem of a Dual Delivery Pick-and-Place Machine in Printed Circuit Card Assembly
- Printed circuit board family grouping and component allocation for a multimachine, open-shop assembly cell
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- Component Fixture Positioning/Sequencing for Printed Circuit Board Assembly with Concurrent Operations