Ant system based optimization algorithm and its applications in identical parallel machine scheduling

Journal of Systems Engineering and Electronics

Volumn 13, Issue 3, 2002, Pages 78-85

  Chen, Yibao ^a   Yao, Jianchu ^a   Zhong, Yifang ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Ant system; Combinatorial optimization; Genetic algorithm; Identical parallel machine; Scheduling; Simulated annealing

Indexed keywords

ANT SYSTEM; COMBINATORIAL OPTIMIZATION; IDENTICAL PARALLEL MACHINE; MAKESPAN;

GENETIC ALGORITHMS; OPTIMIZATION; SIMULATED ANNEALING;

SCHEDULING;

EID: 0036759827     PISSN: 16711793     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Sethi R. On the Complexity of Mean Flow Time Scheduling. Mathematics of Operations Research, 1977, 2(4): 320-330.
2. Garey M R, Johnson D S. Computer and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W H Freeman, 1979.
3. Potts C N. Analysis of a Linear Programming Heuristic for Scheduling Unrelated Parallel Machines. Discrete Applied Mathematics, 1983, 10(2): 155.
4. Bernstein D, Pinter R Y, Rodeh M. Optimal Scheduling of Arithmetic Operations in Parallel with Memory. New York: The Annual ACM Symposium on Principles of Programming Languages, 1985.
5. Luh P B, Hoitomt D J, Max E. Parallel Machine Scheduling Using Lagrangian Relaxation. IEEE International Conference on Computer Integrated Manufacturing, 1988: 244.
6. Narahari Y, Srigopal R. Real-World Extensions to Scheduling Algorithms Based on Lagrangian Relaxation. Proceedings in Engineering Science 21st, 1996: 415.
7. Blazewicz J, Dror M, Weglarz J. Mathematical Programming Formulations for Machine Scheduling: A Survey. European Journal of Operational Research, 1991, 51(3): 283-300.
8. Blackstone H G, Phillips E T, Hogg G L. The State-of-Art Survey of Dispatching Rules for Manufacturing Job Shop Operations. International Journal of Production Research, 1982, 20(1): 27-45.
9. Dorigo M, Di Caro G, Gambardella L M. Ant Algorithms for Distributed Discrete Optimization. Artif. Life, 1999, 5(2): 137-172.
10. Dorigo M, Gambardella L M. Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Trans. Evolutionary Comput., 1997, 1: 53-66.
11. Dorigo M, Bonabeau Eric, Theraulaz Guy. Ant Algorithm and Stigmergy. Future Generation Computer Systems, 2000, 16: 851-871.
12. Dorigo M, Maniezzo V, Colorni A. The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Trans. Systems, Man and Cybernet., 1996, 26: 29-41.
13. Feo Th A, Resende M G C. Greedy Randomized Adaptive Search Procedures. J. Global Optimization, 1995, 6: 109-133.
14. Gambardella L M, Dorigo M. Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem. Proceedings of the 12th International Conference on Machine Learning, ML'95, Morgan Kaufmann, Palo Alto, CA, 1995: 252-260.
15. Rosenkrantz D J, Stearns R E, Lewis P M. An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM Journal of Computing, 1977, 6: 563-581.
16. Davis L, Editor. Genetic Algorithms and Simulated Annealing Los. Altas, CA: Morgan Kaufmann, 1987.
17. Michalewicz Z. Genetic Algorithms + Data Structure = Evolution Programs. Berlin: Springer, 1992.