A tabu search approach for the single machine mean tardiness problem
Journal of the Operational Research Society, cilt.48, sa.7, ss.751-755, 1997 (SCI-Expanded, SSCI, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 48 Sayı: 7
- Basım Tarihi: 1997
- Doi Numarası: 10.1057/palgrave.jors.2600412
- Dergi Adı: Journal of the Operational Research Society
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
- Sayfa Sayıları: ss.751-755
- Anahtar Kelimeler: Heuristics, Mean tardiness, Single machine scheduling, Tabu search
- Boğaziçi Üniversitesi Adresli: Evet
Özet
In this paper, a tabu search approach is proposed for solving the single machine mean tardiness scheduling problem. Simulation experiment results obtained from the tabu search approach three other heuristics are compared. Although computation time is increased, the results indicate that the proposed approach provides a much better solution than the other three approaches. © 1997 Operational Research Society Ltd. All rights reserved.