Harvard Business Review
A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Loading tools to machines in flexible manufacturing systems
Computers and Industrial Engineering
Computer-aided manufacturing
Computers and Industrial Engineering
Evaluation of alternative tool combinations in a flexible manufacturing system
Computers and Industrial Engineering
FMS tool change schemes and their characteristics
ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
A production planning model for flexible manufacturing systems with setup cost consideration
ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Using genetic algorithms in process planning for job shop machining
IEEE Transactions on Evolutionary Computation
Elitism-based compact genetic algorithms
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Robotics and Computer-Integrated Manufacturing
Hi-index | 0.00 |
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.