IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v6y2014i1p123-138.html
   My bibliography  Save this article

A graph edge colouring approach for school timetabling problems

Author

Listed:
  • Rakesh P. Badoni
  • D.K. Gupta

Abstract

School timetabling problems require weekly scheduling of lectures for subjects between teachers and classes in fixed time periods such that a set of constraints are satisfied. In this paper, a school timetabling problem is solved using a graph edge colouring algorithm in two phases. A bipartite multigraph is used in the first phase to get daily requirement matrices for each day of the week from weekly requirement matrix obtained by solving a system of linear equations for the variables taking integer values. Next, bipartite graphs are used in the second phase to assign lectures over unconstrained time slots for each day. The algorithm is tested on a number of randomly generated data sets and a timetable for a simple data set is given. The performance of the algorithm measured in terms of the number of iterations required and amount of CPU time in seconds is summarised in a table.

Suggested Citation

  • Rakesh P. Badoni & D.K. Gupta, 2014. "A graph edge colouring approach for school timetabling problems," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 6(1), pages 123-138.
    • Handle: RePEc:ids:ijmore:v:6:y:2014:i:1:p:123-138
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=57853
    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:ijmore:v:6:y:2014:i:1:p:123-138. 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=320 .

    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.