We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
ÖǦRENME ETKİLİ AKIŞ TİPİ ÇİZELGELEME PROBLEMİNDE MAKSİMUM TAMAMLANMA ZAMANI MİNİMİZASYONU.
- Authors
Eren, Tamer; Güner, Ertan
- Abstract
In this study; learning effect on two-machine flowshop is analyzed and makespan is taken as a performance criteria. This study shows that Johnson Algorithm, which guarantees the best solution in classical situation (without learning effect), can not guarantee the best results in the situation with learning effect. In addition, a mathematical programming model is proposed for this problem, and solutions are found for problems which have up to 25 jobs. To improve the performance of tabu search method the result of the Johnson algorithm is taken as an initial solution of tabu search method. According to computational results tabu search is effective in finding problem solutions with up to 1000 jobs.
- Subjects
MACHINE learning; PRODUCTION scheduling; ALGORITHMS; MATHEMATICAL programming; MACHINE design
- Publication
Teknoloji, 2005, Vol 8, Issue 4, p341
- ISSN
1302-0056
- Publication type
Article