TY - JOUR
T1 - An evolutionary simulation-optimization approach in solving parallel-machine scheduling problems - A case study
AU - Yang, Taho
N1 - Funding Information:
The authors thank the anonymous company for providing the case study. This work was supported, in part, by the National Science Council of Taiwan, Republic of China, under Grant NSC-95-2221-E006-349-MY3.
PY - 2009/4
Y1 - 2009/4
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=60549105193&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=60549105193&partnerID=8YFLogxK
U2 - 10.1016/j.cie.2008.09.026
DO - 10.1016/j.cie.2008.09.026
M3 - Article
AN - SCOPUS:60549105193
SN - 0360-8352
VL - 56
SP - 1126
EP - 1136
JO - Computers and Industrial Engineering
JF - Computers and Industrial Engineering
IS - 3
ER -