Variants of the time minimization assignment problem.

Título inglés	Variants of the time minimization assignment problem.
Título español	Variantes del problema de asignación de minimización de tiempo.
Autor/es	Malhotra, Rita ; Bhatia, H. L.
Organización	Dep. Math. Kamla Nerhu Coll. Delhi Univ., Delhi, India;Dep. Math. P.G.D.A. Coll. Delhi Univ., Delhi, India
Revista	0041-0241
Publicación	1984, 35 (3): 331-338, 3 Ref.
Tipo de documento	articulo
Idioma	Inglés
Resumen inglés	The present paper develops techniques to solve two variants of the time minimization assignment problem. In the first, there are n jobs to be assigned to m establishments (m < n) in such a way that the time taken to complete all the jobs is the minimum, it being assumed that all the jobs are commenced simultaneously. The second variant is an extension of the first one in the sense that an additional constraint on the minimum number of jobs to be taken up by each establishment is introduced. Numerical examples are included to illustrate the techniques.
Clasificación UNESCO	120713
Palabras clave español	Planificación de operaciones ; Asignación ; Tiempo ; Mínimo
Código MathReviews	MR0829693
Acceso al artículo completo