The assignment-to-days problem in a school time-table, a heuristic approach

Papoulias, DB

dc.contributor.author	Papoulias, DB	en
dc.date.accessioned	2014-03-01T01:38:14Z
dc.date.available	2014-03-01T01:38:14Z
dc.date.issued	1980	en
dc.identifier.issn	03772217	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/21966
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0344371625&partnerID=40&md5=aac27ffabe129722064a20834ea50b2c	en
dc.title	The assignment-to-days problem in a school time-table, a heuristic approach	en
heal.type	journalArticle	en
heal.publicationDate	1980	en
heal.abstract	There is a lot of literature on time-tabling algorithms. In most of them the assumption is made that the weekly school time-table requirements are easily divided into daily requirements. But this is not the case when the school is large and the time-table involves complicated situations like settings and multiple periods. In this study a heuristic algorithm is proposed dealing with the assignment to individual days of the weekly requirements. Five British schools are used for a practical evaluation. Results are discussed and suggestions for further improvements are made. © 1980.	en
heal.journalName	European Journal of Operational Research	en
dc.identifier.volume	4	en
dc.identifier.issue	1	en
dc.identifier.spage	31	en
dc.identifier.epage	41	en