The Distributed Constraint Optimization Problem (DCOP) is a fundamental formalism for multi-agent cooperation. With DCOPs, the agent states and the relationships between agents are formalized into a constraint optimization problem, which is then solved using distributed cooperative optimization algorithms. In the original DCOP framework, a set of objective functions is employed to represent the...

In this paper, we develop a class of decentralized algorithms for solving a convex resource allocation problem in a network of n agents, where the agent objectives are decoupled while the resource constraints are coupled. The agents communicate over a connected undirected graph, and they want to collaboratively determine a solution to the overall network problem, while each agent only communica...

Resource-constrained project scheduling problem is to make a schedule for minimization of the makespan subject to precedence and resource constraints. In this paper, we consider an uncertain resource constrained project scheduling problem (URCPSP) with renewable resource constraints, in which activity durations, with no historical data generally, are estimated by belief degrees. For purpose of ...

Execution of business processes often requires resources, the use of which is usually subject to constraints. In this paper, we study the compliance of business processes with resource usage policies. To this end, we relate the execution of a business process to its resource requirements in terms of resources consumed, produced or blocked by tasks of the business process. Policies specifying co...

Efficient resource reservations play a vital role in providing acceptable performance and Quality of Service (QoS) guarantees (e.g., timeliness) in wireless real-time applications such as mobile media streaming. However, the computation of the resource requirements of a wireless node have been widely ignored so far, which has often resulted in degraded support for real-time traffic and overprov...

We present a generalization of the average shadow price in 0-1-Mixed Integer Linear Programming problems and its relation with bottlenecks including the analysis relative to the coefficients matrix of resource constraints. A mathematical programming approach to find the strategy for investment in resources is presented. KeywordsMixed Integer programming, Average shadow price, Bottlenecks, Resou...

The paper presents a novel algorithm suitable for optimizing software-pipelining compilers targeting embedded VLIW processors. The proposed algorithm is different from previous approaches in that it can effectively handle code size constraints along with latency and resource constraints. Experimental results are presented showing that FDRA’s solutions to the “traditional ’’ software-pipelining ...

We present a family of resource constraints which allow us to model scheduling problems with time variable resource cost. Our main use case is energy cost minimization, by avoiding peak electricity usage periods in the generated schedule. This at the same time helps to balance the overall demand profile, leading to reduced stress on the national electricity grid. The proposed constraints extend...

In this paper, we discuss the distributed resource constrained multi-project scheduling problem (DRCMPSP) and focus on handling resource conflicts. The resource conflicts among projects are originally caused by precedence constraints and resource constraints. To reflect the influences of both constraints, this paper incorporates the critical chain concept into the distributed problem and introd...

The Shortest Path Problem with Resource Constraints is a common subproblem in many Branch-Cut-and-Price algorithms (BCP), e.g., routing and scheduling problems. This paper presents a general label-setting algorithm for solving various shortest path problems. An integration of the ‘Shortest Path Problem with Resource Constraints and k-cycle elimination’ with the ‘Partial Elementarity’ is introdu...