Elektronik dizgi işlemlerinin eniyilenmesi ve değişken maliyetli seyyar satıcı problemi

Duman, Ekrem (Dogus Author)Bu projede baskılı devre kartları (BDK) dizgi işlemlerinde ortaya çıkan yeni bir gezgin satıcı problemi (GSP) üzerinde çalışmalar yapılmış, sıraya dayalı GSP adı verilen bu problemin önce matematiksel modeli geliştirilmiş daha sonra onu çözecek özgün yöntemler geliştirilmiştir. Bunun dışında, bu problemin görüldüğü iki tip dizgi makinesinin diğer ilgili optimizasyon problemleri (karesel atama problemi - KAP) de çözülerek toplam dizgi süreleri enazlanmıştır. KAP ve problemin bütününün çözümlerinde metasezgisel yöntemlerden yararlanılmıştır.Doğuş Üniversitesi; TÜBİTA

Baskı devre kartı dizgi atölyelerinde hat dengeleme

In assembling printed circuit boards (PCB), the use of numerically or computer controlled electronic component placement machines has become quite popular in the last decades. However, serious operations research problems arise through their use such as, allocation of component types to machines, board production schedule, feeder configuration and placement sequencing. In this study, the problem of allocation of component types to machines is taken up where two non-identical machines are deployed serially on a line to complete the assembly process of PCBs. For the solution of this problem three heuristic algorithms are suggested and their performances are investigated on experimental data.Son yıllarda baskı devre kartlarının (BDK) dizgisinde nümerik veya bilgisayar kontrollü elektronik dizgi makinalarının kullanımı yaygın hale gelmiştir. Ancak, bu beraberinde komponent tiplerinin makinalara atanması, kart üretim çizelgelemesi, besleyici düzeni ve dizgi sırası gibi karmaşık yöneylem araştırması problemlerini getirmiştir. Bu çalışmada, birbirinden farklı iki makinanın aynı hatta olması durumu için komponentlerin makinalara atanması problemi ele alınmıştır. Bu problemin çözümü için üç ayrı sezgisel algoritma geliştirilmiş ve performansları örnek veriler üzerinde incelenmiştir

Workload Balancing in Printed Circuit Board Assembly Shops

Son yıllarda baskı devre kartlarının (BDK) dizgisinde nümerik veya bilgisayar kontrollü elektronik dizgi makinalarının kullanımı yaygın hale gelmiştir. Ancak, bu beraberinde komponent tiplerinin makinalara atanması, kart üretim çizelgelemesi, besleyici düzeni ve dizgi sırası gibi karmaşık yöneylem araştırması problemlerini getirmiştir. Bu çalışmada, birbirinden farklı iki makinanın aynı hatta olması durumu için komponentlerin makinalara atanması problemi ele alınmıştır. Bu problemin çözümü için üç ayrı sezgisel algoritma geliştirilmiş ve performansları örnek veriler üzerinde incelenmiştir.In assembling printed circuit boards (PCB), the use of numerically or computer controlled electronic component placement machines has become quite popular in the last decades. However, serious operations research problems arise through their use such as, allocation of component types to machines, board production schedule, feeder configuration and placement sequencing. In this study, the problem of allocation of component types to machines is taken up where two non-identical machines are deployed serially on a line to complete the assembly process of PCBs. For the solution of this problem three heuristic algorithms are suggested and their performances are investigated on experimental data

Workload Balancing in Printed Circuit Board Assembly Shops

Son yıllarda baskı devre kartlarının (BDK) dizgisinde nümerik veya bilgisayar kontrollü elektronik dizgi makinalarının kullanımı yaygın hale gelmiştir. Ancak, bu beraberinde komponent tiplerinin makinalara atanması, kart üretim çizelgelemesi, besleyici düzeni ve dizgi sırası gibi karmaşık yöneylem araştırması problemlerini getirmiştir. Bu çalışmada, birbirinden farklı iki makinanın aynı hatta olması durumu için komponentlerin makinalara atanması problemi ele alınmıştır. Bu problemin çözümü için üç ayrı sezgisel algoritma geliştirilmiş ve performansları örnek veriler üzerinde incelenmiştir.In assembling printed circuit boards (PCB), the use of numerically or computer controlled electronic component placement machines has become quite popular in the last decades. However, serious operations research problems arise through their use such as, allocation of component types to machines, board production schedule, feeder configuration and placement sequencing. In this study, the problem of allocation of component types to machines is taken up where two non-identical machines are deployed serially on a line to complete the assembly process of PCBs. For the solution of this problem three heuristic algorithms are suggested and their performances are investigated on experimental data

Automated assembly of printed circuit boards: iterative solution of placement sequencing and feeder configuration problems

In automated assembly of printed circuit boards, the placement sequencing and feeder configuration problems turns out to be two of the four major problems that need to be solved efficiently to get better utilization from the use of computer controlled electronic component placement machines. The forms of these problems may show variability depending on the architecture of the placement machine used. In this study one of such machine architectures is undertaken where the most difficult combination of placement sequencing and feeder configuration problems is faced. Given a placement sequencing problem, the feeder configuration problem turns out to be a quadratic assignment problem, and given a feeder configuration the placement sequencing problem turns out to be a traveling salesman problem. However these two problems are highly interdependent and as the overall solution is intractable a sequential and iterative solution procedure is suggested. The proposed solution procedure is applied to test problems in real printed circuit board assembly environments.Yazar Sürüm

Allocation of component types to machines in the automated assembly of printed circuit boards

Duman, Ekrem (Dogus Author) -- An earlier version of this paper which has been presented at ISCIS'06: The 21st International Symposium on Computer and Information Sciences, November 1-3, 2006 Istanbul, Turkey, has been published in Lecture Notes in Computer Science [18].Although 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

The Place of Intelligence Games in Philosophy and Logic Education

Education is an applied field of science and so what is expected is that it must respond to the practical needs besides theoretical field. These needs are of importance with the indication of active nature of students in learning in 21st century. For that reason, it has started to give places for many applications in practice to increase the permeance of information by internalizing the theoretical side of education. One of the applications in question is intelligence games. Intelligence games is a tool for individuals in revealing their own potentials, in developing different and original strategies for the problems, in making a fast and true decision, and what is more in making them attain a systematic structure of thinking. Therefore, it would not be surprising to associate this tool with the education of philosophy and logic. It is because intelligence games are a material to be used in philosophy education in using philosophical knowledge and seeking for the solutions of philosophical problems; in using logic education in conveying true thinking ways to daily life, being aware of contradictions by thinking consistently and basing their thoughts. As a result, it is believed that intelligence games will make the theoretical-based structure practical in philosophy and logic education and will add variety with the current study

Operations sequencing in a cable assembly shop

The need for a better, compact and neat solution in the cable systems used by the automotive industry resulted in emerge of companies specialized in producing such cable systems. The present study is an extension of the work that was carried out for one such company. One of the main operations in the production of cable systems is the attachment of the connectors to the ends of the cables. This process is composed of cutting, stripping and crimping the cable ends. These operations are to be performed for each connecter attachment. Each connector type requires a different head for the crimping operation. Thus, the required setup time is doubled if the heads for both ends of the cable should be changed. The problem in hand is a TSP where the distances between the nodes are either one or two. An effective and simple heuristic algorithm is developed that yields either an optimum solution or one that is off by a few percent. Among nine experiments six resulted with optimum solution while the others deviated from the optimum at most one percent

An Investigation into the Logic Textbooks Written in Accordance with the 2009 Logic Curriculum

Textbooks have attained an essential position with the student-centered approach. Accordingly, curricula are developed based largely on constructivist approach. Since textbooks are prepared in accordance with the curriculum, they are therefore constructivist approach-oriented. As a result, textbooks are the reflection of the curriculum. The mistakes in textbooks can directly affect learning in a negative manner. Additionally, the visuals, reading texts, preparation and evaluation questions in textbooks should be on a par with the outcomes in the curriculum in regard to level and structure. In this study, three of the textbooks written in accordance with the 2009 logic course curriculum were examined in terms of physical features, distribution by units, their congruence to the curriculum, language and expression, scientific content, print-typesetting-orthography, reading texts, preparation and evaluation questions, and bibliography. From this aspect, this study is qualitative. Document review method was adopted in this study. It was discovered that the evaluation questions in the textbooks framed to measure the outcomes were under the outcome levels. To exemplify, the questions taxonomically at the evaluation level were found to be corresponding to the knowledge and comprehension levels, it was further explored that most errors were detected in the elements of print-typesetting-orthography