Student scheduling by computer : a discussion of an algorithm based on course requests and priorities Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/79408063x

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • A solution to the problems of computer scheduling of students based on course requests rather than section requests is discussed. The solution involves keeping all course data in core during the scheduling process to enable the scheduling program to run as fast as possible and using a scheduling algorithm which tries all possible combinations of sections for the requested courses until a conflict-free schedule is found, or until it is determined that the remaining conflicts are unresolvable. The algorithm schedules recitations and labs where required and maintains section balancing in terms of the percentage of scheduled stations for lecture, lab, and recitation sections within a course. Several methods of giving the student more choice in the sections he will be scheduled for are discussed. These include instructor preference and course request alternates. These features are not implemented in the algorithm currently being used.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0 on a Canon DR-9050C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Submitted by Georgeann Booth (gbscannerosu@gmail.com) on 2014-01-09T01:46:42Z No. of bitstreams: 1 ThoennesHarvey1973.pdf: 833655 bytes, checksum: 1b8431fc993922e2ee94de5e891500ac (MD5)
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2014-01-09T15:20:20Z (GMT) No. of bitstreams: 1 ThoennesHarvey1973.pdf: 833655 bytes, checksum: 1b8431fc993922e2ee94de5e891500ac (MD5)
  • description.provenance : Made available in DSpace on 2014-01-24T16:49:41Z (GMT). No. of bitstreams: 1 ThoennesHarvey1973.pdf: 833655 bytes, checksum: 1b8431fc993922e2ee94de5e891500ac (MD5) Previous issue date: 1972-07-14
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2014-01-24T16:49:41Z (GMT) No. of bitstreams: 1 ThoennesHarvey1973.pdf: 833655 bytes, checksum: 1b8431fc993922e2ee94de5e891500ac (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items