DSpace Repository

Effective computational models for timetabling problem

Show simple item record

dc.contributor.author Nur Aidya Hanum Aizam
dc.date.accessioned 2014-05-18T07:28:54Z
dc.date.available 2014-05-18T07:28:54Z
dc.date.issued 2013
dc.identifier.uri http://dspace.psnz.umt.edu.my/xmlui/handle/123456789/3043
dc.description.abstract Timetabling is a table of information showing when certain events are scheduled to take place. Timetabling is in fact very essential in making sure that all events occur in the time and place required. It is critical in areas such as: education, production and manufacturing, sport competitions, transport and logistics. The difficulty in timetabling is satisfying all the restrictions and requirements. The restrictions relate to resources such as time and location as well as conflicts. The requirements relate to the preferences of customers and service providers. The problem is further complicated by the desire to optimize an objective function that usually relates to the cost or effectiveness of the schedule. The task of how to construct a high quality timetable which satisfies all requirements is definitely not an easy one. A further difficulty is the dynamic aspect of timetabling and the need to accommodate changes after the schedule has been announced. Our focus in this study is on university timetabling problems. en_US
dc.language.iso en en_US
dc.publisher Tesis Curtin University 2013 en_US
dc.subject BF 468 .N8 2013 en_US
dc.subject Nur Aidya Hanum Aizam en_US
dc.subject Tesis Curtin University 2013 en_US
dc.subject Time perspective en_US
dc.title Effective computational models for timetabling problem en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account