| Campbell, H, Dudek, R and Smith M (1970). A Heuristic Algorithm for the n-Job m-Machine Sequencing Problem, Management Science, Vol.16B, 630-637. |
....job sequences directly as chromosomes (the candidate solutions) that then constitute the members of a GA population. Subsequently, each individual (a schedule) is merited by its fitness (e.g. by its makespan value) For a flowshop a chromosome would represent a job sequence on a machine, such as [1 3 2 4 5]. Fitness evaluation for a sequence would go, for instance, as the smaller its makespan, the fitter it is. In each generation the fittest chromosomes are encouraged to reproduce while the least fit die. A mutation in a parent chromosome may be an adjacent pairwise interchange of jobs or some ....
Campbell, H, Dudek, R and Smith M (1970). A Heuristic Algorithm for the n-Job m-Machine Sequencing Problem, Management Science, Vol.16B, 630-637.
....(Dudek et al. 1992) In addition a great deal of previous research has been done that provides a basis for comparisons among alternative approaches, old and new. Despite the large amount of research directed at flow shop instances most of the work has been applied to the permutation problem (Campbell et al. 1970, Dannenbring 1977, Nawaz et al. 1983, Widmer and Hertz 1989, Taillard 1990, Ho and Chang 1991, Reeves 1995, Carlier and Rebai 1996, Nowicki and Smutnicki 1996a, Yamada and Reeves 1997, Reeves and Yamada 1998) with as yet very little work on non permutation solutions (Nabeshima 1971, Krone and ....
Campbell, H. C., Dudek, R. A. and Smith, M. L. (1970) A Heuristic Algorithm for the n Job m Machine Sequencing Problem, Management Science, June, 16(10), B630-B637.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC