Note: Bicriteria scheduling for minimizing flow time and maximum tardiness
NAVAL RESEARCH LOGISTICS, cilt.43, sa.6, ss.929-936, 1996 (SCI-Expanded, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 43 Sayı: 6
- Basım Tarihi: 1996
- Doi Numarası: 10.1002/(sici)1520-6750(199609)43:6<929::aid-nav9>3.0.co;2-6
- Dergi Adı: NAVAL RESEARCH LOGISTICS
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Sayfa Sayıları: ss.929-936
- Orta Doğu Teknik Üniversitesi Adresli: Evet
Özet
We consider the bicriteria problem of minimizing total flow time and maximum tardiness penalties for a given set of jobs on a single machine. We develop an algorithm that finds the optimal schedule for any given monotonic function of the two criteria by generating only a small subset of the efficient schedules. (C) 1996 John Wiley & Sons, Inc.