izpis_h1_title_alt

Razvoj algoritma za določitev urnika preskusov dinamične trdnosti na omejen nabor preskuševališč
ID Litrop, Aljaž (Author), ID Klemenc, Jernej (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (3,69 MB)
MD5: 9F910217867ECD08925FC506DCE54270

Abstract
V sodobnem strojništvu so postale zahteve po kakovosti izdelkov vedno višje. Skladno s tem moramo pred začetkom proizvodnje izdelke temeljito preskusiti, da ugotovimo, če dosegajo vse kupčeve zahteve. Zaradi tega imamo vedno več dinamičnih preskusov, ki se morajo izvesti do določenega časa; slednje ni mogoče, če preskusov ne razporedimo premišljeno glede na število preskuševališč, čas posameznih preskusov, prioritete preskusov, pri tem pa še upoštevamo delovni čas zaposlenih na preskuševališčih. Če vsega tega ne upoštevamo, hitro pride do zamud pri izvajanju preskusov, kar privede do finančnih izgub in zakasnitve v razvojnem procesu. Iz slednjega razloga smo se lotili razvoja programa in algoritma za razporejanje dinamičnih preskusov. Program s pomočjo faktorjev poškodb in lastnostmi preskuševališča generira navidezne preskuse in delovni teden preskuševališča. Z razvitim algoritmom preskuse razporejamo v delovni teden čim bolj optimalno z upoštevanjem omejenega števila preskuševališč in prioritet posameznih preskusov (Eisenhowerjeva matrika). S pomočjo statistične analize se razpored iterativno izpopolnjuje. Rezultat programa za razporejanje dinamičnih preskusov je strukturiran urnik preskusov v uporabniku prijazni obliki.

Language:Slovenian
Keywords:načrtovanje eksperimentov, dinamični preskusi, utrujanje struktur, razvoj algoritma, izdelava programa, Eisenhowerjeva matrika, izdelava urnika, Python
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FS - Faculty of Mechanical Engineering
Place of publishing:Ljubljana
Publisher:[A. Litrop]
Year:2020
Number of pages:XXII, 60 str.
PID:20.500.12556/RUL-118650 This link opens in a new window
UDC:620.17:004.421:658.5((043.2)
COBISS.SI-ID:28360195 This link opens in a new window
Publication date in RUL:29.08.2020
Views:1437
Downloads:235
Metadata:XML RDF-CHPDL DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Secondary language

Language:English
Title:Development of an algorithm for scheduling dynamic strength tests on a limited set of test rigs
Abstract:
In modern mechanical engineering, the requirements for product quality are constantly increasing. Accordingly, the products should be thoroughly tested before production begins to check if all customer requirements are fulfilled. As a result, more and more dynamic tests toned to be performed within prescribed period. This is not possible if the tests are not scheduled wisely according to the number of test rigs, individual test times, test priorities and consideration of person-hours of test rig employees. A planning failure can quickly lead to delays of experiments, financial losses and delays in product development process. For this reason, a program and algorithm for scheduling dynamic tests was developed. Using damage factors and test rig properties, the program generates virtual tests and weekly availabilities of test rig. With the developed algorithm, the tests are arranged according to the test rig working time as optimally as possible by considering a limited number of test rigs and the priorities of the individual tests (Eisenhower matrix). With the help of statistical analysis, the schedule can even be made more exact within a few iterations. The result of the dynamic test-scheduling program is a structured test schedule in a user-friendly format.

Keywords:experiment planning, dynamic strength test, fatigue of structures, algorithm development, programming, Eisenhower matrix, time scheduling, Python

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back