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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 101; číslo 3; s. 463 - 473
Hlavní autori: Hultberg, Tim H., Cardoso, Domingos M.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 16.09.1997
Elsevier
Elsevier Sequoia S.A
Edícia:European Journal of Operational Research
Predmet:
0–1 integer programming
Algorithms
Applied sciences
Branch and bound
Complexity
Exact sciences and technology
Fixed charge transportation problem
Flows in networks. Combinatorial problems
Integer programming
Operational research and scientific management
Operational research. Management science
Operations research
Scheduling
Studies
Teachers
Branch and bound
Fixed charge transportation problem
0–1 integer programming
Complexity
Assignment
Partition
Transportation problem
Branch and bound method
Combinatorial problem
Teacher
Fixed charge problem
Mixed integer programming
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(96)00082-3