An evolutionary simulation-optimization approach in solving parallel-machine scheduling problems - A case study

Parallel-machine scheduling research is one of the active fields in the past decade due to its increasing application. Due to the problem complexity, it is a general practice to find an appropriate heuristic rather than an optimal solution for the parallel-machine scheduling problem. The wirebonding workstation is the bottleneck in integrated-circuit packaging manufacturing. Effective scheduling is one of the key factors towards improving the efficiency of the wirebonding operations. The wirebonding scheduling problem is an equal (or identical) parallel-machine scheduling problem. The research solved the wirebonding scheduling problem by using an evolutionary simulation-optimization approach. Empirical results, benchmarked against lower bound solutions, showed the quality solutions of less than 2% deviation for a wide range of production scenarios. However, if the problem size were to increase, the proposed methodology might become computationally prohibitive, and this might well require further development if used to solve the identified problem in such circumstances.

[1]  Thomas Bäck,et al.  An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.

[2]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[3]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[4]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[5]  F. Frank Chen,et al.  Unrelated parallel machine scheduling with setup times using simulated annealing , 2002 .

[6]  Wendell G. Gilland.  A simulation study comparing performance of CONWIP and bottleneck-based release rules , 2002 .

[7]  M. Dessouky.  Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness , 1998 .

[8]  Farhad Azadivar,et al.  A tutorial on simulation optimization , 1992, WSC '92.

[9]  Henri Pierreval,et al.  A distributed evolutionary simulation optimization approach for the configuration of multiproduct kanban systems , 2001, Int. J. Comput. Integr. Manuf..

[10]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[11]  Taho Yang,et al.  A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem , 2007, Eur. J. Oper. Res..

[12]  Sam Kwong,et al.  Genetic algorithms: concepts and applications [in engineering design] , 1996, IEEE Trans. Ind. Electron..

[13]  John W. Fowler,et al.  Scheduling of unrelated parallel machines: an application to PWB manufacturing , 2002 .

[14]  Taho Yang,et al.  Solving a multi-objective simulation model using a hybrid response surface method and lexicographical goal programming approach—a case study on integrated circuit ink-marking machines , 2002, J. Oper. Res. Soc..

[15]  Jose A. Ventura,et al.  Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints , 2003, Comput. Oper. Res..

[16]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[17]  Pablo Moscato,et al.  Comparing meta-heuristic approaches for parallel machine scheduling problems , 2002 .

[18]  Johannes M.J. Schutten,et al.  Parallel machine scheduling with release dates, due dates and family setup times , 1996 .

[19]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[20]  Haldun Aytug,et al.  Use of genetic algorithms to solve production and operations management problems: A review , 2003 .

[21]  Taho Yang,et al.  Metamodeling approach in solving the machine parameters optimization problem using neural network and genetic algorithms: A case study , 2006 .

[22]  Taho Yang,et al.  An evolutionary-simulation approach for the optimization of multi-constant work-in-process strategy--A case study , 2007 .

[23]  H. Pierreval,et al.  Using evolutionary algorithms and simulation for the optimization of manufacturing systems , 1997 .

[24]  S.J. Mason,et al.  A scheduling heuristic for maximizing wirebonder throughput , 2004, IEEE Transactions on Electronics Packaging Manufacturing.

[25]  Seppo J. Ovaska,et al.  Fusion of soft computing and hard computing in industrial applications: an overview , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[26]  Sam Kwong,et al.  Genetic algorithms: concepts and applications [in engineering design] , 1996, IEEE Trans. Ind. Electron..

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

[28]  Jack P. C. Kleijnen,et al.  An evolutionary approach to select a pull system among Kanban, Conwip and Hybrid , 2000, J. Intell. Manuf..

[29]  Nagraj Balakrishnan,et al.  Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..

[30]  Furkan Kiraç,et al.  A tabu search algorithm for parallel machine total tardiness problem , 2004, Comput. Oper. Res..

[31]  G. Harman.  Wire Bonding in Microelectronics: Materials, Processes, Reliability, and Yield , 1997 .

[32]  Johnny C. Ho,et al.  Minimizing the number of tardy jobs for m parallel machines , 1995 .