IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v47y2023i1p81-108.html
   My bibliography  Save this article

Algorithm for automation of the teacher-course allotment

Author

Listed:
  • Sanjeev Kumar
  • Rakesh Pandey
  • R.P. Mohanty

Abstract

The university course timetabling problem (UCTP) is one of the important scheduling problems, which is a NP-hard category problem. The teacher-course allotment is a sub-problem in this category. It is a time-consuming and complicated exercise in academic institutions and influences the quality of teaching due to subjectivity in allocation decision. This problem is solved manually by holding a number of meetings at institute level and even after such involved interactions, there is no guarantee that courses are allocated in a correct fashion in order to meet program and course objectives as well as for the satisfaction of all stakeholders. To overcome this subjective practice, it is proposed to develop and validate an algorithm to automate this tedious job. The proposed algorithm consists of two phases. In Phase-I, a bipartite graph is used to obtain the teacher-course preferences-based initial solution of the problem, and then conflict free final solution of teacher-course allocation is achieved in Phase-II. To validate, a software application with rich graphic user interface (GUI) is also developed and tested on an Indian university dataset. The results have been implemented with a good degree of stakeholder's satisfaction.

Suggested Citation

  • Sanjeev Kumar & Rakesh Pandey & R.P. Mohanty, 2023. "Algorithm for automation of the teacher-course allotment," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 47(1), pages 81-108.
    • Handle: RePEc:ids:ijores:v:47:y:2023:i:1:p:81-108
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=130860
    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:ijores:v:47:y:2023:i:1:p:81-108. 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=170 .

    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.