A genetic algorithm for the job shop problem

Computers & Operations Research - Tập 22 Số 1 - Trang 15-24 - 1995
Federico Della Croce1, Roberto Tadei1, Giuseppe Volta1
1D.A.I., Politecnico di Torino, Corso Duca degli Abruzzi 24, 10129 Torino, Italy

Tóm tắt

Từ khóa


Tài liệu tham khảo

Lawler, 1989, Sequencing and scheduling: algorithms and complexity

Garey, 1976, The complexity of flowshop and job-shop scheduling, Math. Opl Res., 1, 117, 10.1287/moor.1.2.117

Muth, 1963

Nakano, 1991, Conventional genetic algorithm for job shop scheduling

Falkenauer, 1991, A genetic algorithm for job shop

Van Laarhoven, 1992, Job shop scheduling by simulated annealing, Opns Res., 40, 113, 10.1287/opre.40.1.113

Dell'Amico, 1993, Applying tabu search to the job shop scheduling problem, Ann. Ops Res., 41, 231, 10.1007/BF02023076

Holland, 1975

Dorigo, 1989, Genetic Algorithms: the state-of-the-art and some research proposals

De Jong, 1975, An analysis of the behaviour of a class of genetic adaptive systems

Davis, 1991

Goldberg, 1989

Goldberg, 1985, Alleles, loci and the traveling salesman problem

French, 1982

Syswerda, 1989, Uniform Crossover in genetic algorithms

Adams, 1988, The shifting bottleneck procedure for job shop scheduling, Mgmt Sci., 34, 391, 10.1287/mnsc.34.3.391

Lawrence, 1984

Applegate, 1991, A computational study of the job shop scheduling problem, ORSA J. Comput., 3, 149, 10.1287/ijoc.3.2.149