Publication:
Assembly time minimization of a particular placement machine

Simple item page
dc.contributor.authorsAlkaya, Ali Fuat; Duman, Ekrem
dc.contributor.editorDemiralp, M
dc.contributor.editorUdriste, C
dc.contributor.editorBognar, G
dc.contributor.editorSoni, R
dc.contributor.editorNassar, H
dc.date.accessioned2022-03-12T15:59:55Z
dc.date.accessioned2026-01-11T15:15:03Z
dc.date.available2022-03-12T15:59:55Z
dc.date.issued2007
dc.description.abstractA new algorithm for a component placement machine is proposed in this study. The new algorithm is compared with former approaches on synthetically generated benchmark instances. It outperforms the former approaches by 3.28% on printed circuit board with 100 components to be placed. We prove that this new approach works better in a typical PCB mounted in the industry, so can be applicable to the considered type of machine.
dc.identifier.doidoiWOS:000252771600064
dc.identifier.isbn978-960-6766-27-5
dc.identifier.urihttps://hdl.handle.net/11424/224545
dc.identifier.wosWOS:000252771600064
dc.language.isoeng
dc.publisherWORLD SCIENTIFIC AND ENGINEERING ACAD AND SOC
dc.relation.ispartofAPPLIED MATHEMATICS FOR SCIENCE AND ENGINEERING
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectprinted circuit board assembly
dc.subjecttraveling salesman problem
dc.subjectplacement machine
dc.titleAssembly time minimization of a particular placement machine
dc.typeconferenceObject
dspace.entity.typePublication
oaire.citation.endPage+
oaire.citation.startPage383
oaire.citation.titleAPPLIED MATHEMATICS FOR SCIENCE AND ENGINEERING

Files

Collections

Araştırma Çıktıları