FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ

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...

Full description

Bibliographic Details
Main Author: Tamer Eren
Format: Article
Language:English
Published: Hezarfen Aeronautics and Space Technologies Institue 2008-07-01
Series:Havacılık ve Uzay Teknolojileri Dergisi
Subjects:
Parallel Machine Scheduling Problem
Learning Effect
Release Date
Makespan
Integer Programming
Heuristic Methods
Online Access:http://www.jast.hho.edu.tr/JAST/index.php/JAST/article/view/192/180
id doaj-ad4ff0923e3f4a8ebded149de79ee06e
record_format Article
spelling doaj-ad4ff0923e3f4a8ebded149de79ee06e2020-11-25T00:22:24ZengHezarfen Aeronautics and Space Technologies InstitueHavacılık ve Uzay Teknolojileri Dergisi1304-04481304-04482008-07-01343746FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİTamer Eren0Kırıkkale UniversityIn 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.http://www.jast.hho.edu.tr/JAST/index.php/JAST/article/view/192/180Parallel Machine Scheduling ProblemLearning EffectRelease DateMakespanInteger ProgrammingHeuristic Methods
collection DOAJ
language English
format Article
sources DOAJ
author Tamer Eren
spellingShingle Tamer Eren
FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
Havacılık ve Uzay Teknolojileri Dergisi
Parallel Machine Scheduling Problem
Learning Effect
Release Date
Makespan
Integer Programming
Heuristic Methods
author_facet Tamer Eren
author_sort Tamer Eren
title FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
title_short FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
title_full FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
title_fullStr FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
title_full_unstemmed FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ
title_sort farkli geli̇ş zamanli öğrenme etki̇li̇ paralel maki̇neli̇ çi̇zelgeleme problemi̇
publisher Hezarfen Aeronautics and Space Technologies Institue
series Havacılık ve Uzay Teknolojileri Dergisi
issn 1304-0448
1304-0448
publishDate 2008-07-01
description 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.
topic Parallel Machine Scheduling Problem
Learning Effect
Release Date
Makespan
Integer Programming
Heuristic Methods
url http://www.jast.hho.edu.tr/JAST/index.php/JAST/article/view/192/180
work_keys_str_mv AT tamereren farkligeliszamanliogrenmeetkiliparalelmakinelicizelgelemeproblemi
_version_ 1725359930238566400

Similar Items