Improved artificial immune algorithm and its application on the permutation flow shop sequencing problems

Information Technology Journal

Volumn 6, Issue 6, 2007, Pages 929-933

  Haichang, Gao ^a   Xiyang, Liu ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Artificial immune algorithm; Optimization; Permutation flow shop sequencing

Indexed keywords

ALGORITHMS; ANTIBODIES; ANTIGENS; SCHEDULING; SIMULATED ANNEALING;

ARTIFICIAL IMMUNE ALGORITHM (AIA); MEMORY CELLS; PERMUTATION FLOW SHOP SEQUENCING;

ARTIFICIAL INTELLIGENCE;

EID: 34648830844     PISSN: 18125638     EISSN: 18125646     Source Type: Journal    
DOI: 10.3923/itj.2007.929.933     Document Type: Article

References (12)

1. Allahverdi, A., 2000. Minimizing mean flow time in a two-machine flowshop with sequence-independent setup times. Comput. Operat. Res., 27: 111-127.
2. Barbara, D., J. Couto and Y. Li, 2002. COOLCAT: An entropy-based algorithm for clustering. In: Proceedings of the 11th international Conference on Information and Knowledge Management, pp: 582-589.
3. Burdett, R.L. and E. Kozan, 2000. Evolutionary algorithms for flowshop sequencing with non-unique jobs. Int. Trans. Opeeat. Res., 7: 401-418.
4. Chun, J.S., 1997. Optimal Design of Synchronous Motor with parameter correction using immune algorithm. Proc IEEE Int. Electric Machines and Drives Conference. Milwaukee, WI, USA., IB2:2:1-2.3
5. Dasgupta, D. and N. Attoh-Okine, 1997. Immunity-based system: A survey. Proc. IEEE Int. Conf. on System, Man and Cybernetics, Orlando, FL, USA., No. 1, pp: 869-874.
6. Garey, M.R., D.S. Johnson and R. Sethi, 1976. The complexity of flow shop and job shop scheduleing. Math. Operat. Res., 1:117-129.
7. Nawaz, M., E. Enscore Jr. and I. Ham, 1983. A heuristic algorithms for the m-machine n-job flow-shop sequencing problem. Omega. Int. J. Manage. Sci., 11:91-95.
8. Osman, I.H. and C.N. Potts, 1989. Simulated annealing for permutation flow shop scheduling. OMEGA., 17:551-557.
9. Pelikan, M. and D.E. Goldberg, 2002. A survey of optimization by building and using probabilistic models. Comput. Optimizat. Applic., 21: 5-20.
10. Reeves, CR., 1995. A genetic algorithms for flow shop sequencing. Comput. Operat. Res., 22: 5-13.
11. Tailland, E., 1990. Some efficient heuristic methods for the flow shop sequencing problems. Eur. J. Operat. Res., 47: 65-74.
12. Tailland, E., 1993. Benchmark for basic scheduling problems. Eur. J. Operat. Res., 64: 278-285.