UNIVERSITY COURSE TIMETABLING USING CONSTRAINT PROGRAMMING

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SHAHMORADI HADI; KETABI SAEIDEH; ESMAELIAN MAJID

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2017 | Volume:8 | Issue:1 (14) Page(s): 119-137

Download Full-Text

Persian Verion

View:

1,464

Download:

Cites:

Information Journal Paper

Title

UNIVERSITY COURSE TIMETABLING USING CONSTRAINT PROGRAMMING

Author(s)

SHAHMORADI HADI | KETABI SAEIDEH | ESMAELIAN MAJID | Issue Writer Certificate

Keywords

CONSTRAINT PROGRAMMINGQ1

TIMETABLINGQ1

CONSTRAINT SATISFACTION PROBLEMQ1

HARD CONSTRAINTQ1

SOFT CONSTRAINTQ1

Abstract

University course TIMETABLING problem is a challenging and time-consuming task on the overall structure of timetable in every academic environment. The problem deals with many factors such as the number of lessons, classes, teachers, students and working time, and these are influenced by some hard and SOFT CONSTRAINTs. The aim of solving this problem is to assign courses and classes to teachers and students, so that the restrictions are held. In this paper, a CONSTRAINT PROGRAMMING method is proposed to satisfy maximum constraints and expectation, in order to address university TIMETABLING problem. For minimizing the penalty of SOFT CONSTRAINTs, a cost function is introduced and AHP method is used for calculating its coefficients. The proposed model is tested on department of management, University of Isfahan dataset using OPL on the IBM ILOG CPLEX Optimization Studio platform. A statistical analysis has been conducted and shows the performance of the proposed approach in satisfying all HARD CONSTRAINTs and also the satisfying degree of the SOFT CONSTRAINTs is on maximum desirable level. The running time of the model is less than 20 minutes that is significantly better than the non-automated ones.

Cites

No record.

References

No record.

Cite

APA: Copy

SHAHMORADI, HADI, KETABI, SAEIDEH, & ESMAELIAN, MAJID. (2017). UNIVERSITY COURSE TIMETABLING USING CONSTRAINT PROGRAMMING. PRODUCTION AND OPERATIONS MANAGEMENT, 8(1 (14) ), 119-137. SID. https://sid.ir/paper/217586/en

Vancouver: Copy

SHAHMORADI HADI, KETABI SAEIDEH, ESMAELIAN MAJID. UNIVERSITY COURSE TIMETABLING USING CONSTRAINT PROGRAMMING. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2017;8(1 (14) ):119-137. Available from: https://sid.ir/paper/217586/en

IEEE: Copy

HADI SHAHMORADI, SAEIDEH KETABI, and MAJID ESMAELIAN, “UNIVERSITY COURSE TIMETABLING USING CONSTRAINT PROGRAMMING,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 8, no. 1 (14) , pp. 119–137, 2017, [Online]. Available: https://sid.ir/paper/217586/en

Related Journal Papers