Show simple item record

dc.contributor.authorYildirim, Mehmet Bayram
dc.contributor.authorDuman, Ekrem
dc.contributor.authorDuman, Dilek
dc.date.accessioned2011-03-22T20:23:17Z
dc.date.available2011-03-22T20:23:17Z
dc.date.issued2006
dc.identifier.issn0956-5515
dc.identifier.urihttp://hdl.handle.net/10057/3444
dc.descriptionThis is the author's version of the article. The final publication is available at www.springerlink.com
dc.description.abstractIn this paper, we propose a model and algorithms to solve a load balancing problem on a printed circuit board assembly line. On this line of two identical machines, the problem of allocation of component types to machines is analyzed in detail. Twenty eight dispatching rules are developed and extensive computational experimentation is performed. It has been observed that the imbalance per board increases as a function of the number of board types. Furthermore, the greedy dispatching rules perform better than the construction dispatching rules.en_US
dc.language.isoen_USen_US
dc.publisherSpringer Verlagen_US
dc.subjectPrinted Circuit Board Assemblyen_US
dc.subjectLoad balancingen_US
dc.subjectHeuristicsen_US
dc.titleDispatching rules for allocation of component types to machines in the automated assembly of printed circuit boardsen_US
dc.typeArticleen_US
dc.description.versionPeer reviewed article


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record