Repository logo
Institutional Repository
Communities & Collections
Browse
Quick Links
  • Central Library
  • Digital Library
  • BHU Website
  • BHU Theses @ Shodhganga
  • BHU IRINS
  • Login
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Amit Ambar Gupta"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    PublicationArticle
    Examination and class timetabling problem: a case study of an Indian university
    (Inderscience Publishers, 2024) Anil Kumar Agrawal; Susheel Yadav; Amit Ambar Gupta; Shubhendu Pandey
    Timetabling problem is basically an optimisation problem and is a subset of scheduling problems. A timetabling problem is a problem where events (classes, examination and student) have to be ordered in time slots while satisfying some basic constraints. Here the basic aim is to satisfy various constraints, such as, no student can be scheduled for more than one course at the same time and the maximum number of students that can be scheduled to any particular class must not exceed the sitting capacity of the class. So, the timetabling problem is basically arranging the given set of values (class, subject and students) in such a manner such that the resulting schedule should fulfil all the above stated hard constraints and try to give more close values near to the soft constraints (such as proper distribution of classes over available slots). In the present work, examination timetable and class timetable problems have been considered with several practical features. The problems are formulated as mathematical models and heuristic approach is also proposed to solve them. The heuristic uses the basic framework of genetic algorithm. Copyright © 2024 Inderscience Enterprises Ltd.
An Initiative by BHU – Central Library
Powered by Dspace