File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A clique-based algorithm for constructing feasible timetables

TitleA clique-based algorithm for constructing feasible timetables
Authors
Liu, YZhang, DChin, FYL
Keywordsclique
feasible timetable
heuristic
sequential techniques
timetabling
Issue Date2011
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/10556788.asp
Citation
Optimization Methods And Software, 2011, v. 26 n. 2, p. 281-294 How to Cite?
DOI: http://dx.doi.org/10.1080/10556781003664739
AbstractConstructing a feasible solution, where the focus is on 'hard' constraints only, is an important part of solving timetabling problems. For the University Course Timetabling Problem, we propose a heuristic algorithm to schedule events to timeslots based on cliques, each representing a set of events that could be scheduled in the same timeslot, which the algorithm constructs. Our algorithm has been tested on a set of well-known instances, and the experimental results show that our algorithm is efficient and can compete with other effective algorithms. © 2011 Taylor & Francis.
Persistent Identifierhttp://hdl.handle.net/10722/129976
ISSN
1055-6788
2021 Impact Factor: 1.832
2020 SCImago Journal Rankings: 0.789
ISI Accession Number ID
WOS:000287492300007
Funding AgencyGrant Number
National Nature Science Foundation of China60773126
Province Nature Science Foundation of FujianA0710023
Funding Information:

The authors thank the anonymous referees for their helpful comments and suggestions which contributed to improvement of the presentation and the contents of this paper. This work was supported by the National Nature Science Foundation of China (Grant no. 60773126) and the Province Nature Science Foundation of Fujian (Grant no. A0710023).

References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorLiu, Yen_HK
dc.contributor.authorZhang, Den_HK
dc.contributor.authorChin, FYLen_HK
dc.date.accessioned2010-12-23T08:45:04Z-
dc.date.available2010-12-23T08:45:04Z-
dc.date.issued2011en_HK
dc.identifier.citationOptimization Methods And Software, 2011, v. 26 n. 2, p. 281-294en_HK
dc.identifier.issn1055-6788en_HK
dc.identifier.urihttp://hdl.handle.net/10722/129976-
dc.description.abstractConstructing a feasible solution, where the focus is on 'hard' constraints only, is an important part of solving timetabling problems. For the University Course Timetabling Problem, we propose a heuristic algorithm to schedule events to timeslots based on cliques, each representing a set of events that could be scheduled in the same timeslot, which the algorithm constructs. Our algorithm has been tested on a set of well-known instances, and the experimental results show that our algorithm is efficient and can compete with other effective algorithms. © 2011 Taylor & Francis.en_HK
dc.languageengen_US
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/10556788.aspen_HK
dc.relation.ispartofOptimization Methods and Softwareen_HK
dc.rightsThis is an electronic version of an article published in [Optimization Methods And Software, 2011, v. 26 n. 2, p. 281-294]. [Optimization Methods And Software] is available online at: http://www.informaworld.com/smpp/ with the open URL of your article.-
dc.subjectcliqueen_HK
dc.subjectfeasible timetableen_HK
dc.subjectheuristicen_HK
dc.subjectsequential techniquesen_HK
dc.subjecttimetablingen_HK
dc.titleA clique-based algorithm for constructing feasible timetablesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=ISSN: 1029-4937 (electronic)&volume=&spage=&epage=&date=2010&atitle=A+clique-based+algorithm+for+constructing+feasible+timetablesen_US
dc.identifier.emailChin, FYL:chin@cs.hku.hken_HK
dc.identifier.authorityChin, FYL=rp00105en_HK
dc.description.naturepostprint-
dc.identifier.doi10.1080/10556781003664739en_HK
dc.identifier.scopuseid_2-s2.0-79951917201en_HK
dc.identifier.hkuros178317en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79951917201&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume26en_HK
dc.identifier.issue2en_HK
dc.identifier.spage281en_HK
dc.identifier.epage294en_HK
dc.identifier.eissn1029-4937-
dc.identifier.isiWOS:000287492300007-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridLiu, Y=37016649000en_HK
dc.identifier.scopusauthoridZhang, D=36676066600en_HK
dc.identifier.scopusauthoridChin, FYL=7005101915en_HK
dc.identifier.citeulike8891998-
dc.identifier.issnl1026-7670-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats