Research Article
BibTex RIS Cite
Year 2008, Volume: 37 Issue: 1, 41 - 55, 01.01.2008

Abstract

References

  • .
  • .
  • .

A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM

Year 2008, Volume: 37 Issue: 1, 41 - 55, 01.01.2008

Abstract

One of the major problems with course scheduling - a particular type of timetabling - is the difficulty that arises when trying to suitably co-ordinate lectures, students and classrooms according to a set of operational rules within a framework of certain constraints. The assignment of courses and lectures to periods and classrooms is an important administrative task that must be performed each term. The primary purpose of this paper is to solve an existing course scheduling problem. Organizing courses and lectures according to periods and avail- ability of classrooms is a difficult course scheduling problem, which we are currently experiencing within the Department of Statistics at Gazi University. We have therefore formulated the problem as a 0-1 integer programming model. The aim of this model is to minimize the dissatisfaction of students and lecturers whilst at the same time implementing rules bounded by a set of constraints. The model produced has flexibility in terms of embracing new rules and/or criteria.

References

  • .
  • .
  • .
There are 3 citations in total.

Details

Primary Language English
Subjects Statistics
Journal Section Statistics
Authors

M Akif Bakır This is me

Cihan Aksop This is me

Publication Date January 1, 2008
Published in Issue Year 2008 Volume: 37 Issue: 1

Cite

APA Bakır, M. A., & Aksop, C. (n.d.). A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM. Hacettepe Journal of Mathematics and Statistics, 37(1), 41-55.
AMA Bakır MA, Aksop C. A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM. Hacettepe Journal of Mathematics and Statistics. 37(1):41-55.
Chicago Bakır, M Akif, and Cihan Aksop. “A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM”. Hacettepe Journal of Mathematics and Statistics 37, no. 1 n.d.: 41-55.
EndNote Bakır MA, Aksop C A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM. Hacettepe Journal of Mathematics and Statistics 37 1 41–55.
IEEE M. A. Bakır and C. Aksop, “A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM”, Hacettepe Journal of Mathematics and Statistics, vol. 37, no. 1, pp. 41–55.
ISNAD Bakır, M Akif - Aksop, Cihan. “A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM”. Hacettepe Journal of Mathematics and Statistics 37/1 (n.d.), 41-55.
JAMA Bakır MA, Aksop C. A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM. Hacettepe Journal of Mathematics and Statistics.;37:41–55.
MLA Bakır, M Akif and Cihan Aksop. “A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM”. Hacettepe Journal of Mathematics and Statistics, vol. 37, no. 1, pp. 41-55.
Vancouver Bakır MA, Aksop C. A 0-1 INTEGER PROGRAMMING APPROACH TO A UNIVERSITY TIMETABLING PROBLEM. Hacettepe Journal of Mathematics and Statistics. 37(1):41-55.