# Variants of the time minimization assignment problem.

Trabajos de Estadística e Investigación Operativa (1984)

- Volume: 35, Issue: 3, page 331-338
- ISSN: 0041-0241

## Access Full Article

top## Abstract

top## How to cite

topMalhotra, Rita, and Bhatia, H. L.. "Variants of the time minimization assignment problem.." Trabajos de Estadística e Investigación Operativa 35.3 (1984): 331-338. <http://eudml.org/doc/40779>.

@article{Malhotra1984,

abstract = {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.},

author = {Malhotra, Rita, Bhatia, H. L.},

journal = {Trabajos de Estadística e Investigación Operativa},

keywords = {Planificación de operaciones; Asignación; Tiempo; Mínimo},

language = {eng},

number = {3},

pages = {331-338},

title = {Variants of the time minimization assignment problem.},

url = {http://eudml.org/doc/40779},

volume = {35},

year = {1984},

}

TY - JOUR

AU - Malhotra, Rita

AU - Bhatia, H. L.

TI - Variants of the time minimization assignment problem.

JO - Trabajos de Estadística e Investigación Operativa

PY - 1984

VL - 35

IS - 3

SP - 331

EP - 338

AB - 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.

LA - eng

KW - Planificación de operaciones; Asignación; Tiempo; Mínimo

UR - http://eudml.org/doc/40779

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.