#### Filter Results:

#### Publication Year

2004

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

- Salwani Abdullah, Samad Ahmadi, Edmund K Burke, Moshe Dror
- 2004

Since the 1960's, automated approaches to examination timetabling have been explored and a wide variety of approaches have been investigated and developed. In this paper we build upon a recently presented, sequential solution improvement technique which searches efficiently over a very large set of 'adjacent' (neighbourhood) solutions. This solution search… (More)

of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such an algorithm for university course timetabling. This problem is concerned with the assignment of lectures to specific timeslots and rooms. For a solution to be feasible, a number of hard… (More)

- Salwani Abdullah, Edmund K Burke, Barry Mccollum
- 2005

The course timetabling problem deals with the assignment of a set of courses to specific timeslots and rooms within a working week subject to a variety of hard and soft constraints. Solutions which satisfy the hard constraints are called feasible. The goal is to satisfy as many of the soft constraints as possible whilst constructing a feasible schedule. In… (More)

- Salwani Abdullah, Edmund K Burke, Barry Mccollum
- 2005

The university course timetabling problem consists, in essence, of assigning lectures to a specific timeslot and room. The goal is to satisfy as many soft constraints as possible while constructing a feasible schedule. In this paper, we present a variable neighbourhood search approach with an exponential monte carlo acceptance criteria. This heuristic… (More)

- G C Mccollum, P J Mcmullan, A J Parkes, E K Burke, Salwani Abdullah, B Mccollum +1 other
- 2009

A two phased approach incorporating the extended great deluge technique is detailed in relation to the Examination Timetabling Problem as described in the 2 nd International Timetabling Competition (ITC2007). The approach proves to be both robust and general. Robust in the sense that it is capable of producing six of the best results published in literature… (More)

- Majdi Mafarja, Salwani Abdullah
- 2013

Attribute reduction is the process of selecting a minimal attribute subset from a problem domain while retaining a suitably high accuracy in representing the original attributes. In this work, we propose a new attribute reduction algorithm called record-to-record travel (RRT) algorithm and employ a rough set theory as a mathematical tool to evaluate the… (More)