Atıf İçin Kopyala
Tozkapan A., Kirca O., Chung C.
COMPUTERS & OPERATIONS RESEARCH, cilt.30, sa.2, ss.309-320, 2003 (SCI-Expanded)
-
Yayın Türü:
Makale / Tam Makale
-
Cilt numarası:
30
Sayı:
2
-
Basım Tarihi:
2003
-
Doi Numarası:
10.1016/s0305-0548(01)00098-3
-
Dergi Adı:
COMPUTERS & OPERATIONS RESEARCH
-
Derginin Tarandığı İndeksler:
Science Citation Index Expanded (SCI-EXPANDED), Scopus
-
Sayfa Sayıları:
ss.309-320
-
Anahtar Kelimeler:
scheduling, two-stage assembly flowshop, branch and bound algorithm, total weighted flowtime, FLOWSHOP
-
Orta Doğu Teknik Üniversitesi Adresli:
Hayır
Özet
In this paper, a two-stage assembly scheduling problem is considered with the objective of minimizing the total weighted flowtime. A lower bounding procedure and a dominance criterion are developed and incorporated into a branch and bound procedure. A heuristic procedure is also used to derive an initial upper bound. Computational results of the algorithm are presented.