A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines

Artificial Intelligence in Engineering

Volumn 13, Issue 4, 1999, Pages 399-403

  Min, Liu ^a   Cheng, Wu ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

Combinatorial optimization; Genetic algorithm; Heuristic procedure; Identical parallel machine; Scheduling problem; Simulated annealing

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; SIMULATED ANNEALING;

IDENTICAL PARALLEL MACHINES;

PARALLEL PROCESSING SYSTEMS;

EID: 0033349136     PISSN: 09541810     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0954-1810(99)00021-7     Document Type: Article

References (17)

1. Sethi R. On the complexity of mean flow time scheduling. Mathematics of Operations Research 1977;2(4):320-30.
2. Garey MR, Johnson DS. Computer and intractability: a guide to the theory of NP-completeness, San Francisco: W H Freeman, 1979.
3. Potts CN. Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Applied Mathematics 1983;10(2):155-64.
4. Bernstein D, Pinter RY, Roden M. Optimal scheduling of arithmetic operations in parallel with memory, The Annual ACM Symposium on Principles of Programming Languages, New York, 1985.
5. Luh PB, Hoitomt DJ, Max E. Parallel machine scheduling using Lagrangian relaxation. IEEE International Conference on Computer Integrated Manufacturing, New York, 1988. pp. 244-8.
6. Narahari Y, Srigopal R. Real-world extensions to scheduling algorithms based on Lagrangian relaxation. Proceedings in Engineering Sciences 21st, 1996. pp. 415-33.
7. Cheng TCE, Sin CCS. State-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research 1990;47(3):271-92.
8. Blazewicz J, Dror M, Weglarz J. Mathematical programming formulations for machine scheduling, a survey. European Journal of Operational Research 1991;51(3):283-300.
9. Blackstone HG, Phillips ET, Hogg GL. The state-of-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research 1982;20(1):27-45.
10. Michalewicz Z. Genetic algorithms + data structure = evolution programs, Berlin: Springer, 1992.
11. Lae J, Park CH. Application of genetic algorithm to job shop scheduling problems with active schedule constructive crossover. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1995. pp. 530-5.
12. Gilkinson JC, Rabelo LC, Bush BO. Real-world scheduling problem using genetic algorithms. Computers & Industrial Engineering 1995;29(1-4):177-81.
13. Biegel JE, Davem JJ. Genetic algorithms and job shop scheduling. Computers & Industrial Engineering 1990;19(1-4):81-91.
14. Wang PC, Korfhage W. Process scheduling using genetic algorithms. Proceedings of IEEE Symposium on Parallel and Distributed Processing, 1995. pp. 638-41.
15. Sannomiya N, lima H. Application of genetic algorithm to scheduling problems in manufacturing processes. Proceedings of the IEEE Conference on Evolutionary Computation, 1996. pp. 523-8.
16. Davis L, editor. Genetic algorithms and simulated annealing Los Altas, CA: Morgan Kaufmann, 1987.
17. Brindle A. Genetic algorithms for function optimization: Doctoral dissertation. University of Alberta, 1981.