The bees algorithm for workload balancing in examination job assignment
by Adil Baykasoglu, Lale Ozbakir, Pinar Tapkan
European J. of Industrial Engineering (EJIE), Vol. 3, No. 4, 2009

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]

Online publication date: Mon, 13-Jul-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com