Two-machine flowshop minimum-length scheduling problem with random and bounded processing times

---

Atıf İçin Kopyala

Allahverdi A., Sotskov Y.

International Transactions in Operational Research, cilt.10, sa.1, ss.65-76, 2003 (Scopus)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 10 Sayı: 1
• Basım Tarihi: 2003
• Doi Numarası: 10.1111/1475-3995.00393
• Dergi Adı: International Transactions in Operational Research
• Derginin Tarandığı İndeksler: Scopus
• Sayfa Sayıları: ss.65-76
• Anahtar Kelimeler: Flowshop, Makespan, Random processing times, Scheduling
• Gazi Üniversitesi Adresli: Hayır

Özet

We address the two-machine flowshop scheduling problem to minimize makespan where jobs have random and bounded processing times. The probability distributions of job processing times are unknown and only the lower and upper bounds of processing times are given before scheduling. In such cases there may not exist a unique schedule that remains optimal for all possible realizations of processing times, and therefore, a set of schedules has to be considered which dominates all other schedules. In this paper, we find some sufficient conditions for the considered problem. © 2003 International Federation of Operational Research Societies.