A heuristic approach to the scheduling ofautomated packaging systems
Başlık çevirisi mevcut değil.
- Tez No: 723687
- Danışmanlar: PROF. LUCA FERRARİNİ
- Tez Türü: Yüksek Lisans
- Konular: Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrol, Computer Engineering and Computer Science and Control
- Anahtar Kelimeler: Belirtilmemiş.
- Yıl: 2017
- Dil: İngilizce
- Üniversite: Polıtecnıco Dı Mılano
- Enstitü: Yurtdışı Enstitü
- Ana Bilim Dalı: Belirtilmemiş.
- Bilim Dalı: Belirtilmemiş.
- Sayfa Sayısı: Belirtilmemiş.
Özet
Özet yok.
Özet (Çeviri)
Automation engineering becomes increasingly important for humanity. In fact, the growth of population causes an increase of the market demand. Therefore, one of the main objectives is the search for an increase in productivity and efficiency of automated production plants. However, the greater the productivity target, the greater the design complexity of the production systems and their components. With the passing of time, new solutions are born and engineering efforts must be focused on new problems. Pick and place robotic packaging systems live in this context. These systems use robots which allows packaging the products in their respective confusions. Therefore, a control problem arises that consists in the allocation of the tasks of the robots. This allocation problem is complicated by increasing the number of constraints to be respected, many of which derive from the upstream and downstream processes of the system. The constraints in the packaging systems can derive from the production specifications (production rate, constraint of fully filled boxes, multi-pick packaging), the problems of electromechanical systems (conveyor belts, robots) or product problems (fragility, maximum permanence at room temperature). For many systems, it is necessary to solve a combinatorial assignment problem with the purpose to find a list of activities to perform (concerning products, boxes and robot missions). In this work, a heuristic approach is presented in order to reduce the number of unpackaged products and find the assignments that make the plant more efficient. Based on this approach, two different assignment algorithms are born. The first algorithm is greedy, while the second is cyclic. Subsequently, improvements are proposed to these two algorithms. The starting point is the modeling of all the components of the system. Next, a quality evaluation algorithm of a partial or complete assignment is presented. Thanks to its reference implementation, the reliability of the algorithm has been verified by different methods. Finally, the set of systems treated with the introduction of robots capable of carrying out multi-task missions is extended. In the last part of the thesis, the heuristic approach to the problem of planning analyzed is discussed.
Benzer Tezler
- Uzman sistem teknolojisi ve çizelgeleme uygulaması
The technology of expert system and applications of scheduling
TARIK ÇAKAR
Yüksek Lisans
Türkçe
1991
Bilgisayar Mühendisliği Bilimleri-Bilgisayar ve Kontrolİstanbul Teknik ÜniversitesiY.DOÇ.DR. ORHAN KURUÜZÜM
- Esnek üretim sistemlerinin kilitlenmesiz çizelgelenmesinde petri ağlarına dayanan sezgisel bir çözüm yaklaşımı
A petri net based heuristic approach for deadlock-free scheduling in flexible manufacturing systems
YASEMİN YAVUZ
- Çok objektifli esnek atölye çizelgeleme problemlerinin sezgisel yöntemlerle modellenmesi, analizi ve çözümü
Modeling, analyzing and solving multiple-objective flexible job-shop scheduling problems by using meta-heuristic algorithms
LALE ÖZBAKIR
- Optimizing an F-16 squadron weekly pilot schedule for the Turkish Air Force
Başlık çevirisi yok
MURAT YAVUZ
Yüksek Lisans
İngilizce
2010
Savunma ve Savunma TeknolojileriAır Force Instıtute Of Technology (afıt)DR. JAMES T. MOORE
- U-Mut: autolisple bilgisayar destekli uzman-mutfak tasarımı
U-Mut: a computer aided expert-kitchen design written in autolisp
MANOLYA KAVAKLI