Bottleneck assignment problems under categorization

Aggarwal, Vijay and Tikekar, VG and Hsu, Lie-Fern (1986) Bottleneck assignment problems under categorization. In: Computers & Operations Research, 13 (1). pp. 11-26.

PDF http___www.sciencedirect.com_science__ob=MImg&_imagekey=B6VC5-48M2YG3-36-4&_cdi=5945&_user=512776&_orig=search&_coverDate=12_31_1986&_sk=999869998&view=c&wchp=dGLzVlz-zSkzS&md5=7cb4971160f2e.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

This paper considers two special cases of bottleneck grouped assignment problems when n jobs belong to m distinct categories (m < n). Solving these special problems through the available branch and bound algorithms will result in a heavy computational burden. Sequentially identifying nonopitmal variables, this paper provides more efficient methods for those cases. Propositions leading to the algorithms have been established. Numerical examples illustrate the respective algorithms.

Item Type:	Journal Article
Publication:	Computers & Operations Research
Publisher:	Elsevier Science
Additional Information:	Copyright of this article belongs to Elsevier Science.
Department/Centre:	Division of Physical & Mathematical Sciences > Mathematics
Date Deposited:	01 Jul 2009 10:26
Last Modified:	19 Sep 2010 05:36
URI:	http://eprints.iisc.ac.in/id/eprint/21201

Actions (login required)

View Item