Showing 1 - 10 of 10
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...
Persistent link: https://www.econbiz.de/10011052395
Persistent link: https://www.econbiz.de/10009282476
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...
Persistent link: https://www.econbiz.de/10005067737
This paper deals with a general combinatorial optimization problem in which closed intervals and fuzzy intervals model uncertain element weights. The notion of a deviation interval is introduced, which allows us to characterize the optimality and the robustness of solutions and elements. The...
Persistent link: https://www.econbiz.de/10005023423
Persistent link: https://www.econbiz.de/10005253928
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...
Persistent link: https://www.econbiz.de/10010682917
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...
Persistent link: https://www.econbiz.de/10010684379
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...
Persistent link: https://www.econbiz.de/10010685013
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...
Persistent link: https://www.econbiz.de/10010711303
Persistent link: https://www.econbiz.de/10005330059