MODEL PENYELESAIAN JOB SHOP SCHEDULING PROBLEM MENGGUNAKAN METODE LOCAL SEARCH ALGORITHM DENGAN CROSS OVER | Zahri | JURNAL ILMIAH TEKNO

MODEL PENYELESAIAN JOB SHOP SCHEDULING PROBLEM MENGGUNAKAN METODE LOCAL SEARCH ALGORITHM DENGAN CROSS OVER

Amiluddin Zahri

Sari


Job shop scheduling problem is one of the scheduling problem with sequence constraint processing tasks, and each task has to go through each machine exactly once. Many experiments have been done in solving job shop scheduling problem using genetic algorithms. In this case the researchers conducted experiments using a genetic algorithm to obtain a model of the completion of job shop scheduling problem using the local search algorithm with crossover using matlab 7.0.1 software. From experiments conducted at three case studies of randomly selected scheduling models obtained the best scheduling and the best processing time, the fitness value of 0.1429 for case 1, case 2 of 0.0625, and 0.0833 for the case 3.

Keywords: scheduling, genetic algorithms, software matlab 7.0.1

Teks Lengkap:

PDF