A genetic algorithm for scheduling of jobs on lines of press machines
No Thumbnail Available
Date
2006
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Abstract
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.
Description
Bu çalışma, 06-10, Haziran 2005 tarihlerinde Sozopol[Bulgaristan]’da düzenlenen 5. International Conference on Large-Scale Scientific Computing (LSSC 2005) Kongresi‘nde bildiri olarak sunulmuştur.
Keywords
Computer science, Parallel machines, Scheduling, Program processors, Problem solving, Mutagens, Chromosomes, Press machines, Longest processing time (LPT) rule, Chromosome evaluation, Genetic algorithms
Citation
Özalp, S. A. (2006). ''A genetic algorithm for scheduling of jobs on lines of press machines''. ed. İ. Lirkov, S. Margenov, J. Wasniewski. Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, 3743, 535-543.