The teacher assignment problem: A special case of the fixed charge transportation problem

A basic model of the task of assigning classes to professors, in such a way that the average number of distinct subjects assigned to each professor is minimized, is formulated as a mixed integer program. It turns out that the problem is a special case of the fixed charge transportation problem which...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 101; no. 3; pp. 463 - 473
Main Authors: Hultberg, Tim H., Cardoso, Domingos M.
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 16.09.1997
Elsevier
Elsevier Sequoia S.A
Series:European Journal of Operational Research
Subjects:
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A basic model of the task of assigning classes to professors, in such a way that the average number of distinct subjects assigned to each professor is minimized, is formulated as a mixed integer program. It turns out that the problem is a special case of the fixed charge transportation problem which in some cases corresponds to finding a basic solution of a transportation problem which is as degenerate as possible. We present an equivalent alternative formulation of the problem which makes it easy to prove that it is NP-hard in the strong sense and an exact branch and bound algorithm for its solution based on this alternative formulation is outlined. Computational experiments with data from a concrete problem, concludes the paper.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(96)00082-3