No-wait flowshops with bicriteria of makespan and total completion time

Allahverdi A., Aldowaisan T.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, sa.9, ss.1004-1015, 2002 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Basım Tarihi: 2002
  • Doi Numarası: 10.1057/palgrave.jors.2601403
  • Dergi Adı: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.1004-1015
  • Anahtar Kelimeler: Bicriteria, Heuristic, Makespan, No-wait flowshop, Total completion time
  • Gazi Üniversitesi Adresli: Hayır

Özet

We consider the m-machine no-wait flowshop scheduling problem with the objective of minimizing a weighted sum of makespan and total completion time. For the two-machine problem, we develop a dominance relation and embed it within a proposed branch-and-bound algorithm. For the m-machine problem, we propose a heuristic. Computational experiments show that the proposed heuristic outperforms the best existing multi-criteria heuristics and the best single criterion heuristics for makespan and total completion time. The efficiency of the dominance relation and branch-and-bound algorithm is also investigated and shown to be effective.