Computer assembly scheduling problem

Ai-Anzi F. S., Allahverdi A.

ICSSSM'06: 2006 International Conference on Service Systems and Service Management, Troyes, Fransa, 25 - 27 Ekim 2006, cilt.2, ss.1188-1191 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 2
  • Doi Numarası: 10.1109/icsssm.2006.320677
  • Basıldığı Şehir: Troyes
  • Basıldığı Ülke: Fransa
  • Sayfa Sayıları: ss.1188-1191
  • Anahtar Kelimeler: Assembly flowshop, Maximum lateness, Scheduling, Setup times
  • Gazi Üniversitesi Adresli: Hayır

Özet

In this paper, we address the two-stage assembly scheduling problem to minimize maximum lateness where setup times are treated as separate and sequence-independent. This problem has many applications including computer assembly problem. We propose a dominance relation and present three heuristics. Computational experiments are conducted to compare the proposed heuristics which show that Particle Swarm Optimization heuristic outperform the Tabu search and EDD heuristics. © 2006 IEEE.