MINIMIZING TOTAL COMPLETION TIME IN A TWO-MACHINE NO-WAIT FLOWSHOP WITH UNCERTAIN AND BOUNDED SETUP TIMES

Allahverdi M., Allahverdi A., Lin B. M.

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, sa.5, ss.2439-2457, 2020 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Basım Tarihi: 2020
  • Doi Numarası: 10.3934/jimo.2019062
  • Dergi Adı: JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Computer & Applied Sciences, MathSciNet, zbMATH
  • Sayfa Sayıları: ss.2439-2457
  • Anahtar Kelimeler: No-wait owshop, Scheduling, Total completion time, Uncerain setup times
  • Gazi Üniversitesi Adresli: Hayır

Özet

We address a two-machine no-wait flowshop scheduling problem with respect to the performance measure of total completion time. Minimizing total completion time is important when inventory cost is of concern. Setup times are treated separately from processing times. Furthermore, setup times are uncertain with unknown distributions and are within some lower and upper bounds. We develop a dominance relation and propose eight algorithms to solve the problem. The proposed algorithms, which assign different weights to the processing and setup times on both machines, convert the two-machine problem into a single-machine one for which an optimal solution is known. We conduct computational experiments to evaluate the proposed algorithms. Computational experiments reveal that one of the proposed algorithms, which assigns the same weight to setup and processing times, is superior to the rest of the algorithms. The results are statistically verified by constructing confidence intervals and test of hypothesis.