可定制的大学时间表和调度算法

2019 8th International Conference on Information and Communication Technologies (ICICT) Pub Date : 2019-11-01 DOI:10.1109/ICICT47744.2019.9001953

Hira Ansari, Amsa Aijaz, Vijay Kumar, Masood Junejo, Saeed Shah, M. Saad, Zahid Hussain Khaskheli, Qasim, Imran Memon

{"title":"可定制的大学时间表和调度算法","authors":"Hira Ansari, Amsa Aijaz, Vijay Kumar, Masood Junejo, Saeed Shah, M. Saad, Zahid Hussain Khaskheli, Qasim, Imran Memon","doi":"10.1109/ICICT47744.2019.9001953","DOIUrl":null,"url":null,"abstract":"University course timetable problem is considered to be Np hard problem which increases exponentially with the size of problem. In this paper we have introduced algorithm which is made in accordance with Mehran Uet (Pakistan) Timetable. Timetabling is a sort of issue in which events (slots, teachers, courses, and so on) must be organized into various slots to such an extent that conflicts must be avoided for given resources. New functions are introduced in accordance with soft and hard constraints to be satisfied accordance with Mehran Uet Pakistan.","PeriodicalId":351104,"journal":{"name":"2019 8th International Conference on Information and Communication Technologies (ICICT)","volume":"8 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Customizable algorithm for university timetabling and scheduling\",\"authors\":\"Hira Ansari, Amsa Aijaz, Vijay Kumar, Masood Junejo, Saeed Shah, M. Saad, Zahid Hussain Khaskheli, Qasim, Imran Memon\",\"doi\":\"10.1109/ICICT47744.2019.9001953\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"University course timetable problem is considered to be Np hard problem which increases exponentially with the size of problem. In this paper we have introduced algorithm which is made in accordance with Mehran Uet (Pakistan) Timetable. Timetabling is a sort of issue in which events (slots, teachers, courses, and so on) must be organized into various slots to such an extent that conflicts must be avoided for given resources. New functions are introduced in accordance with soft and hard constraints to be satisfied accordance with Mehran Uet Pakistan.\",\"PeriodicalId\":351104,\"journal\":{\"name\":\"2019 8th International Conference on Information and Communication Technologies (ICICT)\",\"volume\":\"8 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 8th International Conference on Information and Communication Technologies (ICICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICT47744.2019.9001953\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 8th International Conference on Information and Communication Technologies (ICICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICT47744.2019.9001953","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

大学课程时间表问题被认为是一个Np困难问题，它随着问题的规模呈指数增长。本文介绍了按照Mehran Uet(巴基斯坦)时间表制定的算法。时间表是一种问题，其中必须将事件(时段、教师、课程等)组织到不同的时段，以避免给定资源的冲突。根据软约束和硬约束引入新功能，以满足Mehran Uet Pakistan的要求。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Customizable algorithm for university timetabling and scheduling

University course timetable problem is considered to be Np hard problem which increases exponentially with the size of problem. In this paper we have introduced algorithm which is made in accordance with Mehran Uet (Pakistan) Timetable. Timetabling is a sort of issue in which events (slots, teachers, courses, and so on) must be organized into various slots to such an extent that conflicts must be avoided for given resources. New functions are introduced in accordance with soft and hard constraints to be satisfied accordance with Mehran Uet Pakistan.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 8th International Conference on Information and Communication Technologies (ICICT)

自引率

0.00%

发文量