•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • ProfDoc
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • ProfDoc
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Fortnightly course scheduling problem: a case study

Author:
محمد رنجبر
,
سلیم رستمی
,
Mohammad Ranjbar
,
Salim Rostami
Year
: 2012
Abstract: This paper studies a fortnightly university course timetabling problem. In this research, the Industrial Engineering Department of Ferdowsi University of Mashhad (Iran) is considered as the case study for investigation. An integer linear programming model is developed for the problem and is solved using ILOG CPLEX 12.1 solver. Also, a branch-and-bound algorithm is developed to find optimal solutions in which both lecturers and students\\\\\\\\\\\\\\' preferences are considered. Regarding to the limited size of the case study, the computational results indicate that the developed algorithm is efficient and is able to find good solutions in a reasonable time.
URI: https://libsearch.um.ac.ir:443/fum/handle/fum/3382830
Keyword(s): Fortnightly timetabling problem,integer linear programming,branch-and-bound
Collections :
  • ProfDoc
  • Show Full MetaData Hide Full MetaData
  • Statistics

    Fortnightly course scheduling problem: a case study

Show full item record

contributor authorمحمد رنجبرen
contributor authorسلیم رستمیen
contributor authorMohammad Ranjbarfa
contributor authorSalim Rostamifa
date accessioned2020-06-06T14:06:41Z
date available2020-06-06T14:06:41Z
date copyright5/16/2012
date issued2012
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/3382830
description abstractThis paper studies a fortnightly university course timetabling problem. In this research, the Industrial Engineering Department of Ferdowsi University of Mashhad (Iran) is considered as the case study for investigation. An integer linear programming model is developed for the problem and is solved using ILOG CPLEX 12.1 solver. Also, a branch-and-bound algorithm is developed to find optimal solutions in which both lecturers and students\\\\\\\\\\\\\\' preferences are considered. Regarding to the limited size of the case study, the computational results indicate that the developed algorithm is efficient and is able to find good solutions in a reasonable time.en
languageEnglish
titleFortnightly course scheduling problem: a case studyen
typeConference Paper
contenttypeExternal Fulltext
subject keywordsFortnightly timetabling problemen
subject keywordsinteger linear programmingen
subject keywordsbranch-and-bounden
identifier linkhttps://profdoc.um.ac.ir/paper-abstract-1029293.html
conference title5th International Conference of Iranian Operations Research Societyen
conference locationتبریزfa
identifier articleid1029293
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace