Solving the job-shop scheduling problem with a simple genetic algorithmLestan, Zoran ...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. Scheduling tools allow production to run efficiently. The goal in this paper is the development of an algorithm for thejob-shop scheduling problem, which is based only on genetic algorithms. Ourintention is to prove, that even a relatively simple genetic algorithm is capable for job-shop scheduling. The effectiveness of the algorithm is demonstrated by solving practical problems. The first problem consists of 10*10 instances (10 jobs and 10 machines) and the second one of 20*5 instances(20 jobs and 5 machines). The scheduling efficiency is measured by the time required to complete all jobs (makespan). In case of the first and the second problem, the best obtained solution (i.e., deviation from optimal solution) was 1.2 % and 4 %, respectively.Vir: International journal of simulation modelling. - ISSN 1726-4529 (Vol. 8, no. 4, Dec. 2009, str. 197-205)Vrsta gradiva - članek, sestavni delLeto - 2009Jezik - angleškiCOBISS.SI-ID - 13623830
Vnos na polico
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Baze podatkov, v katerih je revija indeksirana
|Ime baze podatkov||Področje||Leto|
Izberite prevzemno mesto:
Gesla v Splošnem geslovniku COBISS
Prosimo, počakajte trenutek.