• Nie Znaleziono Wyników

A handheld maintenance application for belt conveyors (summary)

N/A
N/A
Protected

Academic year: 2021

Share "A handheld maintenance application for belt conveyors (summary)"

Copied!
1
0
0

Pełen tekst

(1)

Delft University of Technology

Faculty Mechanical, Maritime and Materials Engineering Transport Technology

W.M. de Gijt A handheld maintenance application for belt conveyors

Computer program, Report 2005.TL.6965, Transport Engineering and Logistics.

When an inspector performs an inspection usually also paper work has to be done. Nowadays many companies use a kind of CMMS (Computerized Maintenance Management System). Therefore all the paper work needs to be put in the system, that of course takes time.

The time problem raises a question: 'Is it possible to avoid the paper work?' The solution handled in this report is one of the possible solutions. The solution handled in this report is the usage of handheld devises which are able to store the inspection data digitally. This makes it easy to get the data in, for instance, a CMMS.

This report determines the needs of an application which makes it possible to store the data in a structured way. The most important requirement of such an application is that it must be flexible. Flexible in this case means that it must be possible to change input data. This requirement is fulfilled; it is even possible to use the application for a different object other than the belt of a belt conveyor.

As a result of this report a working demo of the application is prepared. The demo can be used in the field for extensive testing. The demo application however is not completely developed. Several minor things still need to be implemented.

The most important part which has not been implemented now is the location check with new and old damages. This will be a valuable upgrade of the application so an inspector will not miss a previous recorded damage.

Reports on Transport Engineering and Logistics (in Dutch)

Cytaty

Powiązane dokumenty

The major technical result which we obtain is of indepen- dent interest, and it states, in particular, that whenever a locally minimal group G having no small normal subgroups (in

This abstract result provides an elementary proof of the existence of bifurcation intervals for some eigenvalue problems with nondifferentiable nonlinearities1. All the results

4.5.. Denote this difference by R.. In a typical problem of combinatorial num- ber theory, the extremal sets are either very regular, or random sets. Our case is different. If A is

The new tool here is an improved version of a result about enumerating certain lattice points due to E.. A result about enumerating certain

The purpose of this section is to develop the method of proof of Theorem 2 and prove the following theorem..

In Section 3 we for- mulate and prove a theorem on the existence and uniqueness for the linear problem which is the same as Theorem 1 of [3] but the proof is slightly

We show that a generalized upper and lower solution method is still valid, and develop a monotone iterative technique for finding minimal and maximal solutions.. In our situation,

The method presented here is the key to the inductive construction of theorems on the higher order regularity of the solution of the problem (1), (2) with respect to the parameter