Optimization of job scheduling in a machine shop using genetic algorithm
As job scheduling involves allocation of jobs to machines to reduce the idle time of machines, the aim of this work emphasises on minimizing the cycle time by using genetic algorithm (GA). Each job has a pre-determined process sequence and the sequences are decided according to metal cutting theory...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
2002
|
| Subjects: | |
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-0037507614&partnerID=40&md5=d191a355459a40cc6228cbdbec23a23b http://eprints.utp.edu.my/10073/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | As job scheduling involves allocation of jobs to machines to reduce the idle time of machines, the aim of this work emphasises on minimizing the cycle time by using genetic algorithm (GA). Each job has a pre-determined process sequence and the sequences are decided according to metal cutting theory and technological constraints. A modified version of GA known as string GA has been used to get the near optimal cycle time for permutation analysis. An experiment has been carried out with 2 iv 5 resolution to find the significance of five parameters of GA, namely population size, maximum generation, probability of crossing, probability of mutation and crossover operators. Computer runs were carried out with these parameters at various levels and the results indicated that, only probability of mutation, the combined effect of maximum generation and probability of crossing are significant at 10. It is suggested that the minimum values of these parameters be used for scheduling problems. |
|---|