Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry

In this paper, a scheduling problem for drilling operation in a real-world printed circuit board factory is considered. Two derivatives of multi-objective genetic algorithms are proposed under two objectives, i.e. makespan and total tardiness time. The proposed algorithms possess a rare characteristic from traditional multi-objective genetic algorithms. The crossover and mutation rates of the proposed algorithms can be variables or adjusted according to the searching performance while the rates of traditional algorithm are fixed. Production data retrieved from the shop floor are used as the test instances. The numerical result indicates that both two proposed multi-objective genetic algorithms have satisfactory performance and the adaptive multi-objective genetic algorithm performs better. The result shows the algorithms are effective and efficiency to the current system used in the shop floor. Thus, the result may be of interest to practical applications.

[1]  Hisao Ishibuchi,et al.  Performance evaluation of genetic algorithms for flowshop scheduling problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[2]  N. Jawahar,et al.  A multiobjective genetic algorithm for job shop scheduling , 2001 .

[3]  S. G. Ponnambalam,et al.  A Multi-Objective Genetic Algorithm for Solving Assembly Line Balancing Problem , 2000 .

[4]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[5]  Jia Zhu,et al.  An Adaptive GA Based on Information Entropy , 2005, ICNC.

[6]  Zhiming Liu,et al.  New adaptive genetic algorithm based on ranking , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[7]  Hisao Ishibuchi,et al.  Local search procedures in a multi-objective genetic local search algorithm for scheduling problems , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[8]  Kalyanmoy Deb,et al.  SINGLE AND MULTI-OBJECTIVE OPTIMIZATION USING EVOLUTIONARY COMPUTATION , 2004 .

[9]  L. P. Khoo,et al.  A Genetic Algorithms Enhanced Planning System for Surface Mount PCB Assembly , 2000 .

[10]  Kang Li,et al.  A combined adaptive bounding and adaptive mutation technique for genetic algorithms , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[11]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[12]  L. P. Khoo,et al.  A Prototype Genetic Algorithm-Enhanced Multi-Objective Scheduler for Manufacturing Systems , 2000 .

[13]  S. H. Zegordi,et al.  A genetic algorithm for multiple objective dealing with exceptional elements in cellular manufacturing , 2003 .

[14]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[15]  Pei-Chann Chang,et al.  Scheduling of drilling operations in printed circuit board factory , 2003 .

[16]  Nguyen Van Hop,et al.  The scheduling problem of PCBs for multiple non-identical parallel machines , 2004, Eur. J. Oper. Res..

[17]  Chandrasekharan Rajendran,et al.  Scheduling in flowshop and cellular manufacturing systems with multiple objectives— a genetic algorithmic approach , 1996 .

[18]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[19]  Hajime Kita,et al.  Multi-objective optimization by genetic algorithms: a review , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[20]  Feng Shan,et al.  Study on a novel hybrid adaptive genetic algorithm embedding conjugate gradient algorithm , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).

[21]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[22]  Douglas H. Werner,et al.  Adaptive mutation parameter toggling genetic algorithm for phase-only array synthesis , 2002 .

[23]  Pei-Chann Chang,et al.  Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times , 2003, Appl. Soft Comput..

[24]  Hisao Ishibuchi,et al.  Multi-objective genetic local search algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[25]  P. Chang,et al.  The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .

[26]  Chandrasekharan Rajendran,et al.  A multiobjective genetic algorithm for scheduling a flexible manufacturing system , 2003 .

[27]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[28]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .