IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v18y2014i1p1-20.html
   My bibliography  Save this article

A heuristic algorithm for the university course timetabling problems by considering measure index: a case study

Author

Listed:
  • Mohadese Kaviani
  • Hadi Shirouyehzad
  • Seyyed Mojtaba Sajadi
  • Mohammadreza Salehi

Abstract

University timetabling problems, particularly the timetables of courses and examinations are among the most difficult tasks which educational institutions are faced with. Manual solution of a university timetabling problem requires a great domain of time and resources. As generating an operable and applicable programme with the least overlapping in the teachers' schedules and overlapping in the curriculum is not easy, various mathematical models and algorithms are proposed to solve such problems. But any of these strategies have considered different limitations due to their operating media and environment. This paper proposed a heuristic algorithm for university course timetabling problem. In the proposed algorithm, as the operations and steps are random or stochastic, it is not possible to provide a united and unique timetable. Then after providing such a timetable the best solution is chosen among the generated ones through measure index. The proposed algorithm was tested with real data from Najaf Abad Islamic Azad University, the departments of industrial engineering, higher education and MA degree in the semester of 2012-2013. The results reveal that the applied approach is able to generate a timetable which can satisfy the purposes of interest.

Suggested Citation

  • Mohadese Kaviani & Hadi Shirouyehzad & Seyyed Mojtaba Sajadi & Mohammadreza Salehi, 2014. "A heuristic algorithm for the university course timetabling problems by considering measure index: a case study," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 18(1), pages 1-20.
  • Handle: RePEc:ids:ijsoma:v:18:y:2014:i:1:p:1-20
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=60448
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijsoma:v:18:y:2014:i:1:p:1-20. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=150 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.