Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "allocation" wg kryterium: Temat


Wyświetlanie 1-10 z 10
Tytuł:
Concept of production facilities layout in company Alumin, s.r.o. Slovakia
Autorzy:
Straka, M.
Tematy:
logistics
optimization
layout
allocation
flow
Pokaż więcej
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:
https://bibliotekanauki.pl/articles/343816.pdf  Link otwiera się w nowym oknie
Opis:
The aim of part of the solution layout processing company is an analysis of the existing system of distribution of production equipment company, identification of material flows and showing the possibility of modifying the layout of production facilities in compliance with capacity, safety and quality requirements for production.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Neighbourhood properties in some single processor scheduling problem with variable efficiency and additional resources
Autorzy:
Gorczyca, M.
Janiak, A.
Janiak, W.
Tematy:
scheduling
optimization
resource allocation
neighbourhood
Pokaż więcej
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Powiązania:
https://bibliotekanauki.pl/articles/375991.pdf  Link otwiera się w nowym oknie
Opis:
In the paper, we consider a problem of scheduling a set of tasks on a single processor. Each task must be preprocessed before it can be started on a processor. The efficiency of preprocessing is variable, i.e., the rate of the task preprocessing depends on the amount of continuously divisible resource allotted to this task. This dependency is given by concave, continuous, non-negative and strictly increasing function of the resource amount. The total consumption of resource at each moment is upper bounded. The objective is to minimize the maximum task completion time. The considered problem is NP-hard. Such a problem appears, e.g., in steel mill systems, where ingots (before hot rolling on the blooming mill) have to achieve the required temperature in the preheating process in soaking pits. Some new properties of the problem are proved. These properties are used to construct the procedure for evaluation of the neighbourhood. The procedure is proposed to improve the efficiency of algorithms based on the neighbourhood concept, such as metaheuristics. The computational experiment is conducted to examine the efficiency of the proposed procedure. The described approach can be easily used in the other discrete-continuous scheduling problems.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mobile devices and computing cloud resources allocation for interactive applications
Autorzy:
Krawczyk, H.
Nykiel, M.
Tematy:
mobile devices
computing cloud
task allocation
optimization
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:
https://bibliotekanauki.pl/articles/229566.pdf  Link otwiera się w nowym oknie
Opis:
Using mobile devices such as smartphones or iPads for various interactive applications is currently very common. In the case of complex applications, e.g. chess games, the capabilities of these devices are insufficient to run the application in real time. One of the solutions is to use cloud computing. However, there is an optimization problem of mobile device and cloud resources allocation. An iterative heuristic algorithm for application distribution is proposed. The algorithm minimizes the energy cost of application execution with constrained execution time.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance Analysis of Dynamic PUCCH Allocation Algorithm in LTE Network
Autorzy:
Czerniecki, Maciej
Wszołek, Jacek
Sikora, Marek
Ludwin, Wiesław
Tematy:
optimization
planning
PUCCH dimensioning
network planning
network optimization
self-organizing networks
SON
dynamic PUCCH allocation
static PUCCH allocation
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Powiązania:
https://bibliotekanauki.pl/articles/226869.pdf  Link otwiera się w nowym oknie
Opis:
The aim of the presented paper was to verify the impact of Dynamic PUCCH Resource Allocation Algorithm of the LTE cellular system on the maximum uplink cell throughput and call setup success rate - CSSR. Paper includes the laboratory testbed description and presents the results of an experiment confirming the improvement of both key performance indicators KPIs. Apart from the presentation of the Dynamic PUCCH Resource allocation algorithm, the paper also includes a description of legacy LTE uplink (PUCCH and PUSCH) channels dimensioning process thus filling the gap of such a tutorial in the available literature.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimizing the Use of Human Resources in Industrial-Service Enterprises
Autorzy:
Tychoniuk, A.
Wyczółkowski, R.
Stuchlý, V.
Tematy:
optimization
human resource allocation
competency
selection of employees
genetic algorithms
Pokaż więcej
Wydawca:
STE GROUP
Powiązania:
https://bibliotekanauki.pl/articles/2064891.pdf  Link otwiera się w nowym oknie
Opis:
The optimal use of resources available in the enterprise is important regardless of the size of the company and the industry in which it operates. Enterprises are therefore forced constantly to make alternative choices related to the allocation of available resources and to optimize these choices. The article addresses the problem of the approach to optimizing the use of human resources particularly, the use of extra employee qualifications e.g., manual skills, pressure resistance, work precision, the ability to read schematic diagrams, etc. in the context of technical requirements for a given task. This is extremely important in the situation when subsequent works are individual and the conditions in which they will be performed, cannot be predicted in 100%, they may differ from those that have been implemented so far, and at the same time numerous orders of various nature are being implemented. In this situation, an accurate prediction of the requirements posed by new tasks and the appropriate selection of teams executing them can have an impact on the effectiveness of the task completion process. In the article, this problem is presented on the example of a medium-sized service enterprise operating in the industry-related sector operating basically on tender procedures and tender contests. The works are carried out on the customer's premises, often with new customers or in new field conditions. Thus, the success of the undertaking depends mainly on the optimal selection of employees with appropriate qualifications and competences. The example of an investment task is used to show a method of identifying characteristics relevant to the task as well as selection of employees in order to use the capabilities of human teams better. Technical aspects of task implementation and an employees team selection with regard to the absolutely required technical qualifications as well as the behavioral and physical skills necessary for its implementation are taken into account. The described method can be used for future tasks regardless of the changing conditions of their implementation. The intention of the authors is to develop a tool supporting the decision-making process in this area, so that it can also be used by managers with lower technical competences.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Spare parts allocation optimization in a multi-echelon support system based on multi-objective particle swarm optimization metod
Optymalizacja alokacji części zamiennych w wieloszczeblowym systemie wsparcia na podstawie metody wielokryterialnej optymalizacji rojem cząstek
Autorzy:
Wang, Y.
Zhao, J.
Jia, X.
Tian, Y.
Tematy:
MOPSO
części zamienne
alokacja
optymalizacja
prawdopodobieństwo wsparcia
spare parts
allocation
optimization
support probability
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Powiązania:
https://bibliotekanauki.pl/articles/301801.pdf  Link otwiera się w nowym oknie
Opis:
Optymalizacja alokacji części zamiennych w wieloszczeblowym systemie wspomagania stanowi trudne zagadnienie, które wymaga optymalizacji nieliniowej funkcji celu oraz zmiennych całkowitych. W niniejszej pracy, opracowano wielokryterialny model optymalizacyjny, który maksymalizuje prawdopodobieństwo wsparcia i minimalizuje jego koszty. W celu rozwiązania problemu optymalizacyjnego, wykorzystano ulepszoną metodę wielokryterialnej optymalizacji rojem cząstek (MOPSO). W metodzie tej wykorzystano techniki redukcji wymiarów oraz wielokryterialnej optymalizacji algorytmowej, które mogą poprawić efektywność metody MOPSO. Zasady proponowanej metody zilustrowano przykładem numerycznym.
Spare parts allocation optimization in a multi-echelon support system presents a difficult problem which involves non-linear objective function and integer variables to be optimized. In this paper, a multi-objective optimization model was developed, which maximizes support probability and minimizes support costs. In order to solve the optimization problem, an improved multi-objective particle swarm optimization (MOPSO) method was utilized. In this method, techniques of dimensions reduction and rules-based multi-objective optimization were employed, which can improve the efficiency of MOPSO method. A numerical example was given to show the performance of proposed method.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some efficient algorithms to deal with redundancy allocation problems
Autorzy:
Es-Sadqi, Mustapha
Idrissi, Abdellah
Benhassine, Ahlem
Tematy:
redundancy allocation problem
constraint programming
forward checking
optimization
genetic algorithm
top_k
Pokaż więcej
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Powiązania:
https://bibliotekanauki.pl/articles/2141899.pdf  Link otwiera się w nowym oknie
Opis:
In this paper, we will discuss some algorithms in order to better optimize the problems of redundancy allocation in multi-state systems. The goal is to find the optimal configuration of the system that maximizes the availability and minimizes the investment cost. The availability will be evaluated using the universal generating function. In first step, our contribution consists in improving the genetic algorithm. In a second step, in the framework of the Constraint Programming, we propose a new method of optimization based on the Forward Checking as solver. Finally, we used the top-k method in our choice that helps us to get the best k elements from all possible values with highest availability. In comparison with the chosen study, our methods yield better results that satisfy the constraints of the problem in a shorter time.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Structuring expenses of industrial enterprises in the evaluation process of its production and sales potential
Autorzy:
Emelyanov, A.
Kurylo, O.
Vysotskij, A.
Tematy:
enterprises costs
structuring
supply-side potential
production program
allocation of costs
product range
marginal revenue
optimization
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Oddział w Lublinie PAN
Powiązania:
https://bibliotekanauki.pl/articles/411005.pdf  Link otwiera się w nowym oknie
Opis:
The essence of supply-side potential of industrial enterprises and conceptual bases its evaluation. Determined the importance of structuring the company's expenses in carrying out its assessment of supply possibilities. A method of allocating costs that are not dependent on the range of enterprise, for its species. Filed analytical expressions modified index of relative level of costs and the marginal rate of return products. A method for optimizing the production program of industrial enterprises in the evaluation and implementation of its supply-side potential.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Risk management in the allocation of vehicles to tasks in transport companies using a heuristic algorithm
Autorzy:
Izdebski, Mariusz
Tematy:
transport companies
allocation of vehicles
organization of transport
risk management
heuristic algorithm
ant algorithm
optimization
firmy transportowe
przydział pojazdów
organizacja transportu
zarządzanie ryzykiem
algorytm heurystyczny
algorytm mrówkowy
optymalizacja
Pokaż więcej
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Powiązania:
https://bibliotekanauki.pl/articles/27311808.pdf  Link otwiera się w nowym oknie
Opis:
The work deals with the issue of assigning vehicles to tasks in transport companies, taking into account the minimization of the risk of dangerous events on the route of vehicles performing the assigned transport tasks. The proposed risk management procedure based on a heuristic algorithm reduces the risk to a minimum. The ant algorithm reduces it in the event of exceeding the limit, which differs from the classic methods of risk management, which are dedicated only to risk assessment. A decision model has been developed for risk management. The decision model considers the limitations typical of the classic model of assigning vehicles to tasks, e.g. window limits and additionally contains limitations on the acceptable risk on the route of vehicles' travel. The criterion function minimizes the probability of an accident occurring along the entire assignment route. The probability of the occurrence of dangerous events on the routes of vehicles was determined based on known theoretical distributions. The random variable of the distributions was defined as the moment of the vehicle's appearance at a given route point. Theoretical probability distributions were determined based on empirical data using the STATISTICA 13 package. The decision model takes into account such constraints as the time of task completion and limiting the acceptable risk. The criterion function minimizes the probability of dangerous events occurring in the routes of vehicles. The ant algorithm has been validated on accurate input data. The proposed ant algorithm was 95% effective in assessing the risk of adverse events in assigning vehicles to tasks. The algorithm was run 100 times. The designated routes were compared with the actual hours of the accident at the bottom of the measurement points. The graphical interpretation of the results is shown in the PTV Visum software. Verification of the algorithm confirmed its effectiveness. The work presents the process of building the algorithm along with its calibration.
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Operations research in open-pit mining
Badania operacyjne w górnictwie odkrywkowym
Autorzy:
Maksymowicz, Marcin
Tematy:
decision-making processes
operations research
open-pit mining
optimization
modeling
simulations
long-term planning
short-term planning
losed-loop management
equipment allocation
mining software
proces podejmowania decyzji
badania operacyjne
górnictwo odkrywkowe
optymalizacja
modelowanie
symulacje
planowanie długoterminowe
planowanie krótkoterminowe
zamknięta pętla w zarządzaniu
alokacja maszyn i urządzeń
oprogramowanie dla górnictwa
Pokaż więcej
Wydawca:
Poltegor-Instytut Instytut Górnictwa Odkrywkowego
Powiązania:
https://bibliotekanauki.pl/articles/2030555.pdf  Link otwiera się w nowym oknie
Opis:
In striving to maximize profits, maximize safety and to meet environmental requirements, management decisions being made in surface mining industry should always be optimal. Operations research, as a discipline supporting the decision-making processes helps to achieve this. In this paper, basic issues related to operations research in open-pit mining are explained. Significance of the operations research is emphasized, presenting the wide range of its applications in open-pit mining industry.
Dążąc do maksymalizacji zysków, maksymalizacji bezpieczeństwa oraz spełnienia wymagań środowiskowych, decyzje zarządcze podejmowane w górnictwie odkrywkowym powinny być zawsze optymalne. Badania operacyjne - jako dyscyplina wspierająca procesy decyzyjne, pomagają to osiągać. W artykule wyjaśniono podstawowe zagadnienia dotyczące badań operacyjnych w branży górnictwa odkrywkowego oraz podkreślono ich znaczenie, przedstawiając szeroki wachlarz zastosowań.
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-10 z 10

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies