Comparison of different tabu search operators on a highly constrained industrial problem
by David Duvivier, Olivier Roux, Arnauld Hanset
International Journal of Advanced Operations Management (IJAOM), Vol. 1, No. 4, 2009

Abstract: In the context of limited time decision making, this paper presents the results of a tabu search method applied to a discrete-continuous highly constrained industrial scheduling problem. The aim of this work is to generate the most suitable scheduling strategy according to the decision makers' preferences. In order to achieve this goal, a framework has been implemented to schedule the products thanks to several optimisation and simulation methods. The schedules are iteratively enhanced via a hybrid method composed of a meta-heuristic and a simulation model. This paper describes more precisely the results obtained with several operators embedded in a tabu search method. On the basis of several performance criteria, the presented study compares and ranks several scheduling strategies via a lexicographical sort.

Online publication date: Wed, 27-Jan-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 Advanced Operations Management (IJAOM):
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