A branch-and-bound algorithm for the three-machine flowshop scheduling problem with bicriteria of makespan andtotal flowtime

---

Atıf İçin Kopyala

Yeh W., Allahverdi A.

International Transactions in Operational Research, cilt.11, sa.3, ss.323-339, 2004 (Scopus)

• Yayın Türü: Makale / Tam Makale
• Cilt numarası: 11 Sayı: 3
• Basım Tarihi: 2004
• Doi Numarası: 10.1111/j.1475-3995.2004.00461.x
• Dergi Adı: International Transactions in Operational Research
• Derginin Tarandığı İndeksler: Scopus
• Sayfa Sayıları: ss.323-339
• Anahtar Kelimeler: Bicriteria, Dominance relation, Flowshop, Flowtime, Heuristics, Makespan
• Gazi Üniversitesi Adresli: Hayır

Özet

This paper addresses the three-machine flowshop scheduling problem with a bicriteria of minimizing a weighted sum of makespan and total flowtime. Three lower bounds, an upper bound, and several dominance relations are developed. The upper bound is developed using a two-phase hybrid heuristic method. A branch-and-bound algorithm, incorporating the developed bounds and dominance relations, is presented. An extensive computational analysis on randomly generated problems is conducted. The analysis indicates that the proposed bounds, dominance relations, and branch-and-bound algorithm are efficient. © 2004 Wiley Periodicals, Inc.