작업일정계획문제 해결을 위한 유전 알고리듬의 응용 Application of Genetic Algorithm to a Job Scheduling Problem

Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0,1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.
Publisher
한국경영과학회
Issue Date
1992
Language
KOR
Citation

JOURNAL OF THE KOREAN OR/MS SOCIETY, v.17, no.3, pp.1 - 12

ISSN
1225-1119
URI
http://hdl.handle.net/10203/65884
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 179
  • Download : 0
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0