We consider the problem of coordinating autonomous agents that have to perform a joint task. This joint task consists of a set of elementary tasks, partially ordered by a set of precedence constraints. Each agent is assigned (using some given task allocation protocol) a subset of the available tasks. We assume that agents wish to be fully independent during the planning process, yet they are de...

The topic of unrepairable system is an important content in system reliability theory. There are many reasons cannot be repaired, some because of technical reasons, cannot repair, some because of economic reasons, not worth to repair, and some because of making repairable system simplification. So it is essential to pay attention to unrepairable systems. In this paper, the lifetimes of unrepair...

considering the increasingly high attention to quality, promoting the reliability of products during designing process has gained significant importance. in this study, we consider one of the current models of the reliability science and propose a non-linear programming model for redundancy allocation in the series-parallel systems according to the redundancy strategy and considering the assump...

Data envelopment analysis (DEA) is a non-parametric technique for evaluation of relative efficiency of decision making units described by multiple inputs and outputs. It is based on solving linear programming problems. Since 1978 when basic DEA model was introduced many its modifications were formulated. Among them are two or multi-stage models with serial or parallel structure often called net...

One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever ≤ n edges are removed, there is still a path from an original input to an original output with ≥ m edges the larger we can make n, m, the denser is the graph. For a given n, m, we would like to lower bound the size such a graph, say in edges, at least when restricting to a particular class ...

The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet admits a retraction onto P, that is, whether there is a homomorphism from Q onto P which fixes every element of P. We study this problem for finite series-parallel posets P. We present equivalent combinatorial, algebraic, and topological charaterisations of posets for which the problem is tractable,...