A taboo search heuristic for the optimisation of a multistage component placement system
From MaRDI portal
Publication:5718001
DOI10.1080/09720529.2005.10698038zbMath1135.90435OpenAlexW2056254179MaRDI QIDQ5718001
Gennaro Improta, Emanuele Manni, Gianpaolo Ghiani, Giuseppe Bruno
Publication date: 13 January 2006
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2005.10698038
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Optimization of the movements of a component placement machine
- The assembly of printed circuit boards: A case with multiple machines and multiple board types
- Optimization of printed circuit board manufacturing: Integrated modeling and algorithms
- Probabilistic diversification and intensification in local search for vehicle routing
- Optimal bin location and sequencing in printed circuit board assembly
- Grouping components in printed circuit board assembly with limited component staging capacity and single card setup: Problem characteristics and solution procedures
- 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
- Arc Routing Problems, Part II: The Rural Postman Problem
- Component Fixture Positioning/Sequencing for Printed Circuit Board Assembly with Concurrent Operations
This page was built for publication: A taboo search heuristic for the optimisation of a multistage component placement system
