Browsing by Subject "resource allocation"

Now showing 1 - 7 of 7

Access status: Open Access ,
A cooperation platform for distributed manufacturing
(AGH University of Science and Technology Press, 2020) Pietroń, Roman
The aim of the paper is to analyse contemporary trends in distributed manufacturing (DM) research and to present a concept to develop and test some task allocation, planning and scheduling algorithms for DM network organisations. Some concepts to identify key factor criteria and reasoning policies and rules for production/manufacturing decision support system are also undertaken. And finally, an aim is to draw a proposal for a development of a prototype decision support system with necessary communication and knowledge oriented modules to be implemented in an example of dynamic, DM and logistics network structure, particularly for very popular dynamic cluster forms in Poland. The developed concept of the organization of a multi-entity DM network will enable business-effective use of the system, supporting manufacturing decision making, consulting and offering information services in the control centre (the so-called Competence Centre) by constructing virtual reality and access to services in a distributed network of cloud computing type. Integration of the whole system into one information system will enable analysis and network resource optimization of manufacturing and logistics processes, new analytical functions, reduction of delays in the manufacturing system, management of changes and risks, and visualization of the current state of the DM system.
Access status: Open Access ,
Algorytmy odpornej alokacji zasobów dla problemu harmonogramowania projektu z ograniczoną dostępnością zasobów
(Wydawnictwa AGH, 2009) Klimek, Marcin; Łebkowski, Piotr
In article are presented algorithms of robust resource allocation for resource-constrained project scheduling problem. Effectiveness of algorithms have been tested on the J90 instance set of PSPLIB. As the evaluation criterion proposed by authors measures of robustness of resource allocations were applied.
Access status: Open Access ,
Alokacja zasobów dla problemu harmonogramowania projektu z ważonymi kosztami niestabilności
(Wydawnictwa AGH, 2011) Klimek, Marcin; Łebkowski, Piotr
Article presents resource allocation problem for resource-constrained project scheduling problem with weighted instability costs of tasks. Rules of allocations which may have an influence on increase robustness of schedule were denoted. Measures of robustness of resource allocations which take into consideration the effect of the duration lengthening for individual activities on the stability of the schedule completed were proposed.
Access status: Open Access ,
Computing resource and work allocations using social profiles
(Wydawnictwa AGH, 2013) Lavin, Peter; Kenny, Eamonn; Coghlan, Brian A.
If several distributed and disparate computer resources exist, many of which have been created for different and diverse reasons, and several large scale computing challenges also exist with similar diversity in their backgrounds, then one problem which arises in trying to assemble enough of these resources to address such challenges is the need to align and accommodate the different motivations and objectives which may lie behind the existence of both the resources and the challenges. Software agents are offered as a mainstream technology for modelling the types of collaborations and relationships needed to do this. As an initial step towards forming such relationships, agents need a mechanism to consider social and economic backgrounds. This paper explores addressing social and economic differences using a combination of textual descriptions known as social profiles and search engine technology, both of which are integrated into an agent technology.
Access status: Open Access ,
Neighbourhood properties in some single processor scheduling problem with variable efficiency and additional resources
(2011) Gorczyca, Mateusz; Janiak, Adam; Janiak, Władysław
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.
Access status: Restricted ,
Optymalizacja przydziału zasobów za pomocą algorytmu ewolucyjnego
(Data obrony: 2017-01-23) Dębiński, Albert
Wydział Elektrotechniki, Automatyki, Informatyki i Inżynierii Biomedycznej
Access status: Open Access ,
Resource management in machine scheduling problems a survey
(2007) Janiak, Adam; Janiak, Władysław; Lichtenstein, Maciej
The paper is a survey devoted to job scheduling problems with resource allocation. We present the results available in the scientific literature for commonly used models of job processing times and job release dates, i.e., the models in which the job processing time or the job release date is given as a linear or convex function dependent on the amount of the additional resource allotted to the job. The scheduling models with resource dependent processing times or resource dependent release dates extend the classical scheduling models to reflect more precisely scheduling problems that appear in real life. Thus, in this paper we present the computational complexity results and solution algorithms that have been developed for this kind of problems.