%0 Journal Article
	%A M. T. Yazdani Sabouni and  Rasaratnam Logendran
	%D 2013
	%J International Journal of Industrial and Manufacturing Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 76, 2013
	%T Genetic Algorithm Application in a Dynamic PCB Assembly with Carryover Sequence- Dependent Setups
	%U https://publications.waset.org/pdf/9222
	%V 76
	%X We consider a typical problem in the assembly of
printed circuit boards (PCBs) in a two-machine flow shop system to
simultaneously minimize the weighted sum of weighted tardiness and
weighted flow time. The investigated problem is a group scheduling
problem in which PCBs are assembled in groups and the interest is to
find the best sequence of groups as well as the boards within each
group to minimize the objective function value. The type of setup
operation between any two board groups is characterized as carryover
sequence-dependent setup time, which exactly matches with the real
application of this problem. As a technical constraint, all of the
boards must be kitted before the assembly operation starts (kitting
operation) and by kitting staff. The main idea developed in this paper
is to completely eliminate the role of kitting staff by assigning the
task of kitting to the machine operator during the time he is idle
which is referred to as integration of internal (machine) and external
(kitting) setup times. Performing the kitting operation, which is a
preparation process of the next set of boards while the other boards
are currently being assembled, results in the boards to continuously
enter the system or have dynamic arrival times. Consequently, a
dynamic PCB assembly system is introduced for the first time in the
assembly of PCBs, which also has characteristics similar to that of
just-in-time manufacturing. The problem investigated is
computationally very complex, meaning that finding the optimal
solutions especially when the problem size gets larger is impossible.
Thus, a heuristic based on Genetic Algorithm (GA) is employed. An
example problem on the application of the GA developed is
demonstrated and also numerical results of applying the GA on
solving several instances are provided.
	%P 641 - 649