Modeling and solving a real-life assignment problem at universities

DOI10.1016/S0377-2217(98)00028-9zbMath0948.90095MaRDI QIDQ1303567

Mirjana Čangalović, L. D. Ivanović, Milan D. Dražić, Vera V. Kovacevic-Vujcic

Publication date: 27 November 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicscombinatorial optimizationtabu searchassignmentcliques in graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items

THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to timetabling
• Tabu search for large scale timetabling problems
• Timetabling problem for university as assignment of activities to resources
• Finding a feasible course schedule using Tabu search
• A logic approach to the resolution of constraints in timetabling
• The combinatorics of timetabling
• Constructing a course schedule by solving a series of assignment type problems
• A tabu search algorithm for computing an operational timetable
• The tabu search metaheuristic: How we used it
• Combinatorial Optimization Problems with Soft and Hard Requirements
• School Timetabling—A Case in Large Binary Integer Linear Programming
• Tabu Search—Part I
• Tabu Search—Part II