The bees algorithm for workload balancing in examination job assignment

Adil Baykasoglu, Lale Ozbakir and Pinar Tapkan

European Journal of Industrial Engineering, 2009, vol. 3, issue 4, 424-435

Abstract: In this paper, an integer quadratic programming model is proposed for workload balancing in the examination job assignment problem. The proposed model can be classified as part of the 'Generalised Assignment Problem' or GAP, which is known as an NP-hard problem. To solve the proposed model, a relatively new member of the swarm intelligence family known as the Bees Algorithm (BA) is used. The proposed mathematical model is also solved for nine sets of randomly generated test problems with a very well-known classical optimiser (CPLEX 10.1-MIQP) to present the competitive performance of the BA algorithm. The obtained results show that the proposed BA algorithm is able to generate better solutions with much shorter computational times. [Received 07 February 2008; Revised 06 May 2008; Accepted 19 December 2008]

Keywords: assignment problems; workload balancing; metaheuristics; swarm optimisation; bees algorithm; swarm intelligence; integer quadratic programming; mathematical modelling; examinations; job assignment; exams. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=27035 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:3:y:2009:i:4:p:424-435

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().