Scheduling with bicriteria: total flowtime and number of tardy jobs

Kondakci S., Bekiroglu T.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, cilt.53, sa.1, ss.91-99, 1997 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 53 Sayı: 1
  • Basım Tarihi: 1997
  • Doi Numarası: 10.1016/s0925-5273(97)00099-6
  • Dergi Adı: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.91-99
  • Anahtar Kelimeler: scheduling, bicriteria, single machine, SINGLE-MACHINE, TIME, TARDINESS, ALGORITHM
  • Orta Doğu Teknik Üniversitesi Adresli: Hayır

Özet

In this paper the problem of minimizing total flowtime and number of tardy jobs on a single machine is considered. Some properties of the nondominated solutions are discussed. Computational results on the usefulness of developed properties for problems having up to 30 jobs are reported.