A genetic algorithm for scheduling of jobs on lines of press machines

Ozalp S. A.

LARGE-SCALE SCIENTIFIC COMPUTING, cilt.3743, ss.535-543, 2006 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 3743
  • Basım Tarihi: 2006
  • Doi Numarası: 10.1007/11666806_61
  • Dergi Adı: LARGE-SCALE SCIENTIFIC COMPUTING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Compendex, EMBASE, MathSciNet, Philosopher's Index, zbMATH
  • Sayfa Sayıları: ss.535-543
  • Çukurova Üniversitesi Adresli: Hayır

Özet

This paper introduces a Genetic Algorithm (GA) based solution technique for press machines scheduling problem of a car manufacturing factory. Firstly, the problem at hand, and the application of the CA in terms of coding, chromosome evaluation, crossover and Mutation operators, are described in detail. After that, the CA is experimentally evaluated through some test problems. As the objective of the problem is the minimization of the completion time of the jobs, the CA based solution is compared with the Longest Processing Time (LPT) rule, and it is observed that the CA always produces better schedules than the LPT rule in a reasonably short amount of CPU time.