FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
In this study m-identical parallel machine scheduling problem with release date is considered. The objective function of the problem is minimization of the makespan. An integer programming model is developed for the problem which belongs to NP-hard class. To improve the performance of tabu search...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hezarfen Aeronautics and Space Technologies Institue
2008-07-01
|
| Series: | Havacılık ve Uzay Teknolojileri Dergisi |
| Subjects: | |
| Online Access: | http://www.jast.hho.edu.tr/JAST/index.php/JAST/article/view/192/180 |
| Summary: | In this study m-identical parallel machine scheduling problem with release date is considered. The objective
function of the problem is minimization of the makespan. An integer programming model is developed for the
problem which belongs to NP-hard class. To improve the performance of tabu search algorithm the best result of
the dispatching rules is taken as an initial solution of tabu search algorithm. According to computational results
the tabu search algorithm is effective in finding problem solutions with up to 500 jobs. |
|---|---|
| ISSN: | 1304-0448 1304-0448 |