File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/10556781003664739
- Scopus: eid_2-s2.0-79951917201
- WOS: WOS:000287492300007
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A clique-based algorithm for constructing feasible timetables
Title | A clique-based algorithm for constructing feasible timetables | ||||||
---|---|---|---|---|---|---|---|
Authors | |||||||
Keywords | clique feasible timetable heuristic sequential techniques timetabling | ||||||
Issue Date | 2011 | ||||||
Publisher | Taylor & 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? | ||||||
Abstract | Constructing 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 Identifier | http://hdl.handle.net/10722/129976 | ||||||
ISSN | 2023 Impact Factor: 1.4 2023 SCImago Journal Rankings: 1.001 | ||||||
ISI Accession Number ID |
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 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Y | en_HK |
dc.contributor.author | Zhang, D | en_HK |
dc.contributor.author | Chin, FYL | en_HK |
dc.date.accessioned | 2010-12-23T08:45:04Z | - |
dc.date.available | 2010-12-23T08:45:04Z | - |
dc.date.issued | 2011 | en_HK |
dc.identifier.citation | Optimization Methods And Software, 2011, v. 26 n. 2, p. 281-294 | en_HK |
dc.identifier.issn | 1055-6788 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/129976 | - |
dc.description.abstract | Constructing 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.language | eng | en_US |
dc.publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/10556788.asp | en_HK |
dc.relation.ispartof | Optimization Methods and Software | en_HK |
dc.rights | This 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.subject | clique | en_HK |
dc.subject | feasible timetable | en_HK |
dc.subject | heuristic | en_HK |
dc.subject | sequential techniques | en_HK |
dc.subject | timetabling | en_HK |
dc.title | A clique-based algorithm for constructing feasible timetables | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://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+timetables | en_US |
dc.identifier.email | Chin, FYL:chin@cs.hku.hk | en_HK |
dc.identifier.authority | Chin, FYL=rp00105 | en_HK |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1080/10556781003664739 | en_HK |
dc.identifier.scopus | eid_2-s2.0-79951917201 | en_HK |
dc.identifier.hkuros | 178317 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-79951917201&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 26 | en_HK |
dc.identifier.issue | 2 | en_HK |
dc.identifier.spage | 281 | en_HK |
dc.identifier.epage | 294 | en_HK |
dc.identifier.eissn | 1029-4937 | - |
dc.identifier.isi | WOS:000287492300007 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Liu, Y=37016649000 | en_HK |
dc.identifier.scopusauthorid | Zhang, D=36676066600 | en_HK |
dc.identifier.scopusauthorid | Chin, FYL=7005101915 | en_HK |
dc.identifier.citeulike | 8891998 | - |
dc.identifier.issnl | 1026-7670 | - |