Algorithms for scheduling jobs on two serial duplicate stations

---

Atıf İçin Kopyala

Savsar M., Allahverdi A.

International Transactions in Operational Research, cilt.6, sa.4, ss.411-422, 1999 (Scopus)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 6 Sayı: 4
• Basım Tarihi: 1999
• Doi Numarası: 10.1111/j.1475-3995.1999.tb00164.x
• Dergi Adı: International Transactions in Operational Research
• Derginin Tarandığı İndeksler: Scopus
• Sayfa Sayıları: ss.411-422
• Anahtar Kelimeler: Automated line, Duplicate stations, Makespan, Mean flowtime, Scheduling
• Gazi Üniversitesi Adresli: Hayır

Özet

In automated assembly or production lines, some stations are duplicated due to their long cycle times. Material handling considerations may require these stations to be arranged in series rather than in parallel. Each job needs to be processed on any one of the duplicate stations. This study deals with scheduling of n available jobs on two serial duplicate stations in an automated production line. The performance measures considered are mean flowtime, makespan, and station idle time. After the problem is formulated, two algorithms are developed to determine the optimal schedules with respect to the performance measures. © 1999 Blackwell Publishing Ltd.