• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter Telegram
International Journal of Research in Industrial Engineering
Articles in Press
Current Issue
Journal Archive
Volume Volume 7 (2018)
Volume Volume 6 (2017)
Volume Volume 5 (2016)
Issue 1(4)
Volume Volume 4 (2015)
Volume Volume 3 (2014)
Volume Volume 2 (2013)
Volume Volume 1 (2012)
Naderi, B. (2016). Modeling and Scheduling University Course Timetabling Problems. International Journal of Research in Industrial Engineering, 5(1(4)), 1-15. doi: 10.22105/riej.2017.49167
B. Naderi. "Modeling and Scheduling University Course Timetabling Problems". International Journal of Research in Industrial Engineering, 5, 1(4), 2016, 1-15. doi: 10.22105/riej.2017.49167
Naderi, B. (2016). 'Modeling and Scheduling University Course Timetabling Problems', International Journal of Research in Industrial Engineering, 5(1(4)), pp. 1-15. doi: 10.22105/riej.2017.49167
Naderi, B. Modeling and Scheduling University Course Timetabling Problems. International Journal of Research in Industrial Engineering, 2016; 5(1(4)): 1-15. doi: 10.22105/riej.2017.49167

Modeling and Scheduling University Course Timetabling Problems

Article 8, Volume 5, 1(4), Autumn 2016, Page 1-15  XML PDF (599 K)
Document Type: Research Paper
DOI: 10.22105/riej.2017.49167
Author
B. Naderi
Department of Industrial Engineering, Faculty of Engineering, Kharazmi University, Tehran, Iran
Abstract
This paper considers the problem of university course timetabling. In this problem, there are a set of courses, lecturers and classrooms. The objective is to assign schedule courses so as to maximize the total preference of lecturer-course, lecturer-day and course-day. The paper first formulates the problem in form of linear integer programming model. Using the model and commercial software, the small sized instances are optimally solved. Then, the paper proposes three different algorithms based on imperialist competitive algorithm, simulated annealing and variable neighborhood search. The algorithms employ several novel procedures such as encoding scheme, move operator, crossing operators. The algorithms are tuned and evaluated with optimal solutions found by the model. Then, they are evaluated by comparing their performance. The results show that imperialist competitive algorithm outperforms the other algorithms.
Keywords
University course scheduling; mathematical model; Metaheuristics
Main Subjects
Metaheuristics Algorithms; Scheduling
Statistics
Article View: 72
PDF Download: 227
Home | Glossary | News | Aims and Scope | Sitemap
Top Top


This work is licensed under a Creative Commons Attribution - Non-commercial 3.0

Journal Management System. Designed by sinaweb.