In this paper a discrete optimization problem under uncertainty is discussed. Solving such a problem can be seen as a game against nature. In order to choose a solution, the minmax and minmax regret criteria can be applied. In this paper an extension of the known minmax (regret) approach is...

In this paper a basic resource allocation problem with uncertain costs is discussed. The problem consists in choosing exactly p items out of n available to minimize the total cost. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a...

In this paper a basic resource allocation problem with uncertain costs is discussed. The problem consists in choosing exactly p items out of n available to minimize the total cost. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a...

In this paper a basic resource allocation problem with uncertain costs is discussed. The problem consists in choosing exactly p items out of n available to minimize the total cost. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a...

In this paper a basic resource allocation problem with uncertain costs is discussed. The problem consists in choosing exactly p items out of n available to minimize the total cost. The uncertain item costs are specified as a discrete scenario set and the minmax criterion is used to choose a...

This paper deals with the two machine permutation flow shop problem with uncertain data, whose deterministic counterpart is known to be polynomially solvable. In this paper, it is assumed that job processing times are uncertain and they are specified as a discrete scenario set. For this...