IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v37y1991i1p98-113.html
   My bibliography  Save this article

Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms

Author

Listed:
  • D. Abramson

    (Division of Information Technology, C.S.I.R.O., c/o Department of Communication and Electronic Engineering, Royal Melbourne Institute of Technology, P.O. Box 2476V, Melbourne 3001, Australia)

Abstract

This paper considers a solution to the school timetabling problem. The timetabling problem involves scheduling a number of tuples, each consisting of class of students, a teacher, a subject and a room, to a fixed number of time slots. A Monte Carlo scheme called simulated annealing is used as an optimisation technique. The paper introduces the timetabling problem, and then describes the simulated annealing method. Annealing is then applied to the timetabling problem. A prototype timetabling environment is described followed by some experimental results. A parallel algorithm which can be implemented on a multiprocessor is presented. This algorithm can provide a faster solution than the equivalent sequential algorithm. Some further experimental results are given.

Suggested Citation

  • D. Abramson, 1991. "Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms," Management Science, INFORMS, vol. 37(1), pages 98-113, January.
    • Handle: RePEc:inm:ormnsc:v:37:y:1991:i:1:p:98-113
    DOI: 10.1287/mnsc.37.1.98
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.37.1.98
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.37.1.98?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormnsc:v:37:y:1991:i:1:p:98-113. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.