Show simple item record

dc.contributor.authorYildirim, Mehmet Bayram
dc.contributor.authorDuman, Ekrem
dc.contributor.authorDuman, Dilek
dc.contributor.authorCetinkaya, Coskun
dc.date.accessioned2011-03-22T19:15:16Z
dc.date.available2011-03-22T19:15:16Z
dc.date.issued2007-09
dc.identifier.issn1796-203X
dc.identifier.urihttp://hdl.handle.net/10057/3439
dc.identifier.urihttp://dx.doi.org/10.4304/jcp.2.7.11-19
dc.description.abstractAlthough the use of electronic component placement machines has brought reliability and speed to the printed circuit board (PCB) assembly process, to get higher utilization, one needs to solve the resulting complex operations research problems efficiently. In this study, the problem of distributing the assembly workload to two machines deployed on an assembly line with two identical component placement machines to minimize the line idle time is considered. This problem is NP-Complete even in its simplest form. A mathematical model and several heuristics have been proposed to solve this problem efficiently.en_US
dc.language.isoen_USen_US
dc.publisherAcademy Publisheren_US
dc.relation.ispartofseriesJOURNAL OF COMPUTERS, VOL. 2, NO. 7, SEPTEMBER 2007;
dc.subjectPrinted Circuit Board Assemblyen_US
dc.subjectLoad balancingen_US
dc.subjectHeuristicsen_US
dc.titleAllocation of component types to machines in the automated assembly of printed circuit boardsen_US
dc.typeArticleen_US


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record