Consider an n-job stochastic bottleneck assignment problem in which the production rates are independent random variables rather than constants. Assume that the production rate, R ij , (R ij \geqq 0; i, j - 1, 2, ..., n) of man i when assigned to job j is: (1) exponentially distributed with mean 1/\lambda ij or (2) Weibull distributed with scale parameter \lambda ij and shape parameter \beta. It is shown that in either case, the assignment that maximizes the expected rate of the entire line is found by solving the deterministic assignment problem with "cost" matrix [\lambda ij ].
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the re...
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the re...
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jo...
The bottleneck (capacity) assignment problem seeks for a set of entries in a matrix A, one for each ...
ABSTRACT A stochastic production-maximizing problem with transportation constraints is considered wh...
It is shown that the Bottleneck Assignment problem can be transformed into a special case of the cla...
One of the most important variants of the standard linear assignment problem is the bottleneck assig...
One of the most important variants of the standard linear assignment problem is the bottleneck assig...
We develop a stochastic version of the Elastic Generalized Assignment Problem (EGAP) that incorporat...
This paper considers two special cases of bottleneck grouped assignment problems when n jobs belong ...
SIGLETIB: RN 6601 (81-2)+MF / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
Understanding how uncertainty effects the dynamics and behavior of an organization is a critical asp...
The Sequential Stochastic Assignment Problem (SSAP) deals with assigning sequentially arriving tasks...
In this paper, we treat a sequential stochastic assignment problem for the random number of jobs per...
A linear n × n assignment problem is considered for which the elements of the cost matrix are sample...
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the re...
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the re...
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jo...
The bottleneck (capacity) assignment problem seeks for a set of entries in a matrix A, one for each ...
ABSTRACT A stochastic production-maximizing problem with transportation constraints is considered wh...
It is shown that the Bottleneck Assignment problem can be transformed into a special case of the cla...
One of the most important variants of the standard linear assignment problem is the bottleneck assig...
One of the most important variants of the standard linear assignment problem is the bottleneck assig...
We develop a stochastic version of the Elastic Generalized Assignment Problem (EGAP) that incorporat...
This paper considers two special cases of bottleneck grouped assignment problems when n jobs belong ...
SIGLETIB: RN 6601 (81-2)+MF / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...
Understanding how uncertainty effects the dynamics and behavior of an organization is a critical asp...
The Sequential Stochastic Assignment Problem (SSAP) deals with assigning sequentially arriving tasks...
In this paper, we treat a sequential stochastic assignment problem for the random number of jobs per...
A linear n × n assignment problem is considered for which the elements of the cost matrix are sample...
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the re...
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the re...
The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jo...