Title :
Computer Assembly Scheduling Problem
Author :
Al-Anzi, Fawaz S. ; Allahverdi, Ali
Author_Institution :
Dept. Comput. Eng., Kuwait Univ., Safat
Abstract :
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
Keywords :
assembling; flow shop scheduling; minimisation; particle swarm optimisation; particle swarm optimization; two-stage computer assembly scheduling problem; Application software; Assembly systems; Computer applications; Computer industry; Engineering management; Job shop scheduling; Particle swarm optimization; Polynomials; Processor scheduling; Systems engineering and theory; Scheduling; assembly flowshop; maximum lateness; setup times;
Conference_Titel :
Service Systems and Service Management, 2006 International Conference on
Conference_Location :
Troyes
Print_ISBN :
1-4244-0450-9
Electronic_ISBN :
1-4244-0451-7
DOI :
10.1109/ICSSSM.2006.320677
