Production scheduling with a memetic algorithm
by Peter Korosec, Gregor Papa, Vida Vukasinovic
International Journal of Innovative Computing and Applications (IJICA), Vol. 2, No. 4, 2010

Abstract: When dealing with real-world problems, it turns out that there are many specifics of the problem we are trying to solve. Since many algorithms that are being developed are evaluated and compared on test benchmark problems, they can simulate real-world problems up to some degree and specifics are not presumed and tested. To make algorithms efficient, such specifics need to be considered and included in the problem solving. In this paper, a real-world production scheduling problem is addressed. A typical approach with genetic algorithm turned out to be insufficient due to added complexity of many specifics. To successfully solve this problem, a memetic algorithm, which uses problem-specific local search procedures to improve solutions acquired by genetic algorithm, is proposed. It is shown that the use of such local search procedures can significantly improve the effectiveness and efficiency of the algorithm.

Online publication date: Tue, 09-Nov-2010

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 International Journal of Innovative Computing and Applications (IJICA):
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