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

Authors:
S. Ayse Ozalp
Affiliations:
Department of Industrial Engineering, Uludag University, Gorukle Bursa, Turkey
Venue:
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
Year:
2005

Citing 5
Cited 2

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines

Computers and Operations Research
Parallel machine scheduling models with fuzzy processing times

Information Sciences—Informatics and Computer Science: An International Journal

A Web page classification system based on a genetic algorithm using tagged-terms as features

Expert Systems with Applications: An International Journal
Non-identical parallel machine scheduling using genetic algorithm

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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 GA in terms of coding, chromosome evaluation, crossover and mutation operators, are described in detail. After that, the GA is experimentally evaluated through some test problems. As the objective of the problem is the minimization of the completion time of the jobs, the GA based solution is compared with the Longest Processing Time (LPT) rule, and it is observed that the GA always produces better schedules than the LPT rule in a reasonably short amount of CPU time.