An integrated tool planning and production planning problem for flexible manufacturing systems using genetic algorithm
by Zubair M. Mohamed, Manish Bachlaus
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 2, No. 4, 2007

Abstract: This paper presents a novel concept of integrating tool planning and production planning problems in flexible manufacturing system. A mathematical objective function has been formulated that minimises the broad objectives of total costs comprising various parameters such as tool room capacity, tool budget, tool regrinding and procurement lead times, ordering, setup, holding and back-ordering costs of tools and parts. This paper explores the integrating notion by utilising the genetic-based search methodology. An illustrative example is taken into account for demonstrating the robustness of the proposed model. Genetic Algorithm (GA) has been implemented in the example under consideration and its performance is compared with Tabu Search (TS) and Simulated Annealing (SA). The extensive computations over the problems of varying complexities and dimensions prove the superiority of genetic algorithm. It has been observed that GA outperforms the standard algorithms (TS and SA) in the context of the underlying problem.

Online publication date: Tue, 12-Jun-2007

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 Intelligent Systems Technologies and Applications (IJISTA):
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