Meta heuristic approach for early- Tardy single machine scheduling problem

Creative Commons License

Güneri A. F., Oezguerler S., Parlak M.

Annals of DAAAM for 2011 and 22nd International DAAAM Symposium "Intelligent Manufacturing and Automation: Power of Knowledge and Creativity", Vienna, Avusturya, 23 - 26 Kasım 2011, ss.1429-1430, (Tam Metin Bildiri) identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.2507/22nd.daaam.proceedings.699
  • Basıldığı Şehir: Vienna
  • Basıldığı Ülke: Avusturya
  • Sayfa Sayıları: ss.1429-1430
  • Anahtar Kelimeler: Early, Greedy algorithm, Single machine, Tardy
  • İstanbul Yeni Yüzyıl Üniversitesi Adresli: Hayır

Özet

The objective of this study is to develop algorithm for single machine early/tardy problems based on due dates. For this reason, greedy algorithm has developed. The working mechanism of greedy algorithm is mentioned in this study. Test problems are created for comparison of these algorithms performances. After operations, it is found that greedy algorithm improves cost for single machine early/tardy problems based on tight due date.