The two-stage assembly scheduling problem to minimize total completion time with setup times

Allahverdi A., Al-Anzi F. S.

COMPUTERS & OPERATIONS RESEARCH, sa.10, ss.2740-2747, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1016/j.cor.2008.12.001
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.2740-2747
  • Anahtar Kelimeler: Assembly flowshop, Dominance relation, Heuristic, Scheduling, Total completion time
  • Gazi Üniversitesi Adresli: Hayır

Özet

We address the two-stage assembly scheduling problem where there are m machines at the first stage and an assembly machine at the second stage. The objective is to schedule the available n jobs so that total completion time of all n jobs is minimized. Setup times are treated as separate from processing times. This problem is NP-hard, and therefore we present a dominance relation and propose three heuristics. The heuristics are evaluated based on randomly generated data. One of the proposed heuristics is known to be the best heuristic for the case of zero setup times while another heuristic is known to perform well for such problems. A new version of the latter heuristic, which utilizes the dominance relation, is proposed and shown to perform much better than the other two heuristics. (C) 2008 Elsevier Ltd. All rights reserved.