Genetic algorithms and job shop scheduling
Proceedings of the 12th annual conference on Computers and industrial engineering
Scheduling manufacturing systems
Computers in Industry
A genetic algorithm for family and job scheduling in a flowline-based manufacturing cell
ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
Intensification and diversification with elite tabu search solutions for the linear ordering problem
Computers and Operations Research
The ant colony optimization meta-heuristic
New ideas in optimization
Scheduling by Genetic Local Search with Multi-Step Crossover
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Genetic algorithms, path relinking, and the flowshop sequencing problem
Evolutionary Computation
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Schema and solutions for decentralised multi-project scheduling problem
International Journal of Computer Applications in Technology
An improved multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem
International Journal of Computer Applications in Technology
Hi-index | 0.00 |
Nowadays, in modern manufacturing, the trend is the development of Computer Integrated Manufacturing (CIM). The productivity of CIM is highly depending on the scheduling of Flexible Manufacturing System (FMS). Shortening the makespan leads to decreasing machines idle time, which results in improvement in CIM productivity. This paper proposes a meta-heuristic approach called Ant Colony Optimisation (ACO) method for scheduling optimisation of FMSs by considering multiple objectives, i.e., minimising the idle time of the machine and minimising the total penalty cost for not meeting the due date concurrently. The results available for the various existing meta-heuristic methods (Jerald et al., 2005) are compared with results obtained by ACO method.