A Multi-Exchange Neighborhood Search Heuristic for an Integrated Clustering and Machine Setup Model for PCB Manufacturing
Name
OR-352-01.pdf
Size
1.86 MB
Format
Adobe PDF
Checksum (MD5)
5e4357a5cd228e552ae6deabb0d93b31
Author(s)
Magazine, Michael J.
Polak, George G.
Sharma, Dushyant
Date Issued
March 2001
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 352-01
Abstract
In the manufacture of printed circuit boards, electronic components are attached to a blank board by one or more pick-and-place machines. Frequent machine setups, though time consuming, can reduce overall processing time. We consider the Integrated Clustering and Machine Setup (ICMS) model, which incorporates this tradeoff between processing time and setup time and seeks to minimize the sum of the two. Solving this model to optimality is intractable for very large-scale instances. We show that ICMS is NP-hard and consequently propose and test a heuristic based on multi-exchange neighborhood search structures. Initial numerical results are very encouraging. Keywords: Printed circuit board assembly, feeder slot assignment, product clustering, integer programming, computational complexity, heuristics.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
