Affiliation:
1. Allameh Tabataba’i University, Iran
Abstract
In this paper, cellular manufacturing scheduling problems are studied. The objective is to minimize makespan (Cmax) considering part family in the manufacturing cell flow line where the setup times are sequence dependent. Minimizing Cmax will result in the increment of output rate and the speed of manufacturing systems which is the main goal of such systems. This problem is solved using Ant Colony Optimization (ACO), Genetic Algorithm (GA) operators, and local search technique. To show the validity of proposed approach, it is compared with a tailor-made heuristic algorithm, called SVS. The obtained results indicate that the proposed method is quite fast and efficient.
Subject
Decision Sciences (miscellaneous),Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Computer Science Applications,Modeling and Simulation,Statistics and Probability
Reference38 articles.
1. Scheduling groups of jobs in the two-machine flow shop
2. Chien, C. H. (1997). Scheduling in a flow line manufacturing cells system considering intercellular parts: The tabu search approach (Unpublished doctoral dissertation). University of Texas, Arlington, TX.
3. An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system
4. The ant colony optimization meta-heuristic;M.Dorigo;New ideas in optimization,1999
5. Ant Colony Optimization
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献