A tutorial on simulation optimization
WSC '92 Proceedings of the 24th conference on Winter simulation
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Computers and Industrial Engineering
Early/tardy scheduling with sequence dependent setups on uniform parallel machines
Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints
Computers and Operations Research
A tabu search algorithm for parallel machine total tardiness problem
Computers and Operations Research
An overview of evolutionary algorithms for parameter optimization
Evolutionary Computation
Fusion of soft computing and hard computing in industrial applications: an overview
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Computers and Industrial Engineering
Hi-index | 0.00 |
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.