A polynomial time heuristic for the two-machine flowshop scheduling problem with setup times and random processing times

Aydilek H., Allahverdi A.

APPLIED MATHEMATICAL MODELLING, sa.12-13, ss.7164-7173, 2013 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Basım Tarihi: 2013
  • Doi Numarası: 10.1016/j.apm.2013.02.003
  • Dergi Adı: APPLIED MATHEMATICAL MODELLING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.7164-7173
  • Anahtar Kelimeler: Flowshop, Makespan, Random and bounded processing times, Scheduling, Setup times
  • Gazi Üniversitesi Adresli: Hayır

Özet

The two-machine flowshop scheduling problem to minimize makespan is addressed. Jobs have random processing times which are bounded within certain intervals. The distributions of job processing times are not known. This problem has been addressed in the literature with the assumption that setup times are included in processing times or are zero. In this paper, we relax this assumption and treat setup times as separate from processing times. We propose a polynomial time heuristic algorithm, Both Johnson algorithm and Yoshida and Hitomi algorithm, both of which developed for the deterministic problem, are special cases of the proposed algorithm. The heuristic algorithm uses a weighted average of lower and upper bounds for processing times. For different weights, the results of the proposed algorithm are compared based on randomly generated data. The computational analysis has shown that the proposed algorithm, with equal weights given to the lower and upper bounds, performs considerably well with an overall average error of 0.36%. The analysis has also shown that the proposed algorithm can safely be used regardless of processing time distributions and the range between lower and upper bounds. (C) 2013 Elsevier Inc. All rights reserved.