Journals / Yönetim Dergisi:İstanbul Üniversitesi İşletme Fakültesi İşletme İktisadı Enstitüsü / 2006 / Cilt: 17 - Sayı: 55

Using Tabu Search Algorithm in Single Machine Scheduling Problems

Tabu Arama Algoritması ile Tek Makine Programlama Probleminin Çözümü

Pages
25–34
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

When the results are examined it is shown that the results are rational and tabu search method can be used for that kind of a problem.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Scheduling is one of the most important parts of production.
📊
Key Findings & Data:Single machine scheduling problem for 20 jobs is randomly selected as an example.
💡
Conclusion & Impact:When the results are examined it is shown that the results are rational and tabu search method can be used for that kind of a problem.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:optimizasyon · planlama · optimization

Abstract

Scheduling is one of the most important parts of production. In many researches, solutions to such problems have been investigated. But the researches which cover tabu search method are much fewer. In this study, it is examined that if the model, which is based on a constructed model for a study, could be solved by using tabu search method. Single machine scheduling problem for 20 jobs is randomly selected as an example. When the results are examined it is shown that the results are rational and tabu search method can be used for that kind of a problem.

Özet

İşlerin programlanması ve planlanması üretimin en önemli parçalarından bir tanesidir. Bilimsel çalışmalar içerisinde bu türden problemlerin çözümüne yönelik araştırmalar sıklıkla yer almaktadır. Ancak söz konusu araştırmalarda tabu arama metodunun kullanımı çok daha seyrek görülmektedir. Bu çalışmada daha önce geliştirilmiş bir model temel alınarak, tabu arama metodunun böyle bir problemde kullanılıp kullanılamayacağı incelenmiştir. Tesadüfî bir Örnek olarak 20 işin tek bir makinede programlanması ele alınmıştır. Bulunan sonuçlar incelendiğinde mantıklı

🔖

Cite This Article

CURA, T. (2006). Using Tabu Search Algorithm in Single Machine Scheduling Problems. Yönetim Dergisi:İstanbul Üniversitesi İşletme Fakültesi İşletme İktisadı Enstitüsü, Cilt: 17 - Sayı: 55, 25–34. https://ajindex.com/articles/338080

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (4)

  1. Cheng, T.C.E., Ng, C.T., Yuan, J,, J., Liu, Z.H., 2004, "Single machine scheduling to minimize total weighted tardiness", European Journal of Operational Research, 165, s. 423-443.
  2. Colin, R. Reeves, 1995, Modern Heuristic Techniques for Combinatorial Problems, London, McGraw - Hill. Colin, C, Emerson, Quinino, C, Roberto, 2004, "An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions", European Journal of Operational Research^ 32, s. 2285-2296
  3. Computation, Computers, Information and Mathematics (Sandia National Laboratories), http://www.cs.sandia.gov/opt/survey/ts.html, Mart 2005.
  4. Nonas, Lise, Sigrid, Olsen, A., Kai, 2004, "Optimal and heuristic solutions for a scheduling problem arising in a foundry", European Journal of Operational Research,, 32, s. 2351-2382.