Skip to main content
SpringerLink
Log in

A hybrid estimation of distribution algorithm for the semiconductor final testing scheduling problem

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

As the last process of the semiconductor fabrication, the final testing is crucial to guarantee the quality of the integrated circuit products. The semiconductor final testing scheduling problem (SFTSP) is of great significance to the efficiency of the semiconductor companies. To find satisfactory solutions within reasonable computational time, the intelligent manufacturing scheduling based on the meta-heuristic methods has become a common approach. In this paper, a hybrid estimation of distribution algorithm (HEDA) is proposed to solve the SFTSP. First, novel encoding and decoding methods are proposed to map from the solution space to the schedule space effectively. Second, a probability model that describes the distribution of the solution space is built to generate the new individuals of the population. Third, a mechanism is used to update the parameters of the probability model with the superior solutions at every generation. Furthermore, to enhance the exploitation ability of the algorithm, a local search procedure is hybridized to find neighbor solutions of the promising individuals obtained by sampling the probability model. In addition, the influence of parameters is investigated based on Taguchi method of design-of-experiment, and a set of suitable parameters is suggested. Finally, numerical simulation based on some benchmark instances is carried out. The comparisons between the HEDA and some existing algorithms demonstrate the effectiveness of the proposed HEDA in solving the SFTSP.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Baluja, S. (1994). Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163. Pittsburgh, PA: Carnegie Mellon University.

  • Baluja, S., & Davies, S. (1997). Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. In Proceedings of the 14th international conference on machine learning (pp. 30–38).

  • Cesar, R. M., Bengoetxea, E., Bloch, I., & Larranaga, P. (2005). Inexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms. Pattern Recognition, 38(11), 2099–2113.

    Article  Google Scholar 

  • Chen, S. H., & Chen, M. C. (2013). Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems. International Journal of Production Economics, 141(1), 24–33.

    Article  Google Scholar 

  • Chien, C. F., & Chen, C. H. (2007a). A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups. OR Spectrum, 29(3), 391–419.

    Article  Google Scholar 

  • Chien, C. F., & Chen, C. H. (2007b). Using genetic algorithms (GA) and a colored timed Petri net (CTPN) for modeling the optimization-based schedule generator of a generic production scheduling system. International Journal of Production Research, 45(8), 1763–1789.

    Article  Google Scholar 

  • De Bonet, J. S., Isbell, C. L., Jr. & Viola, P. (1997). MIMIC: Finding optima by estimating probability densities. In M. C. Mozer, M. I. Jordan, & T. Petsche (Eds.), Advances in neural information processing systems (pp. 424–430). Cambridge: MIT Press.

  • Freed, T., & Leachman, R. (1999). Scheduling semiconductor device test operations on multihead testers. IEEE Transactions on Semiconductor Manufacturing, 12(4), 523–530.

    Article  Google Scholar 

  • Hao, X. C., Wu, J. Z., Chien, C. F., & Gen, M. (2013). The cooperative estimation of distribution algorithm: A novel approach for semiconductor final test scheduling problems. Journal of Intelligent Manufacturing. doi:10.1007/s10845-013-0746-x.

  • Harik, G. (1999). Linkage learning via probabilistic modeling in the ECGA. Illigal Report NO. 99010, Illinois Genetic Algorithms Lboratory, Illinois: University of Illinois at Urbana-Champaign.

  • Harik, G. R., Lobo, F. G., & Goldberg, D. E. (1998). The compact genetic algorithm. In Proceedings of the IEEE conference on evolutionary computation (pp. 523–528).

  • Jarboui, B., Eddaly, M., & Siarry, P. (2009). An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computer & Operations Research, 36(9), 2638–2646.

    Article  Google Scholar 

  • Jeng, W. D., & Tsai, M. S. (2010). Scheduling semiconductor final testing a DBR based simulation model. In The 40th international conference on computers and industrial engineering (pp. 1–6).

  • Larranaga, P., & Lozano, J. A. (2002). Estimation of distribution algorithms: A new tool for evolutionary computation. Netherlands: Springer.

    Book  Google Scholar 

  • Lin, J. T., Wang, F. K., & Lee, W. T. (2004). Capacity-constrained scheduling for a logic IC final test facility. International Journal of Production Research, 42(1), 79–99.

    Article  Google Scholar 

  • Montgomery, D. C. (2005). Design and analysis of experiments. Arizona: Wiley.

    Google Scholar 

  • Mühlenbein, H., & Mahnig, T. (1999). Convergence theory and applications of the factorized distribution algorithm. Jounal of Computing and Information Technology, 7, 19–32.

    Google Scholar 

  • Mühlenbein, H., & Paass, G. (1996). From recombination of genes to the estimation of distributions I: Binary parameters. Lecture Notes in Computer Science, 1141, 178–187.

    Article  Google Scholar 

  • Ovacik, I. M., & Uzsoy, R. (1996). Decomposition methods for scheduling semiconductor testing facilities. International Journal of Flexible Manufacturing Systems, 8(4), 357–388.

    Article  Google Scholar 

  • Pearn, W. L., Chung, S. H., Chen, A. Y., & Yang, M. H. (2004). A case study on the multistage IC final testing scheduling problem with reentry. International Journal of Production Economics, 88(3), 257–267.

    Article  Google Scholar 

  • Pelikan, M., Goldberg, D. E., & Cantú-Paz, E. (1999). BOA: The bayesian optimization algorithm. In Proceedings of the genetic and evolutionary computation (pp. 525–532), San Francisco.

  • Pelikan, M., & Mühlenbein, H. (1999). The bivariate marginal distribution algorithm. In J. M. Benítez (Ed.), Advances in soft computing: Engineering design and manufacturing (pp. 521–535). London: Springer.

    Chapter  Google Scholar 

  • Saeys, Y., Degroeve, S., Aeyels, D., Van de Peer, Y., & Rouze, P. (2003). Fast feature selection using a simple estimation of distribution algorithm: A case study on splice site prediction. Bioinformatics, 19(suppl 2), 179–188.

    Article  Google Scholar 

  • Sagarna, R., & Lozano, J. (2003). On the performance of estimation of distribution algorithms applied to software testing. Technical Report EHU-KZAA-IK-1/03. The University of the Basque Country, Spain.

  • Uzsoy, R., Church, L. K., Ovacik, I. M., & Hinchman, J. (1993). Performance evaluation of dispatching rules for semiconductor testing operations. Journal of Electronics Manufacturing, 3(2), 95–105.

    Article  Google Scholar 

  • Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1992). Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine. Naval Research Logistics, 39(3), 369–388.

    Article  Google Scholar 

  • Uzsoy, R., Martin-Vega, L. A., Lee, C. Y., & Leonard, P. A. (1991). Production scheduling algorithms for a semiconductor test facility. IEEE Transactions on Semiconductor Manufacturing, 4(4), 270–280.

    Article  Google Scholar 

  • Wang, L., & Fang, C. (2012). An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. Computer & Operations Research, 39(2), 449–460.

    Article  Google Scholar 

  • Wang, L., Wang, S. Y., & Fang, C. (2012a). An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem. Expert Systems with Applications, 39(5), 5593–5599.

    Article  Google Scholar 

  • Wang, L., Wang, S. Y., & Liu, M. (2013a). A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem. International Journal of Production Research, 51(12), 3574–3592.

    Google Scholar 

  • Wang, S. Y., Wang, L., Liu, M., & Xu, Y. (2013c). An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines. The International Journal of Advanced Manufacturing Technology. doi:10.1007/s00170-013-4819-y.

  • Wang, S. Y., Wang, L., Xu, Y., & Liu, M. (2013b). An effective estimation of distribution algorithm for the flexible job-shop scheduling problem with fuzzy processing time. International Journal of Production Research, 51(12), 3778–3793.

    Google Scholar 

  • Wang, L., Wang, S. Y., Xu, Y., Zhou, G., & Liu, M. (2012b). A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Computers & Industrial Engineering, 62(4), 917–926.

    Article  Google Scholar 

  • Wu, J. Z., & Chien, C. F. (2008). Modeling semiconductor testing job scheduling and dynamic testing machine configuration. Expert Systems with Applications, 35(1–2), 485–496.

    Article  Google Scholar 

  • Wu, J. Z., Hao, X. C., Chien, C. F., & Gen, M. (2012). A novel bi-vector encoding genetic algorithm for the simultaneous multiple resources scheduling problem. Journal of Intelligent Manufacturing, 23(6), 2255–2270.

    Article  Google Scholar 

  • Zhang, Z. C., Zheng, L., Hou, F., & Li, N. (2011). Semiconductor final test scheduling with Sarsa \((\lambda, \text{ k })\) algorithm. European Journal of Operational Research, 215(2), 446–458.

    Article  Google Scholar 

Download references

Acknowledgments

This research is partially supported by the National Key Basic Research and Development Program of China (No. 2013CB329503), the National Science Foundation of China (Nos. 61174189 and 61025018), the Doctoral Program Foundation of Institutions of Higher Education of China (No. 20100002110014), and the National Science and Technology Major Project of China (No. 2011ZX0250 4-008).

Author information

Authors and Affiliations

  1. Tsinghua National Laboratory for Information Science and Technology (TNList), Department of Automation, Tsinghua University, Beijing, 100084, China

    Shengyao Wang, Ling Wang, Min Liu & Ye Xu

Authors
  1. Shengyao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ling Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Min Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ye Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shengyao Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, S., Wang, L., Liu, M. et al. A hybrid estimation of distribution algorithm for the semiconductor final testing scheduling problem. J Intell Manuf 26, 861–871 (2015). https://doi.org/10.1007/s10845-013-0821-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-013-0821-3

Keywords

Search

Navigation