Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "resource scheduling" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 31
Tytuł:
Resource scheduling in cloud environmet: a survey
Autorzy:
Mangla, N.
Singh, M.
Rana, S. K.
Powiązania:
https://bibliotekanauki.pl/articles/102866.pdf
Data publikacji:
2016
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
resource scheduling
energy conservation
cloud computing
virtualization
service level agreement
Opis:
Cloud Computing offers the avant-garde services at a stretch that are too attractive for any cloud user to ignore. With its growing application and popularization, IT companies are rapidly deploying distributed data centers globally, posing numerous challenges in terms of scheduling of resources under different administrative domains. This perspective brings out certain vital factors for efficient scheduling of resources providing a wide genre of characteristics, diversity in context of level of service agreements and that too with user-contingent elasticity. In this paper, a comprehensive survey of research related to various aspects of cloud resource scheduling is provided. A comparative analysis of various resource scheduling techniques focusing on key performance parameters like Energy efficiency, Virtual Machine allocation and migration, Cost-effectiveness and Service-Level Agreement is also presented.
Źródło:
Advances in Science and Technology. Research Journal; 2016, 10, 30; 38-50
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Resource allocation for robust project scheduling
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/202374.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
resource-constrained project scheduling
robust scheduling
resource allocation
Opis:
The paper presents a formal description of the resource allocation problem for resource-constrained project scheduling. A schedule can be executed by various resource flow networks which may differ in terms of resistance to disruptions occurring during project execution. The authors define such criteria of evaluating a resource flow network which can be more useful than robustness metrics used so far in the research. The authors discuss the importance of robust scheduling for execution projects and propose metrics for resource allocation robustness which take into consideration the stability of the final schedule. Those metrics make it possible to carry out a more precise analysis concerning the properties of the resource flow network in terms of its robustness to disruptions in comparison with a well known flexibility indicator, flex.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 1; 51-55
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solving SAT in a distributed cloud: A portfolio approach
Autorzy:
Ngoko, Yanik
Cérin, Christophe
Trystram, Denis
Powiązania:
https://bibliotekanauki.pl/articles/329749.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
resource provisioning
resource scheduling
parallel distributed SAT
algorithm portfolio
maximum coverage problem
udostępnianie zasobów
szeregowanie zasobów
problem maksymalnego zasięgu
Opis:
We introduce a new parallel and distributed algorithm for the solution of the satisfiability problem. It is based on an algorithm portfolio and is intended to be used for servicing requests in a distributed cloud. The core of our contribution is the modeling of the optimal resource sharing schedule in parallel executions and the proposition of heuristics for its approximation. For this purpose, we reformulate a computational problem introduced in a prior work. The main assumption is that it is possible to learn optimal resource sharing from traces collected on past executions on a representative set of instances. We show that the learning can be formalized as a set coverage problem. Then we propose to solve it by approximation and dynamic programming algorithms based on classical greedy algorithms for the maximum coverage problem. Finally, we conduct an experimental evaluation for comparing the performance of the various algorithms proposed. The results show that some algorithms become more competitive if we intend to determine the trade-off between their quality and the runtime required for their computation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 2; 261-274
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Robust buffer allocation for scheduling of a project with predefined milestones
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/375929.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
resource-constrained project scheduling
predictive-reactive scheduling
robust buffer allocation
milestones
Opis:
The paper discusses the problem of robust buffer allocation for Resource- Constrained Project Scheduling Problem (RCPSP) with predefined milestones(1) , for which execution deadlines have been established. To solve the problem, an algorithm is proposed supporting insertion of unit time buffers, with the simultaneous maximisation of new metrics of arrangement robustness. The presented results of experimental research speak for usability of the solutions proposed. The effectiveness is studied with use of test tasks(2) included in the Project Scheduling Problem Library (PSPLIB) with additionally specified project milestones.
Źródło:
Decision Making in Manufacturing and Services; 2009, 3, 1-2; 49-72
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Robustness of schedules for project scheduling problem with cash flow optimisation
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/953048.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
resource-constrained project scheduling with cash flow optimisation
proactive scheduling
milestones
Opis:
The paper presents the resource-constrained project scheduling with cash flow optimisation. New project models with bonuspenalty system and payoff in stages have been proposed. For the models presented, the application of proactive scheduling is analysed, as designed to improve project execution under uncertainty. Next, schedule robustness is discussed and measures of robustness are proposed.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 4; 1005-1015
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/375952.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
resource-constrained project scheduling
discounted cash flows
milestones
heuristics
Opis:
This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor´s perspective, known as an RCPSP problem with Discounted Cash Flows (RCPSPDCF). The cash flows analysed here cover the contractor´s cash outflows (negative cash flows), related to the commencement of individual activities, and cash inflows (positive cash flows) after the fulfilment of individual milestones. The authors propose a two-phase algorithm for solving the problem defined. In the first phase, the simulated annealing metaheuristics is used, designed to identify a forward schedule with as high total DCF as possible. In the second phase, the best first-phase schedule is improved by right shifts of activities. To this end, the procedure which iteratively shifts tasks by one unit is applied, with a view to maximising the objective function. Activity shifts take into consideration precedence and resource constraints, and they are performed for a specified resource allocation to activities. This paper also includes an analysis of the problem for a sample project. The results of computational experiments are then analysed. The experiments were run with the use of standard test problems from the Project Scheduling Problem LIBrary (PSPLIB), with additionally defined cash flows and contractual milestones.
Źródło:
Decision Making in Manufacturing and Services; 2013, 7, 1-2; 51-68
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Insertion algorithms to solve the resource-constrained multi-stage project scheduling problem with discounted cash flow maximization
Autorzy:
Klimek, M.
Powiązania:
https://bibliotekanauki.pl/articles/406997.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
insertion algorithms
discounted cash flow
resource-constrained project scheduling
priority rules
Opis:
The article presents the problem of scheduling a multi-stage project with limited availability of resources with the discounted cash flow maximization criterion from the perspective of a contractor. The contractor’s cash outflows are associated with the execution of activities. The client’s payments (cash inflows for the contractor) are performed after completing the agreed project’s stages. The proposed solution for this problem is the use of insertion algorithms. Schedules are generated using forward and backward schedule generation schemes and modified justification techniques. The effectiveness of the proposed procedures is the subject of the examination with the use of standard test instances with additionally defined financial settlements of a project.
Źródło:
Management and Production Engineering Review; 2018, 9, 4; 106-116
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Insertion Algorithms with Justification for Solving the Resource-Constrained Project Scheduling
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/375927.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
insertion algorithms
resource - constrained project scheduling problem
makespan minimisation
justification
forward scheduling
priority rules
Opis:
The paper presents the resource-constrained project scheduling problem with the makespan minimization criterion. To solve the problem, the authors propose insertion algorithms that generate schedules with the use of forward serial and parallel decoding procedures. Schedules are improved with the use of the double justification by the extremes technique (first right and then left justification). The efficiency of the procedures proposed is tested on standard test problems from the PSPLIB library.
Źródło:
Decision Making in Manufacturing and Services; 2016, 10, 1-2; 31-43
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Applied a new method for multi-mode project scheduling
Autorzy:
Pisz, I.
Banaszak, Z.
Powiązania:
https://bibliotekanauki.pl/articles/117890.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
project
project scheduling
resource-constrained project scheduling
project-driven
manufacturing
multi-mode
heuristic
branch and bound scheme
make-to-order
Opis:
The aim of this paper is to present a modelling heuristic framework that enables one to cope with a problem of a project-driven manufacturing. The objective is to find computationally effective method aimed at scheduling of a new project subject to constraints imposed by a multi-project environment. The application of a heuristic method of scheduling is demonstrated on one example of a makespan-feasible schedule that follows the constraints imposed by the precedence relation and by the time-constrained resources availability. This heuristic method is based on concept of critical path and branch and bound scheme.
Źródło:
Applied Computer Science; 2008, 4, 1; 114-123
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Financial optimisation of the scheduling for the multi-stage project
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/201022.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
resource - constrained project scheduling problem
discounted cash flows
milestones
backward scheduling
simulated annealing
zdyskontowane przepływy pieniężne
kamienie milowe
symulowane wyżarzanie
Opis:
The paper analyses the problem of discounted cash flow maximising for the resource-constrained project scheduling from the project contractor’s perspective. Financial optimisation for the multi-stage project is considered. Cash outflows are the contactor’s expenses related to activity execution. Cash inflows are the client’s payments for the completed milestones. To solve the problem, the procedure of backward scheduling taking into account contractual milestones is proposed. The effectiveness of this procedure, as used to generate solutions for the simulated annealing algorithm, is verified with use of standard test instances with additionally defined cash flows and contractual milestones.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 6; 899-908
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristics for project scheduling with discounted cash flows optimisation
Autorzy:
Klimek, M.
Łebkowski, P.
Powiązania:
https://bibliotekanauki.pl/articles/202107.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
resource-constrained project scheduling
discounted cash flows
milestones
ograniczone zasoby planowania projektu
przepływy pieniężne
kamienie milowe
Opis:
The article presents the resource-constrained project scheduling problem with the maximisation of discounted cash flows from the contractor’s perspective: with cash outflows related to starting individual activities and with cash inflows for completing project stages (milestones). The authors propose algorithms for improving a forward active schedule by iterative one-unit right shifts of activities, taking into account different resource flow networks. To illustrate the algorithms and problem, a numerical example is presented. Finally, the algorithms are tested using standard test problems with additionally defined cash flows and contractual milestones.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2015, 63, 3; 613-622
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Symulowane wyżarzanie dla problemu harmonogramowania projektu z ograniczonymi zasobami
Simulated annealing for project scheduling with limited resources
Autorzy:
Klimek, M.
Powiązania:
https://bibliotekanauki.pl/articles/91479.pdf
Data publikacji:
2016
Wydawca:
Warszawska Wyższa Szkoła Informatyki
Tematy:
wyżarzanie symulowane
harmonogramowanie projektu
ograniczone zasoby
procedury generowania rozwiązań
simulated annealing
resource-constrained project scheduling
schedule generation schemes
Opis:
W artykule przedstawiony jest problem harmonogramowania projektu z ograniczonymi zasobami z kryterium minimalizacji czasu trwania przedsięwzięcia. Do rozwiązania zagadnienia stosowany jest algorytm symulowanego wyżarzania, którego skuteczność testowana jest przy wykorzystaniu standardowych zadań testowych. Eksperymenty przeprowadzane są przy różnych konfiguracjach algorytmu w celu ustalenia najlepszych parametrów: schematu chłodzenia, technik przeszukiwania (ruchów), schematów generowania rozwiązań.
In this paper resource-constrained project scheduling problem with optimisation criterion of minimising makespan is presented. To solve the problem is applied simulated annealing algorithm, whose effectiveness is tested using standard test instances. Experiments are performed with different configurations algorithm to determine the best parameters: cooling schemes, search techniques (moves), schedule generation schemes.
Źródło:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki; 2016, 10, 15; 53-65
1896-396X
2082-8349
Pojawia się w:
Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki
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.
Powiązania:
https://bibliotekanauki.pl/articles/375991.pdf
Data publikacji:
2011
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
scheduling
optimization
resource allocation
neighbourhood
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.
Źródło:
Decision Making in Manufacturing and Services; 2011, 5, 1-2; 5-17
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Resource management in machine scheduling problems: a survey
Autorzy:
Janiak, A.
Janiak, W.
Lichtenstein, M.
Powiązania:
https://bibliotekanauki.pl/articles/1203940.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
scheduling
resource allocation
resource dependent processing times
resource dependent release dates
Opis:
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.
Źródło:
Decision Making in Manufacturing and Services; 2007, 1, 1-2; 59-89
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling battery charging jobs with linearly decreasing power demands to minimize the total time
Autorzy:
Różycki, R.
Waligóra, G.
Węglarz, J.
Powiązania:
https://bibliotekanauki.pl/articles/200446.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
scheduling
makespan
power
energy
continuous resource
Opis:
In this work we consider a problem from the field of power- and energy-aware scheduling, in which a set of batteries have to be charged in a minimum time. The formulated problem is to schedule independent and nonpreemptable jobs to minimize the schedule length, where each job requires some amount of power and consumes a certain amount of energy during its processing. We assume that the power demand of each job linearly decreases with time, as it is the case when Li-ion batteries are being charged. For the assumed job model we prove that each next job should be started as soon as the required amount of power is available. Basing on the proven theorem we formulate a procedure generating a minimum-length schedule for an assumed order of jobs. We also analyze the case of identical jobs, and show some interesting properties of this case.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 2; 299-306
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 31

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