{"title":"大学课程表的高效设计","authors":"M. Padmini, K. Athre","doi":"10.1109/EIT.2010.5612107","DOIUrl":null,"url":null,"abstract":"Timetabling is a classic problem with practical applications. Based on the available literature on timetable generation, it is clear that the process of automation gives rise to difficulties while trying to incorporate all the constraints involved. The fast elegant simple heuristic proposed here is used for multi-campus university where the faculty belongs to a common teaching pool Administrative processes are adopted to overcome constraints at various levels of hierarchy. The timetable is generated in constant time. The heuristic finds application in various scheduling problems such as: flight scheduling, train scheduling etc.","PeriodicalId":305049,"journal":{"name":"2010 IEEE International Conference on Electro/Information Technology","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Efficient design of university timetable\",\"authors\":\"M. Padmini, K. Athre\",\"doi\":\"10.1109/EIT.2010.5612107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Timetabling is a classic problem with practical applications. Based on the available literature on timetable generation, it is clear that the process of automation gives rise to difficulties while trying to incorporate all the constraints involved. The fast elegant simple heuristic proposed here is used for multi-campus university where the faculty belongs to a common teaching pool Administrative processes are adopted to overcome constraints at various levels of hierarchy. The timetable is generated in constant time. The heuristic finds application in various scheduling problems such as: flight scheduling, train scheduling etc.\",\"PeriodicalId\":305049,\"journal\":{\"name\":\"2010 IEEE International Conference on Electro/Information Technology\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Electro/Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EIT.2010.5612107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Electro/Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2010.5612107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Timetabling is a classic problem with practical applications. Based on the available literature on timetable generation, it is clear that the process of automation gives rise to difficulties while trying to incorporate all the constraints involved. The fast elegant simple heuristic proposed here is used for multi-campus university where the faculty belongs to a common teaching pool Administrative processes are adopted to overcome constraints at various levels of hierarchy. The timetable is generated in constant time. The heuristic finds application in various scheduling problems such as: flight scheduling, train scheduling etc.