We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A SIMPLE GENETIC ALGORITHM FOR THE JOB-SHOP SCHEDULING PROBLEM.
- Authors
Lestan, Z.; Brezocnik, M.; Brezovnik, S.; Buchmeister, B.; Balic, J.
- Abstract
The Job-shop scheduling is concerned with arranging processes and resources. Proper schedules are very important for the manufacturers, but can cause serious problems because of the enormous solution space. Pressure from the competitive enterprises is the main reason why time is becoming one of the most important success factors. The goal in this paper is the development of an algorithm for the Job-shop scheduling problem, which is based only on genetic algorithms. Our intention is to prove, that even a very simple genetic algorithm is capable for Jobshop scheduling. The effectiveness of the algorithm is demonstrated by solving practical problems.
- Subjects
PRODUCTION scheduling; GENETIC algorithms; PRODUCTION control; PRODUCTION methods; COMPUTER integrated manufacturing systems; MANUFACTURING Automation Protocol; SIMULATED annealing; HEURISTIC programming; GANTT charts
- Publication
DAAAM International Scientific Book, 2010, p645
- ISSN
1726-9687
- Publication type
Article
- DOI
10.2507/daaam.scibook.2010.56