as generalized precedence constraints with the objective of minimizing the project duration (RCPSP/max- π). For this …

job. Usually, precedence constraints are given by a partial order on the set of jobs, and each job requires all its … result is in contrast to classical precedence constraints where the preemptive variant is already NP-hard. Our algorithm … generalizes previous results for unit processing time jobs subject to OR-precedence constraints, but without release dates. The …

represented by a digraph. Two of these models are the games with a permission structure and games under precedence constraints. In … under precedence constraints, are axiomatized with an axiom that applies a network power measure to the precedence … for games with a hierarchy, one based on permission structures and another based on precedence constraints, that are …

is the unique further solution that satisfies the axioms, but for games with precedence constraints it violates NE as …We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence … constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under …

is the unique further solution that satisfies the axioms, but for games with precedence constraints it violates NE as …We generalize the characterizations of the positive core and the positive prekernel to TU games with precedence … constraints and show that the positive core is characterized by non-emptiness (NE), boundedness (BOUND), covariance under …