Resource allocation for robust project scheduling

2011 ◽  
Vol 59 (1) ◽  
pp. 51-55 ◽  
Author(s):  
M. Klimek ◽  
P. Łebkowski
Keyword(s):  
Resource Allocation ◽  
Project Scheduling ◽  
Formal Description ◽  
Resource Allocation Problem ◽  
Flow Network ◽  
Robust Scheduling ◽  
Resource Flow ◽  
Precise Analysis ◽  
The Stability ◽  
Robustness Metrics

Resource allocation for robust project schedulingThe 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.

A Multiobjective Resource Allocation Algorithm for Robust Project Scheduling

2016 ◽  
Vol 13 (10) ◽  
pp. 7701-7704
Author(s):  
Chao Chen ◽  
Changjun Fan ◽  
Xingxing Liang
Keyword(s):  
Resource Allocation ◽  
Multiobjective Optimization ◽  
Project Scheduling ◽  
Pareto Optimization ◽  
Benchmark Problems ◽  
Optimization Approach ◽  
Computational Results ◽  
Resource Allocation Problem ◽  
Resource Allocation Algorithm ◽  
Allocation Algorithm

Resource allocation is an important procedure which involves allocating finite resources to the activities of a given baseline schedule. Based on the conception of Pareto Optimization, a multiobjective optimization approach for the resource allocation problem is proposed in this paper. The problem is first described. Then the detailed procedure of the proposed algorithm is given. Finally, an extensive computational results obtained on a set of benchmark problems are reported.

The Soft Resource Allocation Problem

2009 ◽  
Author(s):  
Reza Ahmadi ◽  
Sriram Dasu ◽  
Foaad Iravani
Keyword(s):  
Resource Allocation ◽  
Allocation Problem ◽  
Resource Allocation Problem

scholarly journals Improving Streaming Capacity In Tree & Meshed Based P2P Live Streaming Systems

2021 ◽  
Author(s):  
Shujjat A. Khan
Keyword(s):  
Resource Allocation ◽  
Resource Sharing ◽  
Optimization Problem ◽  
Live Streaming ◽  
Resource Allocation Problem ◽  
Optimal Resource Allocation ◽  
P2p Streaming ◽  
P2p Live Streaming ◽  
Optimal Resource ◽  
Streaming Systems

The streaming capacity for a channel is defined as the maximum streaming rate that can be achieved by every user in the channel. In the thesis, we investigated the streaming capacity problem in both tree-based and mesh-based Peer-to-Peer (P2P) live streaming systems, respectively. In tree-based multi-channel P2P live streaming systems, we propose a crosschannel resource sharing approach to improve the streaming capacity. We use cross-channel helpers to establish the cross-channel overlay links, with which the unused upload bandwidths in a channel can be utilized to help the bandwidth-deficient peers in another channel, thus improving the streaming capacity. In meshed-based P2P live streaming systems, we propose a resource sharing approach to improve the streaming capacity. In mesh-based P2P streaming systems, each peer exchanges video chunks with a set of its neighbors. We formulate the streaming capacity problem into an optimal resource allocation problem. By solving the optimization problem, we can optimally allocate the link rates for each peer, thus improve the streaming capacity.

Sign in / Sign up

Export Citation Format

Share Document