Resource constrained shortest path problems are usually solved by label algorithms, which consist in a smart enumeration of the non-dominated paths. Recent improvements of these algorithms rely on the use of bounds on path resources to discard partial solutions. The quality of the bounds determines the performance of the algorithm. The main contribution of this paper is to introduce a standard ...

Present study compared, for the first time, impact of processing (soaking, cooking and sterilization) storage conditions (in terms time (0–40 weeks), temperature (20–42 °C), oxygen availability) on headspace volatile profile chickpeas. Soaked chickpeas contained more aldehydes alcohols associated with unpleasant “beany” aromas compared to intensively processed (i.e., sterilized) chickpeas, whic...

This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem the Labeled Real-Time Dynamic Programming (lrtdp) approaches is applied in an effective way. lrtdp concentrates the planning on significant states of the environment only, as the search is guided by an initial heuristic. As demonstrated...

In this paper, a resource flow-based branch-and-bound procedure is designed to solve the well-known resource-constrained project scheduling problem under mixed uncertainty of fuzziness and randomness (FS-RCPSP). The objective minimize expected makespan subject precedence constraints. proposed can be employed obtain optimal solutions also truncated in order find promising near solutions. depth-f...

We study a basic auction design problem with online supply. There are two unit-demand bidders and two types of items. The first item type will arrive first for sure, and the second item type may or may not arrive. The auctioneer has to decide the allocation of an item immediately after each item arrives, but is allowed to compute payments after knowing how many items arrived. For this problem w...

Applications developed over the cloud coordinate several, often anonymous, computational resources, distributed over different execution nodes, within flexible architectures. Coordination models able to represent quantitative data provide a powerful basis for their analysis and validation. This paper extends IMCReo, a semantic model for Stochastic Reo based on interactive Markov chains, to enha...

We consider single class queueing networks with state-dependent arrival and service rates. Under the uniform (in state) stability condition, it is shown that the queue length process is V -uniformly ergodic; that is, it has a transition probability kernel which converges to its limit geometrically quickly in V -norm sense. Among several asymptotic properties of V -uniformly ergodic processes, w...

For a range of scenarios arising in sensor networks, control and edge computing, communication is event-triggered; that is, response to the environment communicating devices. A key feature device activity this setting correlation, which particularly relevant for sensing physical phenomena such as earthquakes or flooding. Such correlation introduces new challenge design resource allocation sched...