Articles
Exact Algorithms for the Imbalanced Time Minimizing Assignment Problem

https://doi.org/10.1016/S1571-0653(04)00240-9Get rights and content

Abstract

Abstract

This paper studies the imbalanced time minimizing assignment problem (ITMAP) dealing with the allocation of n jobs to m (< n) machines. There are few works about this problem in the literature. In fact, only one lexi-shearch algorithm was found for the ITMAP, but it contain an slight error that was corrected here. Other algorithm by dynamic programming was found for the R∣Cmax problem and adapted for the ITMAP. A new approach through a linear model for this problem is introduced in this paper achieving considerables better results.

References (4)

There are more references available in the full text version of this article.

Cited by (2)

1

Work of this author was partially sponsored by the CNPQ, Brazil

View full text