1. Abbass, H.A., 2001a. A monogenous MBO approach to satisfiability. In: Proceeding of the International Conference on Computational Intelligence for Modeling, Control and Automation, CIMCA’2001, Las Vegas, NV, USA.
2. Abbass, H.A., 2001b. Marriage in honey-bee optimization (MBO): A haplometrosis polygynous swarming approach, Seoul, Korea, CEC2001, pp. 207–214.
3. Abdullah, S., Burke, E.K., 2006. A multi-start large neighbourhood search approach with local search methods for examination timetabling. In: Long, D., Smith, S.F., Borrajo, D., McCluskey, L. (Eds.), ICAPS 2006, Cumbria, UK, pp. 334–337.
4. Abdullah, S., Turabieh, H., 2008. Generating university course timetable using genetic algorithm and local search. In: Proceeding of the 3rd International Conference on Hybrid Information Technology, pp. 254–260.
5. Abdullah, S., Burke, E.K., McCollum, B., 2005. An investigation of variable neighbourhood search for university course timetabling. In: The 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA05), pp. 413–427.