Research on the Production Scheduling Method of a Semiconductor Packaging Test Based With the Clustering Method

Introduction

The current scheduling methods include the following: 1) based on operational research methods, such as mixed integer linear programming (Méndez et al., 2001), dynamic programming methods. Tsinghua University, Xiao Jing and others using mixed integer programming method is only for ATM two-stage mixed flow scheduling problem (Xiao et al., 2010), has a very good optimization effect. 2) Intelligent search method, such as genetic algorithm (Pesch et al., 2009), differential evolution algorithm, particle swarm algorithm, ant colony algorithm (Misneok et al., 2008) and so on, which has a good global optimization ability, for solving multi-objective optimization problem is significant. 3) The optimization method based on heuristic rules is the earliest proposed approximation optimization method (Jackson et al., 1955), which uses certain optimization rules to achieve a specific optimization method (Smith et al., 1956), the computational complexity is low, easy to implement, in practice Has been widely used (Lu et al., 1991). Lu et al. are the first to study heuristic rules to optimize production (Lu et al., 1994), and had studied the effective rules that could reduce the production cycle in semiconductor production and achieved good results. But the heuristic-based optimization method does not have the characteristics of global optimization. 4) Based on the method of constraint satisfaction technology, it is necessary to instantiate the processing time variable of each process under the constraint condition of non-violation of the problem, and use constrained check and constraint propagation technique to optimize the constraint solution in a given time (Oliveira et al., 2001). 5) Aims to develop a novel genetic algorithm of multi-subpopulation parameters with hybrid estimation of distribution (MSPHEDA) (Wang et al., 2015) to solve the present problem effectively and efficiently. Zhu, et al studies the challenging problem of scheduling single-arm multi-cluster tools with wafer residency time constraints. They have a linear topology and their bottleneck tool is process-bound. This work finds an optimal one-wafer cyclic schedule (Zhu et al., 2015). A simulation optimization approach for a hybrid flow shop scheduling problem in a real-world semiconductor back-end assembly facility is presented (Lin et al., 2015). Cluster tools are automated robotic manufacturing systems containing multiple computer-controlled process modules (Pan et al., 2018). A novel fruit fly optimization algorithm (nFOA) is proposed to solve the semiconductor final testing scheduling problem (SFTSP). (Zheng et al., 2014). A hybrid approach integrating a particle swarm optimization algorithm with a Cauchy distribution and genetic operators (HPSO+GA) (Jamrus et al., 2018) for solving an FJSP by finding a job sequence that minimizes the makespan with uncertain processing time is developed. The photolithography workshop (Bitar et al., 2016) is often a bottleneck and improving scheduling decisions in this workshop can help to improve indicators of the whole plant. Two optimization criteria are separately considered: the weighted flow time (to minimize) and the number of products that are processed (to maximize). Semiconductor fabrication line (Kim et al., 2016) runs with several hundreds of steps on several hundreds of equipment in the type of re-entrant flow process. The hierarchical planning decisions are made in a way that the production planning is determined on the integrated models at first, and the scheduling operations are then performed. The most complexity comes from the difficulties of synchronization of the production planning and scheduling. An iterative approach to achieve the synchronization is suggested to coordinate the input and output quantity of the production plan when generating a schedule. 6) Affinity scheduling (Squillante, 2011) is the allocation, or scheduling, of computing tasks on the computing nodes where they will be executed more efficiently. Such affinity of a task for a node can be based on any aspects of the computing node or computing task that make execution more efficient, and it is most often related to different speeds or overheads associated with the resources of the computing node that are required by the computing task. Combined scheduling method, which uses a variety of approximate algorithms to solve the scheduling optimization problem, make up for the shortcomings of the respective algorithms, play their respective advantages, such as differential evolution algorithm (DA) (Mendes et al., 2005) and artificial bee colony algorithm (ABC) (Bao et al., 2009).