A RESULT FOR THE EXTENDED SCHOOL TIME-TABLING PROBLEM WITH PRE-ASSIGNMENTS
dc.contributor.author | Colijn, A.W. | eng |
dc.date.accessioned | 2008-02-26T20:30:28Z | |
dc.date.available | 2008-02-26T20:30:28Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1981-03-01 | eng |
dc.description.abstract | Necessary and sufficient conditions are presented for the existence of a solution to the extended school time-tabling problem, in which each class (or year-group) and each teacher (or teaching department) is available more than once during each period, and in which pre-assignments may occur. An algorithm for constructing time-tables follows naturally from the proof of the result.(1) | eng |
dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
dc.identifier.department | 1981-62-14 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30567 | |
dc.identifier.uri | http://hdl.handle.net/1880/45462 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | A RESULT FOR THE EXTENDED SCHOOL TIME-TABLING PROBLEM WITH PRE-ASSIGNMENTS | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |
Files
License bundle
1 - 1 of 1