The two- and <i>m</i>-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime

Allahverdi A.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, sa.2, ss.373-396, 2003 (SCI-Expanded) identifier identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Basım Tarihi: 2003
  • Doi Numarası: 10.1016/s0377-2217(02)00253-9
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.373-396
  • Anahtar Kelimeler: Bicriteria, Dominance relation, Flowshop, Heuristics, Makespan, Mean flowtime
  • Gazi Üniversitesi Adresli: Hayır

Özet

This paper considers the flowshop scheduling problem with the objective of minimizing the weighted sum of makespan and mean flowtime. Even though the two-machine problem has been addressed and several heuristics have been established in the literature, these heuristics have not been compared. In this paper, a comparison of these available heuristics in the literature is conducted. Moreover, three new heuristic algorithms are proposed, which can be utilized for both the two-machine and m-machine problems. Computational experiments indicate that the proposed heuristics are superior to all the existing heuristics in the literature including a genetic algorithm. Two dominance relations are also developed; one for the two-machine and the other for the three-machine problem. Experimental results show that both relations are efficient. (C) 2002 Elsevier Science B.V. All rights reserved.