ABSTRACT A novel VLSI architecture for an island genetic algorithm (GA) is presented in this pape... more ABSTRACT A novel VLSI architecture for an island genetic algorithm (GA) is presented in this paper. The island GA is based on steady-state GA for reducing the hardware resources consumption. Alook-up table based fast string migration architecture is proposed for lowering the computational overhead while enhancing the performance for the island GA. As compared with its single-island GA hardware counterpart, the proposed architecture attains superior performance with less computation time subject to the same total population size. In addition, the proposed architecture has significantly lower computational time as compared with its software counterparts running on cluster computer with multithreading for GA-based optimization.
Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005
To solve job shop scheduling problems, the priority rule is one of the most popular approach. It ... more To solve job shop scheduling problems, the priority rule is one of the most popular approach. It has the appeal because of simplicity, efficiency and effectiveness. However, the paradigm conventionally used to apply priority rules has a certain flaw. In this paper, we first point out this flaw and then propose a paradigm to remove it. A rule is also
2006 IEEE International Conference on Systems, Man and Cybernetics, 2006
This paper addresses the lot scheduling problem in the semiconductor wafer fabrication facilities... more This paper addresses the lot scheduling problem in the semiconductor wafer fabrication facilities. We provide a simulation study to examine the performance of sixteen existing dispatching rules on the tardy rate, mean tardiness, and the maximum tardiness. A public and representative test bed, the MIMAC (measurement and improvement of manufacturing capacities) test bed is used. The best rules with respect
Abstract In this paper we address scheduling of the permutation flow shop with minimization of ma... more Abstract In this paper we address scheduling of the permutation flow shop with minimization of makespan and total flow time as the objectives. We propose a memetic algorithm (MA) to search for the set of nondominated solutions (the Pareto optimal solutions). The proposed ...
The permutation flow shop scheduling problem is addressed in this paper. Two objectives, minimiza... more The permutation flow shop scheduling problem is addressed in this paper. Two objectives, minimization of makespan and total flow time, are considered. We propose a memetic algorithm, called NNMA, by integrating a general multiobjective evolutionary algorithm (NSGA-II) with a problem-specific heuristic (NEH). We take NEH as a local improving procedure in NNMA and propose several adaptations including the acceptance criterion and job-insertion ordering to deal with multiple objectives and to improve its performance. We test the performance of NNMA using 90 public problem instances with different problem scales, and compare its performance with 23 algorithms. The experimental results show that our NNMA provides close performance for 30 small-scale instances and better performance for 50 medium- and large-scale instances. Furthermore, more than 70% of the net set of non-dominated solutions is updated by NNMA for these 50 instances.► We integrate NSGA-II and NEH into an MA, where NEH serves as a local search procedure. ► We investigate job extraction, job ordering, and neighbor acceptance in NEH-based local search. ► Our approach updates more than 70% of net sets of non-dominated solutions for 50 public instances. ► Observations on the distribution of non-dominated solutions are given.
ABSTRACT A novel VLSI architecture for an island genetic algorithm (GA) is presented in this pape... more ABSTRACT A novel VLSI architecture for an island genetic algorithm (GA) is presented in this paper. The island GA is based on steady-state GA for reducing the hardware resources consumption. Alook-up table based fast string migration architecture is proposed for lowering the computational overhead while enhancing the performance for the island GA. As compared with its single-island GA hardware counterpart, the proposed architecture attains superior performance with less computation time subject to the same total population size. In addition, the proposed architecture has significantly lower computational time as compared with its software counterparts running on cluster computer with multithreading for GA-based optimization.
Proceedings of the 2005 IEEE International Conference on Robotics and Automation, 2005
To solve job shop scheduling problems, the priority rule is one of the most popular approach. It ... more To solve job shop scheduling problems, the priority rule is one of the most popular approach. It has the appeal because of simplicity, efficiency and effectiveness. However, the paradigm conventionally used to apply priority rules has a certain flaw. In this paper, we first point out this flaw and then propose a paradigm to remove it. A rule is also
2006 IEEE International Conference on Systems, Man and Cybernetics, 2006
This paper addresses the lot scheduling problem in the semiconductor wafer fabrication facilities... more This paper addresses the lot scheduling problem in the semiconductor wafer fabrication facilities. We provide a simulation study to examine the performance of sixteen existing dispatching rules on the tardy rate, mean tardiness, and the maximum tardiness. A public and representative test bed, the MIMAC (measurement and improvement of manufacturing capacities) test bed is used. The best rules with respect
Abstract In this paper we address scheduling of the permutation flow shop with minimization of ma... more Abstract In this paper we address scheduling of the permutation flow shop with minimization of makespan and total flow time as the objectives. We propose a memetic algorithm (MA) to search for the set of nondominated solutions (the Pareto optimal solutions). The proposed ...
The permutation flow shop scheduling problem is addressed in this paper. Two objectives, minimiza... more The permutation flow shop scheduling problem is addressed in this paper. Two objectives, minimization of makespan and total flow time, are considered. We propose a memetic algorithm, called NNMA, by integrating a general multiobjective evolutionary algorithm (NSGA-II) with a problem-specific heuristic (NEH). We take NEH as a local improving procedure in NNMA and propose several adaptations including the acceptance criterion and job-insertion ordering to deal with multiple objectives and to improve its performance. We test the performance of NNMA using 90 public problem instances with different problem scales, and compare its performance with 23 algorithms. The experimental results show that our NNMA provides close performance for 30 small-scale instances and better performance for 50 medium- and large-scale instances. Furthermore, more than 70% of the net set of non-dominated solutions is updated by NNMA for these 50 instances.► We integrate NSGA-II and NEH into an MA, where NEH serves as a local search procedure. ► We investigate job extraction, job ordering, and neighbor acceptance in NEH-based local search. ► Our approach updates more than 70% of net sets of non-dominated solutions for 50 public instances. ► Observations on the distribution of non-dominated solutions are given.
Uploads
Papers by Tsung-Che Chiang