Loading [MathJax]/extensions/MathZoom.js
Efficient Due-Date Quoting and Production Scheduling for Integrated Circuit Packaging With Reentrant Processes | IEEE Journals & Magazine | IEEE Xplore

Efficient Due-Date Quoting and Production Scheduling for Integrated Circuit Packaging With Reentrant Processes


Abstract:

The advances in packaging technology in the past decade have overcome a few engineering limitations in integrated circuit (IC) manufacturing. This has greatly complicated...Show More

Abstract:

The advances in packaging technology in the past decade have overcome a few engineering limitations in integrated circuit (IC) manufacturing. This has greatly complicated the manufacturing process and created a huge challenge in the operations management of the semiconductor back-end production. In particular, the modern demand of lighter and smaller products expedites the multichip packaging technology, which requires reentrant processes and hence makes resource scheduling more difficult. Apart from the fact that IC packaging shares many key features with the semiconductor front-end production, the cycle time of back-end production is significantly shorter than that of the front-end production. Therefore, there is an urgent need of a rapid solution procedure to generate a reliable production schedule for IC packaging. To respond to customer requests efficiently, this paper models the production scheduling of IC packaging as an optimization model and formulates a hybrid genetic algorithm (GA) to solve the problem efficiently. The embedded structure of our model enables the decomposition of the original problems into many small-sized subproblems, which can be solved by available optimization solvers. These subproblems communicate via a master problem, which is solved by a GA to determine the due dates assigned to subproblems. The master and the subproblems are iteratively solved in turn to obtain a satisfactory solution. Computational experiments and an empirical study are performed to validate the efficiency and the feasibility of the proposed approach.
Page(s): 1487 - 1495
Date of Publication: 12 July 2018

ISSN Information:

Funding Agency:

References is not available for this document.

I. Introduction

An integrated circuit (IC) is a set of electronic circuits on one small plate for performing particular functions. The size of ICs is definitely a key factor to many chip makers’ competitiveness due to the requirement in consumer electronics from customers—much lighter, smaller, and thinner [1]. Multichip packaging (MCP) is an important facet of modern electronic miniaturization and microelectronic systems. MCP techniques incorporate multiple dies and/or packaged devices into a single package, which increases density and also reduces size and weight at the board or system level, achieving greater functionality in a time-to-market window. MCP techniques answer the demands of customers, but they also create greater complexity in the operations management of IC assembly facilities.

Select All
1.
J. Zheng, Z. Zhang, Y. Chen and J. Shi, "3D stacked package technology and its application prospects", Proc. Int. Conf. New Trends Inf. Service Sci., pp. 528-533, Jun./Jul. 2009.
2.
L. Mönch, J. W. Fowler, S. Dauzère-Pérès, S. J. Mason and O. Rose, "A survey of problems solution techniques and future challenges in scheduling semiconductor manufacturing operations", J. Scheduling, vol. 14, no. 6, pp. 583-599, 2011.
3.
C. Blum, A. Roli and M. Sampels, Hybrid Metaheuristics: An Emerging Approach to Optimization, New York, NY, USA:Springer, vol. 114, 2008.
4.
W. L. Pearn, S. H. Chung and C. M. Lai, "Scheduling integrated circuit assembly operations on die bonder", IEEE Trans. Electron. Packag. Manuf., vol. 30, no. 2, pp. 97-105, Apr. 2007.
5.
B.-S. Chung, J. Lim, I.-B. Park, J. Park, M. Seo and J. Seo, "Setup change scheduling for semiconductor packaging facilities using a genetic algorithm with an operator recommender", IEEE Trans. Semicond. Manuf., vol. 27, no. 3, pp. 377-387, Aug. 2014.
6.
M. T. Zhang, S. Niu, S. Deng, Z. Zhang, Q. Li and L. Zheng, "Hierarchical capacity planning with reconfigurable kits in global semiconductor assembly and test manufacturing", IEEE Trans. Autom. Sci. Eng., vol. 4, no. 4, pp. 543-552, Oct. 2007.
7.
Y. Song, M. T. Zhang, J. Yi, L. Zhang and L. Zheng, "Bottleneck station scheduling in semiconductor assembly and test manufacturing using ant colony optimization", IEEE Trans. Autom. Sci. Eng., vol. 4, no. 4, pp. 569-578, Oct. 2007.
8.
V. Erramilli and S. J. Mason, "Multiple orders per job compatible batch scheduling", IEEE Trans. Electron. Packag. Manuf., vol. 29, no. 4, pp. 285-296, Oct. 2006.
9.
N. Yalaoui, L. Amodeo, F. Yalaoui and H. Mahdi, "Efficient methods to schedule reentrant flowshop system", J. Intell. Fuzzy Syst., vol. 26, no. 3, pp. 1113-1121, 2014.
10.
K. Knutson, K. Kempf, J. Fowler and M. Carlyle, "Lot-to-order matching for a semiconductor assembly and test facility", IIE Trans., vol. 31, no. 11, pp. 1103-1111, 1999.
11.
J. T. Lin, F. K. Wang and W. T. Lee, "Capacity-constrained scheduling for a logic IC final test facility", Int. J. Prod. Res., vol. 42, no. 1, pp. 79-99, 2004.
12.
F. Tovia, S. J. Mason and B. Ramasami, "A scheduling heuristic for maximizing wirebonder throughput", IEEE Trans. Electron. Packag. Manuf., vol. 27, no. 2, pp. 145-150, Apr. 2004.
13.
T. Yang and Y.-A. Shen, "Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem: Integrated-circuit wire bonding", Prod. Planning Control, vol. 23, no. 1, pp. 67-78, 2012.
14.
J. F. Bard, S. Jia, R. Chacon and J. Stuber, "Integrating optimisation and simulation approaches for daily scheduling of assembly and test operations", Int. J. Prod. Res., vol. 53, no. 9, pp. 2617-2632, 2015.
15.
J. Lim, M.-J. Chae, Y. Yang, I.-B. Park, J. Lee and J. Park, "Fast scheduling of semiconductor manufacturing facilities using case-based reasoning", IEEE Trans. Semicond. Manuf., vol. 29, no. 1, pp. 22-32, Feb. 2016.
16.
L. Y. Hsieh, E. Huang, C.-H. Chen, S. Zhang and K.-H. Chang, "Application of multi-fidelity simulation modelling to integrated circuit packaging", Int. J. Simul. Process Model., vol. 11, no. 3, pp. 259-269, 2016.
17.
R. Cuckler, K.-H. Chang and L. Y. Hsieh, "Optimal parallel machine allocation problem in IC packaging using IC-PSO: An empirical study", Asia–Pacific J. Oper. Res., vol. 34, no. 6, pp. 1-20, 2017.
18.
R. Kolisch and A. Drexl, "Local search for nonpreemptive multi-mode resource-constrained project scheduling", IIE Trans., vol. 29, no. 11, pp. 987-999, 1997.
19.
M. Gen and R. Cheng, Genetic Algorithms and Engineering Optimization, Hoboken, NJ, USA:Wiley, vol. 7, 2000.
20.
K.-F. Man, K. S. Tang and S. Kwong, Genetic Algorithms: Concepts and Designs, New York, NY, USA:Springer, 2012.
21.
K. Kato and M. Sakawa, "Genetic algorithms with decomposition procedures for multidimensional 0-1 knapsack problems with block angular structures", IEEE Trans. Syst. Man Cybern. B. Cybern., vol. 33, no. 3, pp. 410-419, Jun. 2003.
22.
F. W. Glover and M. Laguna, Tabu Search, New York, NY, USA:Springer, 2013.
23.
W. E. Hart, N. Krasnogor and J. E. Smith, Recent Advances in Memetic Algorithms, New York, NY, USA:Springer, vol. 166, 2004.
24.
K. Y. Li and R. J. Willis, "An iterative scheduling technique for resource-constrained project scheduling", Eur. J. Oper. Res., vol. 56, no. 3, pp. 370-379, 1992.
25.
L. Özdamar and G. Ulusoy, "An iterative local constraints based analysis for solving the resource constrained project scheduling problem", J. Oper. Manage., vol. 14, no. 3, pp. 193-208, 1996.

Contact IEEE to Subscribe

References

References is not available for this document.