Fortnightly course scheduling problem: a case study

نویسنده:

سال

: 2012

چکیده: 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.

یو آر آی: http://libsearch.um.ac.ir:80/fum/handle/fum/3382830

کلیدواژه(گان): Fortnightly timetabling problem,integer linear programming,branch-and-bound

کالکشن :

ProfDoc

نمایش متادیتا پنهان کردن متادیتا
آمار بازدید

Fortnightly course scheduling problem: a case study

contributor author	محمد رنجبر	en
contributor author	سلیم رستمی	en
contributor author	Mohammad Ranjbar	fa
contributor author	Salim Rostami	fa
date accessioned	2020-06-06T14:06:41Z
date available	2020-06-06T14:06:41Z
date copyright	5/16/2012
date issued	2012
identifier uri	http://libsearch.um.ac.ir:80/fum/handle/fum/3382830
description 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.	en
language	English
title	Fortnightly course scheduling problem: a case study	en
type	Conference Paper
contenttype	External Fulltext
subject keywords	Fortnightly timetabling problem	en
subject keywords	integer linear programming	en
subject keywords	branch-and-bound	en
identifier link	https://profdoc.um.ac.ir/paper-abstract-1029293.html
conference title	5th International Conference of Iranian Operations Research Society	en
conference location	تبریز	fa
identifier articleid	1029293