Annealing method for PCB assembly scheduling on two sequential machines
- 1 November 1992
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Integrated Manufacturing
- Vol. 5 (6) , 361-367
- https://doi.org/10.1080/09511929208944543
Abstract
Modern electronic printed circuit board assembly (PCB) typically employs specialized component insertion machines, in a flow-shop-type facility. Since the mix of boards on production utilizes more component types than the machines contain, there is a sequence-dependent set up time between the board types. The setup time is very significant relative to the fast insertion operation. This paper demonstrates the simulated annealing approach as a tool for sequencing the boards on two sequential insertion machines, in order to minimize the average flow time of the boards. This approach is experimented on a real industrial problem and its results and computation times are presented.Keywords
This publication has 7 references indexed in Scilit:
- A simulated annealing approach to scheduling a manufacturing cellNaval Research Logistics (NRL), 1990
- A controlled search simulated annealing method for the single machine weighted tardiness problemAnnals of Operations Research, 1989
- A LISP-based heuristic scheduler for automatic insertion in electronics assemblyInternational Journal of Production Research, 1986
- Convergence of an annealing algorithmMathematical Programming, 1986
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis AlgorithmSIAM Review, 1984
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953