A genetic algorithm for flowshop sequencing

Garey, 1979

Rinnooy Kan, 1976

Holland, 1976

1987

Kirkpatrick, 1983, Optimisation by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671

van Laarhoven, 1987

Ogbu, 1990, The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem, Computers Ops Res., 17, 243, 10.1016/0305-0548(90)90001-N

Osman, 1989, Simulated annealing for permutation flow-shop scheduling, Omega, 17, 551, 10.1016/0305-0483(89)90059-5

Ogbu, 1991, Simulated annealing for the permutation flow-shop problem, Omega, 19, 64, 10.1016/0305-0483(91)90036-S

Goldberg, 1989

Reeves, 1991, An introduction to genetic algorithms

Ackley, 1987, An empirical study of bit vector function optimisation, 170

Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problems, Omega, 11, 91, 10.1016/0305-0483(83)90088-9

Amar, 1986, Simulated versus real life data in testing the efficiency of scheduling algorithms, IIE Trans., 18, 16, 10.1080/07408178608975325

Reeves, 1991, Improvements to the NEH heuristic for flowshop scheduling

Taillard, 1990, Some efficient heuristic methods for the flow shop sequencing problem, Eur. J. Opl Res., 47, 65, 10.1016/0377-2217(90)90090-X

E. Taillard, Benchmarks for basic scheduling problems. Eur. J. Opl Res. In press.

Frefenstette, 1986, Optimization of control parameters for genetic algorithms, IEEE Trans. Syst. Man Cybernet., SMC-16, 122, 10.1109/TSMC.1986.289288

1991