Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times

Allahverdi, ALİ; Aldowaisan, Tariq; Sotskov, Yuri

doi:10.1155/s016117120321019x

Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times

Atıf İçin Kopyala

Allahverdi A., Aldowaisan T., Sotskov Y. N.

International Journal of Mathematics and Mathematical Sciences, cilt.2003, sa.39, ss.2475-2486, 2003 (Scopus)

Yayın Türü: Makale / Tam Makale
Cilt numarası: 2003 Sayı: 39
Basım Tarihi: 2003
Doi Numarası: 10.1155/s016117120321019x
Dergi Adı: International Journal of Mathematics and Mathematical Sciences
Derginin Tarandığı İndeksler: Scopus
Sayfa Sayıları: ss.2475-2486
Gazi Üniversitesi Adresli: Hayır

Özet

This paper addresses the two-machine flowshop scheduling problem with separate setup times to minimize makespan or total completion time (TCT). Setup times are relaxed to be random variables rather than deterministic as commonly used in the OR literature. Moreover, distribution-free setup times are used where only the lower and upper bounds are given. Global and local dominance relations are developed for the considered flowshops and an illustrative numerical example is given. © 2003 Hindawi Publishing Corporation. All rights reserved.