Results 231 to 240 of about 143,649 (265)
Some of the next articles are maybe not open access.
ON A PERSONNEL ASSIGNMENT PROBLEM
International Journal of Foundations of Computer Science, 1990A personnel assignment problem is investigated when there exist no feasible assignments.
openaire +2 more sources
A personnel assignment problem
Journal of Algorithms, 1984The following personnel assignment problem is considered. Let \((T,\leq)\) be a linearly ordered set where T is a set of people, and let \((P,\leq)\) be a partially ordered set where P, a set of positions of two types (0 and 1), is of the same cardinality as T. Each person i in T is to be assigned to a position.
Prakash V. Ramanan +2 more
openaire +2 more sources
Networks, 1979
AbstractABSTRACTThis paper examines a routing design problem in which the objective is to assign customer demand points to days of the week in order to solve the resulting node routing problems over the entire week most effectively. The emphasis is on obtaining approximate solutions for this type of combinatorial problem.
R. Russell, W. Igo
openaire +1 more source
AbstractABSTRACTThis paper examines a routing design problem in which the objective is to assign customer demand points to days of the week in order to solve the resulting node routing problems over the entire week most effectively. The emphasis is on obtaining approximate solutions for this type of combinatorial problem.
R. Russell, W. Igo
openaire +1 more source
ACM SIGCSE Bulletin, 2009
The linear assignment problem requires the determination of an optimal permutation vector for the assignment of tasks to agents. Even the backtracking implementation supports a rather powerful bounding function. Since the processing of permutation families (based on low-subscripted vector assignments) can be done independently of each other, one may ...
openaire +1 more source
The linear assignment problem requires the determination of an optimal permutation vector for the assignment of tasks to agents. Even the backtracking implementation supports a rather powerful bounding function. Since the processing of permutation families (based on low-subscripted vector assignments) can be done independently of each other, one may ...
openaire +1 more source
Generalized assignment problems
1992We consider generalized assignment problems with different objective functions: min-sum, max-sum, min-max, max-min. We review transformations, bounds, approximation algorithms and exact algorithms. The results of extensive computational experiments are given.
Silvano Martello, Paolo Toth
openaire +1 more source
The Quadratic Assignment Problem
Management Science, 1963This paper presents a formulation of the quadratic assignment problem, of which the Koopmans-Beckmann formulation is a special case. Various applications for the formulation are discussed. The equivalence of the problem to a linear assignment problem with certain additional constraints is demonstrated.
openaire +2 more sources
The Counseling Assignment Problem
Psychometrika, 1958A disposition index, DI, which provides information about each possible placement to be considered in a personnel classification situation is discussed. The index is readily computed by machine methods and can be used by counselors required to make assignments.
openaire +1 more source
European Journal of Operational Research, 1984
Consider the following situation: n buildings are to be erected on n possible sites. It is known, how often people have to go from building j to building q per day. The buildings shall be erected such that the total walking distance of the people becomes minimal.
openaire +2 more sources
Consider the following situation: n buildings are to be erected on n possible sites. It is known, how often people have to go from building j to building q per day. The buildings shall be erected such that the total walking distance of the people becomes minimal.
openaire +2 more sources
The Weapon-Target Assignment Problem
Computers & Operations Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Kline +2 more
openaire +2 more sources
2009
This paper introduces a new assignment problem called the Grey Assignment Problem, in which the cost of assigning every worker to every job is a grey number rather than a real number. We establish the mathematical model of the grey assignment problems and concerned theory, and also give some methods for solving the grey assignment problems.
openaire +1 more source
This paper introduces a new assignment problem called the Grey Assignment Problem, in which the cost of assigning every worker to every job is a grey number rather than a real number. We establish the mathematical model of the grey assignment problems and concerned theory, and also give some methods for solving the grey assignment problems.
openaire +1 more source