This paper shows that some classes of relaxed sequencing games, which arise from the class of sequencing games as introduced in Curiel, Pederzoli, Tijs (1989), are balanced. Copyright Springer-Verlag Berlin Heidelberg 2003

In this technical note, we consider the optimal replenishment strategies for a continuous review inventory model in which temporary price discounts are offered subject to supplier-obligatory restrictions on the special order quantity. We prove that the minimum inventory level during the on-sale...

Dynamic stochastic programs are prototypical for optimization problems with an inherent tree structure inducing characteristic sparsity patterns in the KKT systems of interior methods. We propose an integrated modeling and solution approach for such tree-sparse programs. Three closely related...

One-armed bandit processes with continuous delayed responses are formulated as controlled stochastic processes following the Bayesian approach. It is shown that under some regularity conditions, a Gittins-like index exists which is the limit of a monotonic sequence of break-even values...

We consider the problem of minimizing the makespan on a batch processing machine, in which jobs are not all compatible. Only compatible jobs can be included into the same batch. This relation of compatibility is represented by a graph (called compatibility graph), which is assumed to be...

The goal of the paper is to introduce a family of values for transferable utility cooperative games that are proportional for two-person games and as well satisfying some combinatorial structure composed by contributions of complementary coalitions or, to less extent, marginal contributions by...

Submodularity (or concavity) is considered as an important property in the field of cooperative game theory. In this article, we characterize submodular minimum coloring games and submodular minimum vertex cover games. These characterizations immediately show that it can be decided in polynomial...

A game on a convex geometry was introduced by Bilbao as a model of partial cooperation. We investigate some properties of the core of a game on a convex geometry. First, we show that if a game is quasi-convex, then the core is stable. This result can be seen as an extension of a result by...

Cooperative games on antimatroids are cooperative games restricted by a combinatorial structure which generalize the permission structure. So, cooperative games on antimatroids group several well-known families of games which have important applications in economics and politics. Therefore, the...

Chains of operations have to be scheduled on a single machine such that a minimum delay is set between any two operations linked by a precedence relation. Three sub-problems are shown to be solved in polynomial time. First, we consider the problem of minimizing the makespan when all the...