USING FUZZY C-MEANS CLUSTERING ALGORITHM FOR COMMON LECTURER TIMETABLING AMONG DEPARTMENTS

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.

Babaei Hamed; Karimpour Jaber; MAVIZI SAJJAD

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

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY Year:2017 | Volume:3 | Issue:1 Page(s): 45-64

Download Full-Text

View:

259

Download:

198

Cites:

Information Journal Paper

Title

USING FUZZY C-MEANS CLUSTERING ALGORITHM FOR COMMON LECTURER TIMETABLING AMONG DEPARTMENTS

Author(s)

Babaei Hamed | Karimpour Jaber | MAVIZI SAJJAD | Issue Writer Certificate

Keywords

INDEX TERMS-COMMON LECTURER TIMETABLING PROBLEM (CLTTP)

FUZZY C-MEANS CLUSTERING ALGORITHMS

MULTI-AGENT SYSTEMS

UNIVERSITY COURSE TIMETABLING PROBLEM (UCTTP)

Abstract

University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of common lecturers among departments and then minimize the loss of resources within departments. The applied method is to use a collaborative search approach. In this method, at first all departments perform their scheduling process locally; then two clustering and traversing agents are used where the former is to cluster common lecturers among departments and the latter is to find unused resources among departments. After performing the clustering and traversing processes, the mapping operation in done based on principles of common lecturers constraint in redundant resources in order to gain the objectives of the problem. The problem’s evaluation metric is evaluated via using fuzzy c-means clustering algorithm on common lecturer constraints within a multi agent system. An applied dataset is based on meeting the requirements of scheduling in real world among various departments of Islamic Azad University, Ahar Branch and the success of results would be in respect of satisfying uniform distribution and allocation of common lecturers on redundant resources among different departments.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Babaei, Hamed, Karimpour, Jaber, & MAVIZI, SAJJAD. (2017). USING FUZZY C-MEANS CLUSTERING ALGORITHM FOR COMMON LECTURER TIMETABLING AMONG DEPARTMENTS. JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY, 3(1), 45-64. SID. https://sid.ir/paper/346279/en

Vancouver: Copy

Babaei Hamed, Karimpour Jaber, MAVIZI SAJJAD. USING FUZZY C-MEANS CLUSTERING ALGORITHM FOR COMMON LECTURER TIMETABLING AMONG DEPARTMENTS. JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY[Internet]. 2017;3(1):45-64. Available from: https://sid.ir/paper/346279/en

IEEE: Copy

Hamed Babaei, Jaber Karimpour, and SAJJAD MAVIZI, “USING FUZZY C-MEANS CLUSTERING ALGORITHM FOR COMMON LECTURER TIMETABLING AMONG DEPARTMENTS,” JOURNAL OF ADVANCES IN COMPUTER ENGINEERING AND TECHNOLOGY, vol. 3, no. 1, pp. 45–64, 2017, [Online]. Available: https://sid.ir/paper/346279/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops