A GENETIC ALGORITHM FOR FLOWSHOP SEQUENCING

被引：579
作者：
REEVES, CR
机构：
[1] Department of Statistics and Operational Research, Coventry University, Coventry, CV1 5FB England, Priory Street
来源：
COMPUTERS & OPERATIONS RESEARCH | 1995年 / 22卷 / 01期
关键词：
D O I：
10.1016/0305-0548(93)E0014-K
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
The basic concepts of Genetic Algorithms are described, following which a Genetic Algorithm is developed for finding (approximately) the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem. The performance of the algorithm is then compared with that of a naive Neighbourhood Search technique and with a proven Simulated Annealing algorithm on some carefully designed sets of instances of this problem.
引用
收藏
页码：5 / 13
页数：9
相关论文
共 19 条
  • [1] Ackley David H., 1987, GENETIC ALGORITHMS S, P170
  • [2] SIMULATED VERSUS REAL LIFE DATA IN TESTING THE EFFICIENCY OF SCHEDULING ALGORITHMS
    AMAR, AD
    GUPTA, JND
    [J]. IIE TRANSACTIONS, 1986, 18 (01) : 16 - 25
  • [3] Davis L, 1987, GENETIC ALGORITHMS S
  • [4] Davis L. E.., 1991, HDB GENETIC ALGORITH
  • [5] Garey M. R., 1979, COMPUTERS INTRACTIBI
  • [6] Goldberg DE, 1989, GENETIC ALGORITHMS S
  • [7] OPTIMIZATION OF CONTROL PARAMETERS FOR GENETIC ALGORITHMS
    GREFENSTETTE, JJ
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1986, 16 (01): : 122 - 128
  • [8] HOLLAND JH, 1976, ADAPTATION NATURAL A
  • [9] Kan A. R., 2012, MACHINE SCHEDULING P, DOI DOI 10.1016/0377-2217(77)90029-7
  • [10] OPTIMIZATION BY SIMULATED ANNEALING
    KIRKPATRICK, S
    GELATT, CD
    VECCHI, MP
    [J]. SCIENCE, 1983, 220 (4598) : 671 - 680
12