| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 8 / 8
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
2.
Implementation of hard real-time embedded control systems
Matjaž Colnarič, Domen Verber, Roman Gumzej, Wolfgang A. Halang, 1998, samostojni znanstveni sestavek ali poglavje v monografski publikaciji

Opis: Although the domain of hard real-time systems has been thoroughly elaborated in the academic sphere, embedded computer control systems - being an important in mechatronic design - are seldom dealt with consistemntly. Often, off-the-shelf computer systems are used, with no guarantee that they will be able to meet the requirements specified. In this paper, a design for embedded control systems is presented. particulary, the paper deals with the hardware architecture and design details, the operating sustem, and the high-level real-time language support. It is shown how estimates of process run-times necessary for schedulability analysis can be acquired on the basis of deterministic behavior of the hardware platform.
Ključne besede: kontrolni sistemi, realni čas, mikrokontrolerji, programski jeziki, embedded compuer control systems, hard real-time systems, microcontrollers, transputers, earliest-deadline-first scheduling, real-time programming languages
Objavljeno: 10.07.2015; Ogledov: 481; Prenosov: 66
URL Povezava na celotno besedilo

3.
Co-processor for microkernel OS services
Domen Verber, 2011, objavljeni znanstveni prispevek na konferenci

Ključne besede: operating systems, embedded systems, real time, task scheduling, FPGA
Objavljeno: 10.07.2015; Ogledov: 393; Prenosov: 62
URL Povezava na celotno besedilo

4.
Development of a web application for dynamic production scheduling in small and medium enterprises
Davorin Kofjač, Andrej Knaflič, Miroljub Kljajić, 2010, izvirni znanstveni članek

Opis: This article describes the development of a web-based dynamic job-shop scheduling system for small and medium enterprises. In large enterprises, scheduling is mainly performed with appropriate technology by human experts; many small and medium enterprises lack the resources to implement such a task. The main objective was to develop a cost-effective, efficient solution for job-shop scheduling in small and medium enterprises with an emphasis on accessibility, platform independence and ease of use. For these reasons, we decided to develop a web-based solution with the main emphasis on the development of an intelligent and dynamic user interface. The solution is built upon modular programming principles and enables dynamic scheduling on the basis of artificial intelligence, i.e. genetic algorithms. The solution has been developed as a standalone information system, which allows the management of virtually all scheduling activities through an administration panel. In addition, the solution covers the five main functionalities that completely support the scheduling process, i.e. making an inventory of resources available in the company, using it in the process of production planning, collecting data on production activities, distribution of up-to-date information and insight over events in the system.
Ključne besede: dynamic job-shop scheduling, genetic algorithms, web application development
Objavljeno: 10.07.2015; Ogledov: 749; Prenosov: 243
.pdf Celotno besedilo (674,01 KB)
Gradivo ima več datotek! Več...

5.
Cost optimal project scheduling
Uroš Klanšek, Mirko Pšunder, 2008, izvirni znanstveni članek

Opis: This paper presents the cost optimal project scheduling. The optimization was performed by the nonlinear programming approach, NLP The nonlinear total project cost objective function is subjected to the rigorous system of the activity preceden- ce relationship constraints, the activity duration constraints and the project duration constraints. The set of activity precedence relationship constraints was defined to comprise Finish-to-Start, Start-to-Start, Start-to-Finish and Finish-to-Finish precedence relationships between activities. The activity duration constraints determine relationships between minimum, maximum and possible duration of the project activities. The project duration constraints define the maximum feasible project duration. A numerical example is presented at the end of the paper in order to present the applicability of the proposed approach.
Ključne besede: project management, scheduling, optimization, nonlinear programming, NLP
Objavljeno: 10.07.2015; Ogledov: 721; Prenosov: 208
.pdf Celotno besedilo (444,81 KB)
Gradivo ima več datotek! Več...

6.
Mixed-integer nonlinear programming based optimal time scheduling of construction projects under nonconvex costs
Rok Cajzek, Uroš Klanšek, 2016, izvirni znanstveni članek

Opis: Optimal project scheduling under nonconvex time-cost relations represents a challenging problem in construction management. The nonconvex time-cost relations may appear in a construction project when several different duration options are available for its activities due to alternative technological processes enabled for their realization or wide accessibility of production resources. The source of nonconvexity of the project scheduling optimization problem can also be the project penalty- or bonus-duration relations arranged within the construction contract. The aim of this paper is to present the mixed-integer nonlinear programming (MINLP) based optimal time scheduling of construction projects under nonconvex costs. For this purpose, the MINLP model was developed and applied. A numerical example from literature and an example of construction project time-cost trade-off analysis under practical nonconvex penalty function are given in the paper to demonstrate advantages of MINLP optimization. The example from literature first presented the capability of the MINLP approach to obtain the optimal solution for difficult, highly combinatorial nonconvex discrete project scheduling problem. Thereupon, the following example revealed that the optimal project time-cost curve may take very nonuniform shape on account of discrete nature of activity direct cost options and nonconvex relation between project duration and total cost. In this way, the presented study intends to provide practitioners with new information from the field of optimization techniques for project scheduling as well as an alternative view on performance of total cost when project duration is changed.
Ključne besede: extreme environments, construction management, discrete optimization, mixed-integer nonlinear programming, nonconvex costs, time scheduling
Objavljeno: 12.07.2017; Ogledov: 438; Prenosov: 245
.pdf Celotno besedilo (807,33 KB)
Gradivo ima več datotek! Več...

7.
Implementation of the scheduling domain description model
Alenka Baggia, Robert Leskovar, Miroljub Kljajić, 2008, izvirni znanstveni članek

Opis: This paper presents the problem of auniform scheduling domain description. It was established that the algorithm used for scheduling is general, disregarding the type of scheduling domain. On the basis of five different scheduling domains, a general description model was developed. The research is focused on the programming application of the resource scheduling model, presented as a UML class diagram. Diverse meta-languages for the model description were considered. Of these XML, an EAV model and object oriented languages have shown to be the most effective. Even though Java is not widely used as a description language, it has proved effective as a meta-language for the description of the extensible scheduling model.
Ključne besede: scheduling, domain description, description language, object oriented analysis
Objavljeno: 30.11.2017; Ogledov: 318; Prenosov: 197
.pdf Celotno besedilo (424,31 KB)
Gradivo ima več datotek! Več...

8.
Solution of the problem of critical path’s finding in Excel on the basis of reducing it to ordinary transportation task
Mimo Drašković, Ludmila Malyaretz, Oleksandr Dorokhov, 2016, samostojni znanstveni sestavek ali poglavje v monografski publikaciji

Opis: The problem of determining the critical path for the scheduling tasks has been considered. An original technique for practical calculations using the available Solver add-on in Excel has been described. The proposed approach is based on reducing the task to solving the ordinary transportation problem, in particular to the problem of finding the longest path. Examples of solutions with the test input data and corresponding screenshots are given. The practical steps of the user’s action in the process of direct solution in Excel are consistently described. The analysis of the results of the proposed method has been performed and presented. It is established that presented method for calculating the critical path requires minimal efforts from the users, regardless of the dimension of the tasks.
Ključne besede: task scheduling, transportation tasks, calculations, critical path, Excel, Solver, software tools
Objavljeno: 09.05.2018; Ogledov: 207; Prenosov: 41
.pdf Celotno besedilo (377,09 KB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.12 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici